A Public Key Cryptosystem Based on the Word Problem

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.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  Neal R. Wagner,et al.  Searching for Public-Key Cryptosystems , 1984, 1984 IEEE Symposium on Security and Privacy.

[3]  R. H. Crowell,et al.  Introduction to Knot Theory , 1977 .

[4]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[5]  Gilles Brassard,et al.  An optimally secure relativized cryptosystem , 1983, SIGA.

[6]  R. Rivest.  Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam , 1979 .

[7]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[8]  Hugh C. Williams,et al.  A modification of the RSA public-key encryption procedure (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[9]  Adi Shamir,et al.  An efficient signature scheme based on quadratic equations , 1984, STOC '84.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Manuel Blum,et al.  How to exchange (secret) keys , 1983, TOCS.

[12]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[13]  William W. Boone.  The Word Problem , 1959 .

[14]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[15]  Adi Shamir,et al.  A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[16]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[17]  Leonard M. Adleman,et al.  On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem , 1982, CRYPTO.

[18]  Tore Herlestam.  Critical remarks on some public-key cryptosystems , 1978 .

[19]  Adi Shamir,et al.  On the generation of cryptographically strong pseudorandom sequences , 1981, TOCS.

[20]  Michael O. Rabin,et al.  Recursive Unsolvability of Group Theoretic Problems , 1958 .

[21]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[22]  Gilles Brassard,et al.  A note on the complexity of cryptography (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[23]  Ronald L. Rivest,et al.  Randomized Encryption Techniques , 1982, CRYPTO.