Abstract
Infinite groups have been used for cryptography since about twenty years ago. However, it has not been so fruitful as using finite groups. An important reason seems the lack of research on building a solid mathematical foundation for the use of infinite groups in cryptography. As a first step for this line of research, this paper pays attention to a property, the so-called right-invariance, which makes finite groups so convenient in cryptography, and gives a mathematical framework for correct, appropriate use of it in infinite groups.
Chapter PDF
Similar content being viewed by others
References
Angluin, D., Lichtenstein, D.: Provable Security of Cryptosystmes: A Survey, Computer Science Department, Yale University, TR-288 (1983)
Anshel, I., Anshel, M., Fisher, B., Goldfeld, D.: New Key Agreement Protocols in Braid Group Cryptography. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 13–27. Springer, Heidelberg (2001)
Blackburn, S.R.: Cryptanalysis of two cryptosystems based on group actions. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 52–61. Springer, Heidelberg (1999)
Blum, M., Micali, S.: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. SIAM J. Comput. 13, 850–864 (1984)
Borovik, A.V., Myasnikov, A.G., Remeslennikov, V.N.: Multiplicative Measures on Free Groups. To appear in Internat. J. Algebra Comp.
Borovik, A.V., Myasnikov, A.G., Shpilrain, V.: Measuring Sets in Infinite Groups. Contemporary Mathematics 298, 21–42 (2002)
Cheon, J.H., Jun, B.: A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 212–225. Springer, Heidelberg (2003)
Feigenbaum, J.: Locally Random Reductions in Interactive Complexity Theory. Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS 13, 73–98 (1993)
Garzon, M., Zalcstein, Y.: The Complexity of Grigorchuk Groups with Application to Cryptography. Theoretical Computer Sciences 88, 83–88 (1991)
Gennaro, R., Micciancio, D.: Cryptanalysis of a Pseudorandom Generator Based on Braid Groups. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 1–13. Springer, Heidelberg (2002)
Hofheinz, D., Steinwandt, R.: A Practical Attack on Some Braid Group based Cryptographic Primitives. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 187–198. Springer, Heidelberg (2002)
Hughes, J.: A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 176–189. Springer, Heidelberg (2002)
Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, J.S., Park, C.: New Public-key Cryptosystem Using Braid Groups. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 166–183. Springer, Heidelberg (2000)
Lee, E.: Braid Groups in Cryptology. IEICE Trans. Fund. 7-A, 986–992 (2004)
Lee, E., Lee, S.J., Hahn, S.G.: Pseudorandomness from Braid Groups. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 486–502. Springer, Heidelberg (2001)
Lee, E., Park, J.H.: Cryptanalysis of the Public-key Encryption based on Braid Groups. In: Palma, J.M.L.M., Sousa, A.A., Dongarra, J., Hernández, V. (eds.) VECPAR 2002. LNCS, vol. 2565, pp. 477–490. Springer, Heidelberg (2003)
Lee, S.J., Lee, E.: Potential Weaknesses of the Commutator Key Agreement Protocol based on Braid Groups. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 14–28. Springer, Heidelberg (2002)
Pak, I.: Random Walks on Finite Groups with Few Random Generators. Electronic J. of Prob. 4, 1–11 (1999)
Shor, P.W.: Polynomial-time Algorithms for Prime Factorization and Discrete Logarithms on a quantum Computer. SIAM J. Comput. 26, 1484–1509 (1997)
Sibert, H., Dehornoy, P., Girault, M.: Entity Authentication Schemes Using Braid Word Reduction. In: Proceedings International Workshop on Coding and Cryptography, Versailles, France, March 24-28, pp. 153–164 (2003)
Siromoney, R., Mathew, L.: A Public key Cryptosystem based on Lyndon Words. Information Processing Letters 35, 33–36 (1990)
Yamamura, A.: Public-Key Cryptosystems Using the Modular Group. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 203–216. Springer, Heidelberg (1998)
Yamamura, A.: A Functional Cryptosystem Using a Group Action. In: Pieprzyk, J.P., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol. 1587, pp. 314–325. Springer, Heidelberg (1999)
Wagner, N.R., Magyarik, M.R.: A Public-key Cryptosystem based on the Word Problem. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 19–36. Springer, Heidelberg (1985)
Woess, W.: Cogrowth of groups and simple Random Walks. Arch. Math. 41, 363–370 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, E. (2004). Right-Invariance: A Property for Probabilistic Analysis of Cryptography Based on Infinite Groups. In: Lee, P.J. (eds) Advances in Cryptology - ASIACRYPT 2004. ASIACRYPT 2004. Lecture Notes in Computer Science, vol 3329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30539-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-30539-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23975-8
Online ISBN: 978-3-540-30539-2
eBook Packages: Springer Book Archive