A KEY AGREEMENT PROTOCOL BASED ON NETWORK DYNAMICS

摘要

A system and method for an unconditionally secure protocol to create identicalpads or keysbetween two parties communicating over any network is provided. The protocolis composed of threeparts, as follows, Firstly, the two parties generate an initial correlatedstring K A, K B of length N froma finite alphabet in a pre-arranged way from a commonly known probabilisticvector of real numbers.Secondly, the two parties engage in Information Consolidation andReconciliation in order toreconcile differences. Finally, Privacy Amplification is used to cancel anyinformation that aneavesdropper may have acquired and to produce the key or pad. This keyagreement protocol createsunconditionally secure cryptography with a symmetric key cryptosystem.Alternatively, thesymmetric keys can be used as a one-time pad with unconditional security.