Security Analysis of Word Problem-Based Cryptosystems - ENSTA Paris - École nationale supérieure de techniques avancées Paris Access content directly
Journal Articles Designs, Codes and Cryptography Year : 2010

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.

Dates and versions

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

Identifiers

Cite

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⟩
121 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More