Abstract
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.
Chapter PDF
References
I. Anshel and M. Anshel, From the Post-Markov theorem through decision problems to public-key cryptography, Amer. Math. Monthly 100 (1993), no. 9, 835–844.
I. Anshel, M. Anshel and D. Goldfeld, An algebraic method for public-key cryptography Mathematical Research Letters 6 (1999) 287–291.
E. Artin, Theory of braids, Annals of Math. 48 (1947), 101–126.
C. H. Bennet and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Proc. IEEE Int. Conf. Computers, Systems and Signal Processing (Bangalore, India, 1984), 175–179.
J. S. Birman, Braids, links and mapping class groups, Annals of Math. Study, no. 82, Princeton University Press (1974).
J. S. Birman, K. H. Ko and S. J. Lee, A new approach to the word and conjugacy problems in the braid groups, Advances in Math. 139 (1998), 322–353.
D. Boneh, Twenty years of attacks on the RSA cryptosystem, Notices Amer. Math. Soc. 46 (1999), 203–213.
G. Brassard, A note on the complexity of cryptography, IEEE Transactions on Information Theory 25 (1979), 232–233.
E. F. Brickell, Breaking iterated knapsacks, Advances in Cryptology, Proceedings of Crypto’ 84, Lecture Notes in Computer Science 196, ed. G. R. Blakley and D. Chaum, Springer-Verlag (1985), 342–358.
P. Dehornoy, A fast method for comparing braids, Advances in Math. 125 (1997), 200–235.
W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Informaton Theory 22 (1976), 644–654.
T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory 31 (1985), 469–472.
E. A. Elrifai and H. R. Morton, Algorithms for positive braids, Quart. J. Math. Oxford 45 (1994), no. 2, 479–497.
D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson and W. Thurston, Word processing in groups, Jones & Bartlett, 1992.
R. Fenn, D. Rolfsen and J. Zhu Centralisers in the braid group and singular braid monoid, Enseign. Math. (2) 42 (1996), no. 1–2, 75–96.
F. A. Garside, The braid group and other groups, Quart. J. Math. Oxford 20 (1969), no. 78, 235–254.
M. Garzon and Y. Zalcstein, The complexity of Grigorchuk groups with application to cryptography, Theoretical Computer Sciences 88 (1991) 83–98.
O. Goldreich, S. Goldwasser and S. Halevi, Public-key cryptosystems from lattice reduction problems, Advances in Cryptology, Proceedings of Crypto’ 97, Lecture Notes in Computer Science 1294, ed. B. Kaliski, Springer-Verlag (1997), 112–131.
E. S. Kang, K. H. Ko and S. J. Lee, Band-generator presentation for the 4-braid group, Topology Appl. 78 (1997), 39–60.
K. Komaya, U. Maurer, T. Okamoto and S. Vanston, New public-key schemes bases on elliptic curves over the ring Z n , Advances in Cryptology, Proceedings of Crypto’ 91, Lecture Notes in Computer Science 576, ed. J. Feigenbaum, Springer-Verlag (1992), 252–266
N. Koblitz, Algebraic aspects of cryptography, Algorithms and Computations in Mathematics 3 (1998) Springer-Verlag, Berlin.
J. C. Lagarias, Knapsack public key cryptosystems and Diophantine approximation, Advances in Cryptology: Proceedings of Crypto’ 83, ed. by D. Chaum, Plenum Publishing (1984), 3–24.
K. McCurley, A key distribution system equivalent to factoring, Journal of Cryptology 1 (1988), 95–105.
R. C. Merkle and M. E. Hellman, Hiding information and signatures in trapdoor knapsacks, IEEE Transactions on Information Theory 24 (1978), 525–530.
L. Mosher, Mapping class groups are automatic, Ann. Math. 142 (1995), 303–384.
A. M. Odlyzko, The rise and fall of knapsack cryptosystems, Cryptology and Computational Number Theory, Proc. Symp. App. Math. 42 (1990), 75–88.
M. S. Paterson and A. A. Rasborov, The set of minimal braids is co-NP-complete, J. Algorithms. 12 (1991), 393–408.
M. O. Rabin, Digitized signatures and public-key functions as intractible as factorization, MIT Laboratory for Computer Science Technical Report, LCS/TR-212 (1979).
R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM 21 (1978), 120–126.
A. Shamir, A polynomial time algorithm for breaking the basis Merkle-Hellman cryptosystem, Advances in Cryptology: Proceedings of Crypto’ 82, ed. by D. Chaum et al., Plenum Publishing (1983), 279–288.
R. Siromoney and L. Mathew, A public key cryptosystem based on Lyndon words, Information Proceeding Letters 35 (1990) 33–36.
P. Smith and M. Lennon, LUC: A new public key system, Proceedings of the IFIP TC11 Ninth International Conference on Information Security, ed. E. Dougall, IFIP/Sec 93, 103–117, North-Holland, 1993.
R. P. Stanley, Enumerative combinatorics, Wadsworth and Brooks/Cole, 1986.
Y. Tsiounis and M. Yung, On the security of Elgamal based encryption, In PKC’ 98, Lecture Notes in Computer Science 1431, Springer-Verlag (1998), 117–134.
S. Vaudenay, Cryptanalysis of the Chor-Rivest Cryptosystem, Advances in Cryptology: Proceedings of Crypto’ 98, Lecture Notes in Computer Science 1462, ed. Krawczyk, Springer-Verlag (1998), 243–256.
H. Williams, Some public-key crypto-funtions as intractible as factorization, Advances in Cryptology, Proceedings of Crypto’ 84, Lecture Notes in Computer Science 196, ed. G. R. Blakley and D. Chaum, Springer-Verlag (1985), 66–70.
N. R. Wagner and M. R. Magyarik, A public-key cryptosystem based on the word problem, Advances in Cryptology, Proceedings of Crypto’ 84, Lecture Notes in Computer Science 196, ed. G. R. Blakley and D. Chaum, Springer-Verlag (1985), 19–36.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, Js., Park, C. (2000). New Public-Key Cryptosystem Using Braid Groups. In: Bellare, M. (eds) Advances in Cryptology — CRYPTO 2000. CRYPTO 2000. Lecture Notes in Computer Science, vol 1880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44598-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-44598-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67907-3
Online ISBN: 978-3-540-44598-2
eBook Packages: Springer Book Archive