Security Analysis of Word Problem-Based Cryptosystems

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.
Document type :
Journal articles
Complete list of metadatas

https://hal-ensta-paris.archives-ouvertes.fr//hal-00974889
Contributor : Aurélien Arnoux <>
Submitted on : Monday, April 7, 2014 - 3:51:11 PM
Last modification on : Wednesday, July 3, 2019 - 10:48:04 AM

Links full text

Identifiers

Citation

Françoise Levy-Dit-Vehel, Ludovic Perret. Security Analysis of Word Problem-Based Cryptosystems. Designs, Codes and Cryptography, Springer Verlag, 2010, 54 (1), pp.29-41. ⟨10.1007/s10623-009-9307-x⟩. ⟨hal-00974889⟩

Share

Metrics

Record views

327