The undecidable word problem for groups and semigroups is investigated as a basis for a public-key cryptosystem. A specific approach is discussed along with the results of an experimental implementation. This approach does not give a provably secure or practical system, but shows the type of cryptosystem that could be constructed around the word problem. This cryptosystem is randomized, with infinitely many ciphertexts corresponding to each plaintext.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- A Public-Key Cryptosystem Based on the Word Problem
Neal R. Wagner
Marianne R. Magyarik
- Springer Berlin Heidelberg