Abstract
A further development of the key sharing protocol presented at previous FRUCT -31 session is proposed in the current paper. In contrast to the previous protocol executing by an exchange of real integers over Internet channel, a new protocol version operates with binary bits and all operations are modulo two additions. Such version significantly decreases channel traffic required for key sharing and a complexity of signal processing. The full description of protocol is given. Optimality of signal processing proposed in the paper for eavesdropper is proved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.