New public-key cryptosystem using braid groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1880, Issue , 2000, Pages 166-183

  Ko, Ki Hyoung ^a   Lee, Sang Jin ^a   Cheon, Jung Hee ^b   Han, Jae Woo ^c   Kang, Ju Sung ^c   Park, Choonsik ^c  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b BROWN UNIVERSITY   (United States)

^c Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

Author keywords

Braid group; Conjugacy problem; Hard problem; Key exchange; Non commutative group; One way function; Public key cryptosystem; Public key infrastructure

Indexed keywords

NUMBER THEORY; PUBLIC KEY CRYPTOGRAPHY;

BRAID GROUPS; CONJUGACY; HARD PROBLEMS; KEY EXCHANGE; NON-COMMUTATIVE; ONE-WAY FUNCTIONS; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEY INFRASTRUCTURE;

GROUP THEORY;

EID: 84974622583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_10     Document Type: Conference Paper

References (37)

1. 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.
2. I. Anshel, M. Anshel and D. Goldfeld, An algebraic method for public-key cryptography, Mathematical Research Letters 6 (1999) 287-291.
3. E. Artin, Theory of braids, Annals of Math. 48 (1947), 101-126.
4. 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.
5. J. S. Birman, Braids, links and mapping class groups, Annals of Math. Study, no. 82, Princeton University Press (1974).
6. J. S. Birman, K. H. Ko and S. J. Lee, A newappr oach to the word and conjugacy problems in the braid groups, Advances in Math. 139 (1998), 322-353.
7. D. Boneh, Twenty years of attacks on the RSA cryptosystem, Notices Amer. Math. Soc. 46 (1999), 203-213.
8. G. Brassard, A note on the complexity of cryptography, IEEE Transactions on Information Theory 25 (1979), 232-233.
9. 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.
10. P. Dehornoy, A fast method for comparing braids, Advances in Math. 125 (1997), 200-235.
11. W. Diffie and M. E. Hellman, Newdir ections in cryptography, IEEE Transactions on Informaton Theory 22 (1976), 644-654.
12. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory 31 (1985), 469-472.
13. E. A. Elrifai and H. R. Morton, Algorithms for positive braids, Quart. J. Math. Oxford 45 (1994), no. 2, 479-497.
14. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson and W. Thurston, Word processing in groups, Jones & Bartlett, 1992.
15. 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.
16. F. A. Garside, The braid group and other groups, Quart. J. Math. Oxford 20 (1969), no. 78, 235-254.
17. M. Garzon and Y. Zalcstein, The complexity of Grigorchuk groups with application to cryptography, Theoretical Computer Sciences 88 (1991) 83-98.
18. 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.
19. E. S. Kang, K. H. Ko and S. J. Lee, Band-generator presentation for the 4-braid group, Topology Appl. 78 (1997), 39-60.
20. K. Komaya, U. Maurer, T. Okamoto and S. Vanston, Newpublic-key schemes bases on elliptic curves over the ring Zn, Advances in Cryptology, Proceedings of Crypto ’91, Lecture Notes in Computer Science 576, ed. J. Feigenbaum, Springer-Verlag (1992), 252-266
21. N. Koblitz, Algebraic aspects of cryptography, Algorithms and Computations in Mathematics 3 (1998) Springer-Verlag, Berlin.
22. 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.
23. K. McCurley, A key distribution system equivalent to factoring, Journal of Cryptology 1 (1988), 95-105.
24. R. C. Merkle and M. E. Hellman, Hiding information and signatures in trapdoor knapsacks, IEEE Transactions on Information Theory 24 (1978), 525-530.
25. L. Mosher, Mapping class groups are automatic, Ann. Math. 142 (1995), 303-384.
26. A. M. Odlyzko, The rise and fall of knapsack cryptosystems, Cryptology and Computational Number Theory, Proc. Symp. App. Math. 42 (1990), 75-88.
27. M. S. Paterson and A. A. Rasborov, The set of minimal braids is co-NP-complete, J. Algorithms. 12 (1991), 393-408.
28. M. O. Rabin, Digitized signatures and public-key functions as intractible as factorization, MIT Laboratory for Computer Science Technical Report, LCS/TR-212 (1979).
29. 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.
30. 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.
31. R. Siromoney and L. Mathew, A public key cryptosystem based on Lyndon words, Information Proceeding Letters 35 (1990) 33-36.
32. P. Smith and M. Lennon, LUC: A newpublic key system, Proceedings of the IFIP TC11 Ninth International Conference on Information Security, ed. E. Dougall, IFIP/Sec 93, 103-117, North-Holland, 1993.
33. R. P. Stanley, Enumerative combinatorics, Wadsworth and Brooks/Cole, 1986.
34. 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.
35. 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.
36. 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.
37. 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.