Abstract
At indocrypt 2003, Abisha, Thomas and Subramanian have proposed a public key encryption scheme and a zero-knowledge authentication protocol based on the word problem on monoids, as well as a group variant of these systems. We here present a total break attack on each of the two encryption schemes. The complexity bounds of our algorithms show that these schemes are insecure for practical parameter sizes. In the monoid setting, we go one step further by proposing an algorithm that breaks the NP-hard problem underlying both the encryption scheme and the zero-knowledge protocol, as well as an upper bound on its complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abisha, P.J., Thomas, D.G., Subramanian, K.G.: Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 218–227. Springer, Heidelberg (2003)
Aho, A., Sethi, R., Ullman, J.: Code optimization and finite Church-Rosser systems. In: Rustin, R. (ed.) Design and Optimization of Computers, pp. 89–105. Prentice-Hall, Englewood Cliffs (1972)
Book, R.V.: Confluent and other types of Thue systems. Journal of the ACM 29, 171–182 (1982)
Book, R.V., Liu, H.N.: Rewriting systems and word problems in a free partially commutative monoid. Information Processing Letters 26, 29–32 (1987/1988)
Cori, R., Perrin, D.: Automates et commutations partielles. R.A.I.R.O. Informatique théorique 19, 21–32 (1985)
Kari, J.: A cryptanalytic observation concerning systems based on language theory. Discrete Applied Mathematics 21, 45–53 (1988)
Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory. Trudy Mat. Inst. Steklov 44, 1–143 (1955)
González-Vasco, M.I., Steinwandt, R.: Pitfalls in public key systems based on free partially commutative monoids an groups. Cryptology ePrint archive 2004/012
González-Vasco, M.I., Steinwandt, R.: A Reaction Attack on a Public Key Cryptosystem Based on the Word Problem. Applicable Algebra Engineering, Communication and Computing 14(5), 335–340 (2004)
Oleshchuk, V.A.: On Public-Key Cryptosystem Based on Church-Rosser String-Rewriting Systems. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol. 959, pp. 264–269. Springer, Heidelberg (1995)
Salomaa, A.: A public key cryptosystem based on language theory. Computers and Security 7, 83–87 (1988)
Siromoney, R., Matthew, L.: A public key cryptosystem based on Lyndon words. Information Processing Letters 35, 33–36 (1990)
Subramanian, K.G., Siromoney, R., Abisha, P.J.: A DOL-TOL public key cryptosystem. Information Processing Letters 26, 95–97 (1987)
Turing, A.M.: The word problem in semi-groups with cancellation. Annals of Math. 52(2), 491–505 (1950)
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)
Wrathall, C.: The word problem for free partially commutative groups. Journal of Symbolic Computation 6, 99–104 (1988)
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
Levy-dit-Vehel, F., Perret, L. (2004). Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. In: Canteaut, A., Viswanathan, K. (eds) Progress in Cryptology - INDOCRYPT 2004. INDOCRYPT 2004. Lecture Notes in Computer Science, vol 3348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30556-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-30556-9_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24130-0
Online ISBN: 978-3-540-30556-9
eBook Packages: Computer ScienceComputer Science (R0)