Security Analysis of Word Problem-Based Cryptosystems - ENSTA Paris - École nationale supérieure de techniques avancées Paris Accéder directement au contenu
Article Dans Une Revue Designs, Codes and Cryptography Année : 2010

Security Analysis of Word Problem-Based Cryptosystems

Résumé

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.

Dates et versions

hal-00974889 , version 1 (07-04-2014)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More