On Wagner-Magyarik Cryptosystem - ENSTA Paris - École nationale supérieure de techniques avancées Paris Access content directly
Journal Articles Lecture Notes in Computer Science Year : 2006

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.

Dates and versions

hal-00978821 , version 1 (14-04-2014)

Identifiers

Cite

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

Collections

ENSTA UMA_ENSTA
169 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More