A New Method for Exchanging Secret Keys

Methods for exchanging secret keys are essential for electronic commerce transactions. In this paper the well-known Diffie-Hellman-method is generalized to non-Abelian groups. The new method is easy to implement and contains the original method as a special case. It is to be expected that it provides higher levels of security than the original method

[1]  Eonkyung Lee,et al.  Cryptanalysis of the Public-Key Encryption Based on Braid Groups , 2003, EUROCRYPT.

[2]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[3]  Emmanuel Bresson,et al.  The Group Diffie-Hellman Problems , 2002, Selected Areas in Cryptography.

[4]  Choonsik Park,et al.  New Public Key Cryptosystem Using Finite Non Abelian Groups , 2001, CRYPTO.

[5]  Rudolf Lide,et al.  Finite fields , 1983 .

[6]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[7]  Jung Hee Cheon,et al.  New Public-Key Cryptosystem Using Braid Groups , 2000, CRYPTO.

[8]  V. Varadharajan,et al.  Public Key distribution in matrix rings , 1984 .

[9]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[10]  Vijay Varadharajan,et al.  Security of public key distribution in matrix rings , 1986 .

[11]  Craig Gentry,et al.  Cryptanalysis of the Revised NTRU Signature Scheme , 2002, EUROCRYPT.

[12]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[13]  Charles M. Fiduccia,et al.  An Efficient Formula for Linear Recurrences , 1985, SIAM J. Comput..

[14]  Craig Gentry.  Key Recovery and Message Attacks on NTRU-Composite , 2001, EUROCRYPT.

[15]  Joseph H. Silverman,et al.  NTRU: A Ring-Based Public Key Cryptosystem , 1998, ANTS.

[16]  Iris Anshel,et al.  New Key Agreement Protocols in Braid Group Cryptography , 2001, CT-RSA.

[17]  Dennis Hofheinz,et al.  A Practical Attack on Some Braid Group Based Cryptographic Primitives , 2003, Public Key Cryptography.

[18]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .