论文信息 - Security analysis of word problem-based cryptosystems

Security analysis of word problem-based cryptosystems

We investigate two schemes based on the word problem on groups. From a complexity-theoretic point of view, we show that the problems underlying those schemes are equivalent. We then present a reaction attack on one of the schemes, thus easily transposed to the other. The attack, besides its efficiency, permits to recover an equivalent secret key.

Ludovic Perret | Françoise Levy-dit-Vehel

[1] Ronald V. Book,et al. Confluent and Other Types of Thue Systems , 1982, JACM.

[2] Neal R. Wagner,et al. A Public Key Cryptosystem Based on the Word Problem , 1985, CRYPTO.

[3] Friedrich Otto,et al. String-Rewriting Systems , 1993, Text and Monographs in Computer Science.

[4] Rainer Steinwandt,et al. Pitfalls in public key cryptosystems based on free partially commutative monoids and groups , 2006, Appl. Math. Lett..

[5] Celia Wrathall. The Word Problem for Free Partially Commutative Groups , 1988, J. Symb. Comput..

[6] Rainer Steinwandt,et al. A Reaction Attack on a Public Key Cryptosystem Based on the Word Problem , 2003, Applicable Algebra in Engineering, Communication and Computing.

[7] Ludovic Perret,et al. On the Wagner-Magyarik Cryptosystem , 2005, WCC.

[8] K. G. Subramanian,et al. Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups , 2003, INDOCRYPT.