Design of the late-model key exchange algorithm based on the polymorphic cipher
Yifeng Yin, Yong Gan, Hongyan Liu, Yupu Hu · 2010
Diffie-Hellman key exchange algorithm, which is used in regular scenes base on the discrete logarithm problem, demands that typically two communication parties should struck up a lively conversation leading to a long-term dependable fellowship. A high efficiency the polymorphic key exchange algorithm is proposed that is based on the polymorphic key exchange protocol. The identity information of two parties can be appended to the agreement. Both communication parties use their PRNGs to finish the polymorphic virtual S-box together. The security of the PRNG was analyzed by the Strict Avalanche Criterion and some experimental results. It was proposed that the polymorphic key exchange algorithm can become a broad agreement in irregular scenes.