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.
Type de document :
Article dans une revue
Designs, Codes and Cryptography, Springer Verlag, 2010, 54 (1), pp.29-41. 〈10.1007/s10623-009-9307-x〉
Liste complète des métadonnées

https://hal-ensta.archives-ouvertes.fr/hal-00974889
Contributeur : Aurélien Arnoux <>
Soumis le : lundi 7 avril 2014 - 15:51:11
Dernière modification le : vendredi 31 août 2018 - 09:25:54

Lien texte intégral

Identifiants

Collections

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〉

Partager

Métriques

Consultations de la notice

289