Security analysis of word problem-based cryptosystems

Authors:
Françoise Levy-Dit-Vehel;Ludovic Perret
Affiliations:
ENSTA, Paris Cedex 15, France 75739;LIP6/INRIA/SALSA, University Paris 6, Paris, France 75016
Venue:
Designs, Codes and Cryptography
Year:
2010

Citing 6
Cited 0

A public key cryptosystem based on the word problem

Proceedings of CRYPTO 84 on Advances in cryptology
The word problem for free partially commutative groups

Journal of Symbolic Computation
String-rewriting systems

String-rewriting systems
Confluent and Other Types of Thue Systems

Journal of the ACM (JACM)
A Reaction Attack on a Public Key Cryptosystem Based on the Word Problem

Applicable Algebra in Engineering, Communication and Computing
On the wagner–magyarik cryptosystem

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.