Pseudorandomness from braid groups

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

Volumn 2139 LNCS, Issue , 2001, Pages 486-502

  Lee, Eonkyung ^a   Lee, Sang Jin ^a   Hahn, Sang Geun ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES; WEAVING;

BRAID GROUPS; CRYPTOGRAPHIC PRIMITIVES; GROUP OPERATIONS; ONE-WAY FUNCTIONS; PROVABLY SECURE; PSEUDO RANDOM; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS;

CRYPTOGRAPHY;

EID: 84880879949     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44647-8_29     Document Type: Conference Paper

References (26)

1. W. Alexi, B. Chor, O. Goldreich, and C.P. Schnorr, RSA and Rabin functions: certain parts are as hard as the whole, SIAM J. Comput. 17 (1988) 194-209.
2. I. Anshel, M. Anshel, and D. Goldfeld, An algebraic method for public-key cryptography, Math. Res. Lett. 6 (1999) 287-291.
3. M. Bellare and P. Rogaway, Random oracles are Practical: a Paradigm for Designing Efficient Protocols, In 1st Annual Conference on Computer and Communications Security, ACM (1993) 62-73.
4. D. Bernardete, Z. Nitecki and M. Gutierrez, Braids and the Nielsen-Thurston classification, J. Knot theory and its ramifications 4 (1995) 549-618.
5. M. Bestvina and M. Handel, Train Tracks for surface automorphisms, Topology 34 (1995) 109-140.
6. J. Birman, Braids, links and the mapping class group, Ann. Math. Studies 82, Princeton Univ. Press (1974).
7. J.S. Birman, K.H. Ko, and S.J. Lee, New approaches to the world and conjugacy problem in the braid groups, Advances in Math. 139 (1998) 322-353.
8. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudorandom bits, SIAM J. Comput. 13 (1984) 850-864.
9. W. Diffie and M.E. Hellman, New Directions in Cryptography, IEEE Trans. on Info. Theory, IT-22 (1976) 644-654.
10. D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Patterson, and W. Thurston, Word processing in groups, Jones and Barlett, Boston and London (1992).
11. A. Fathi, F. Laudenbach, and V. Poénaru, Travaux de Thurston sur les surfaces, Astérisque (1979) 66-67.
12. J.B. Fischer and J. Stern, An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding, Proc. Eurocrypt '96, LNCS 1070, Springer-Verlag (1996) 245-255.
13. O. Goldreich, Foundation of Cryptography-Fragments of a Book, Available at http://www.theory.lcs.mit.edu/~oded/frag.html (1995).
14. O. Goldreich and L.A. Levin, Hard-core Predicates for any One-Way Function, 21st STOC (1989) 25-32.
15. S. Goldwasser, S. Micali, and R. Rivest, A Digital signature scheme secure against adaptive chosen-message attacks, SIAM J. Comput. 17 (1988) 281-308.
16. J. Hastad, R. Impaglizo, L.A. Levin, and M. Luby, A Pseudorandom Generator from any One-way Function, SIAM J. Comput. 28 (1999) 1364-1396.
17. R. Impagliazzo and M. Naor, Efficient cryptographic schemes provably as secure as subset sum, Proc. IEEE 30th Symp. on Found. of Comput. Sci. (1989) 231-241.
18. R. Impagliazzo and D. Zuckerman, Reclying random bits, Proc. 30th IEEE Symposium on Foundations of Computer Science (1989) 248-253.
19. K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, J.S. Kang, and C. Park, New Public-key Cryptosystem Using Braid Groups, Proc. Crypto 2000, LNCS 1880, Springer-Verlag (2000) 166-183.
20. J. Los, Pseudo-Anosov maps and invariant train track in the disc: a finite algorithm, Proc. Lond. Math. Soc. 66 (1993) 400-430.
21. J. McCarthy, Normalizers and centralizers of psuedo-Anosov mapping clases, Available at http://www.mth.msu.edu/~mccarthy/research/.
22. M. Naor and O. Reingold, Number-Theoretic constructions of efficient pseudorandom functions, Proc. 38th IEEE Symp. on Foundations of Computer Science (1997) 458-467.
23. M. Naor and O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions, J. of Computer and Systems Sciences 58 (1999) 336-375.
24. J. Nielsen, In Collected papers of J. Nielsen, Birkhauser (1986).
25. W. P. Thurston, On the geometry and dynamics of diffeomorphisms of surfaces, Bull. AMS 19 (1988) 417-431.
26. A. Yao, Theory and applications of trapdoor functions, Proc. 23rd IEEE Symp. of Found. of Comput. Sci. (1982) 80-91.