On Wagner-Magyarik Cryptosystem

Abstract : We investigate a monoid variant of the scheme based on the word problem on groups proposed by Wagner and Magyarik at Crypto'84, that has the advantage of being immune to reaction attacks so far. We study the security of this variant. Our main result is a complexity-theoretic one: we show that the problem underlying this cryptosystem, say WM, is NP-hard. We also present an algorithm for solving WM. Its complexity permits to shed light on the size of the parameters to choose to reach a given level of security.
Document type :
Journal articles
Complete list of metadatas

https://hal-ensta-paris.archives-ouvertes.fr//hal-00978821
Contributor : Aurélien Arnoux <>
Submitted on : Monday, April 14, 2014 - 5:18:07 PM
Last modification on : Wednesday, July 3, 2019 - 10:48:04 AM

Links full text

Identifiers

Collections

Citation

Françoise Levy-Dit-Vehel, Ludovic Perret. On Wagner-Magyarik Cryptosystem. Lecture Notes in Computer Science, Springer, 2006, 3969, pp.316-329. ⟨10.1007/11779360_25⟩. ⟨hal-00978821⟩

Share

Metrics

Record views

366