New Public-Key Cryptosystem Using Braid Groups

The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups can serve as a good source to enrich cryptography. The feature that makes the braid groups useful to cryptography includes the followings: (i) The word problem is solved via a fast algorithm which computes the canonical form which can be efficiently manipulated by computers. (ii) The group operations can be performed efficiently. (iii) The braid groups have many mathematically hard problems that can be utilized to design cryptographic primitives. The other is to propose and implement a new key agreement scheme and public key cryptosystem based on these primitives in the braid groups. The efficiency of our systems is demonstrated by their speed and information rate. The security of our systems is based on topological, combinatorial and group-theoretical problems that are intractible according to our current mathematical knowledge. The foundation of our systems is quite different from widely used cryptosystems based on number theory, but there are some similarities in design.

[1]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[2]  Peter J. Smith,et al.  LUC: A New Public Key System , 1993, SEC.

[3]  Rani Siromoney,et al.  A Public Key Cryptosystem Based on Lyndon Words , 1990, Inf. Process. Lett..

[4]  D. Goldfeld,et al.  An algebraic method for public-key cryptography , 1999 .

[5]  Adi Shamir,et al.  A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

[7]  Yechezkel Zalcstein,et al.  The Complexity of Grigorchuk Groups with Application to Cryptography , 1991, Theor. Comput. Sci..

[8]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[9]  Ernest F. Brickell,et al.  Breaking Iterated Knapsacks , 1985, CRYPTO.

[10]  Neal Koblitz,et al.  Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.

[11]  A. Shamir.  A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1982, FOCS 1982.

[12]  Joan S. Birman,et al.  Braids, Links, and Mapping Class Groups. (AM-82) , 1975 .

[13]  Hugh R. Morton,et al.  ALGORITHMS FOR POSITIVE BRAIDS , 1994 .

[14]  Serge Vaudenay,et al.  Cryptanalysis of the Chor-Rivest Cryptosystem , 1998, CRYPTO.

[15]  Lee Mosher.  Mapping Class Groups are Automatic , 1994 .

[16]  Tatsuaki Okamoto,et al.  New Public-Key Schemes Based on Elliptic Curves over the Ring Zn , 1991, CRYPTO.

[17]  F. A. Garside,et al.  THE BRAID GROUP AND OTHER GROUPS , 1969 .

[18]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[19]  Neal R. Wagner,et al.  A Public Key Cryptosystem Based on the Word Problem , 1985, CRYPTO.

[20]  Ki Hyoung Ko,et al.  Band-generator presentation for the 4-braid group , 1997 .

[21]  Joan S. Birman,et al.  A new approach to the word and conjugacy problems in the braid groups , 1997 .

[22]  Hugh C. Williams.  Some Public-Key Crypto-Functions as Intractable as Factorization , 1985, Cryptologia.

[23]  Gilles Brassard,et al.  A note on the complexity of cryptography (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[24]  Alexander A. Razborov,et al.  The Set of Minimal Braids is co-NP-Complete , 1991, J. Algorithms.

[25]  Oded Goldreich,et al.  Public-Key Cryptosystems from Lattice Reduction Problems , 1996, CRYPTO.

[26]  Hugh C. Williams,et al.  Some Public Key Crypto-Functions as Intractable as Factorization , 1985, CRYPTO.

[27]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[28]  Jeffrey C. Lagarias,et al.  Knapsack Public Key Cryptosystems and Diophantine Approximation , 1983, CRYPTO.

[29]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[30]  E. Artin.  The theory of braids. , 1950, American scientist.

[31]  David Chaum,et al.  Advances in Cryptology: Proceedings Of Crypto 83 , 2012 .

[32]  Andrew Odlyzko,et al.  The Rise and Fall of Knapsack Cryptosystems , 1998 .

[33]  Yiannis Tsiounis,et al.  On the Security of ElGamal Based Encryption , 1998, Public Key Cryptography.

[34]  Patrick Dehornoy,et al.  A Fast Method for Comparing Braids , 1997 .

[35]  Iris Anshel,et al.  From the Post-Markov Theorem Through Decision Problems to Public-Key Cryptography , 1993 .

[36]  J. Birman.  Braids, Links, and Mapping Class Groups. , 1975 .

[37]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[38]  Dan Boneh,et al.  TWENTY YEARS OF ATTACKS ON THE RSA CRYPTOSYSTEM , 1999 .

[39]  Jun Zhu,et al.  Centralisers in the braid group and singular braid monoid , 1996 .

[40]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .