@inproceedings{b866d84fc0ec449d83b5a4510af725fc,
title = "On the 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.",
author = "Fran{\c c}oise Levy-Dit-Vehel and Ludovic Perret",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11779360\_25",
language = "English",
isbn = "3540354816",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "316--329",
booktitle = "Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers",
note = "International Workshop on Coding and Cryptography, WCC 2005 ; Conference date: 14-03-2005 Through 18-03-2005",
}