On the Wagner–Magyarik Cryptosystem
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.
Unable to display preview. Download preview PDF.
- 8.McNaughton, R.: Contributions of Ronald V. Book to the Theory of String Rewriting Systems. Rensselaer Polytechnic Institute T.R. n0 96 − 19 (1996)Google Scholar
- 10.Wagner, N.R., Magyarik, M.R.: A Public Key Cryptosystem Based on the Word Problem. In: Peterson, J.L. (ed.) Computer Programs for Spelling Correction. LNCS, vol. 96, pp. 19–36. Springer, Heidelberg (1980)Google Scholar