Group ring cryptography

Cryptographic systems are derived using units in group rings. Combinations of types of units in group rings give units not of any particular type. This includes cases of taking powers of units and products of such powers and adds the complexity of the {\em discrete logarithm} problem to the system. The method enables encryption and (error-correcting) coding to be combined within one system. These group ring cryptographic systems may be combined in a neat way with existing cryptographic systems, such as RSA, and a combination has the combined strength of both systems. Examples are given.

[1]  N. Koblitz.  A Course in Number Theory and Cryptography , 1987 .

[2]  Vladimir Shpilrain,et al.  Combinatorial Group Theory and Public Key Cryptography , 2004, Applicable Algebra in Engineering, Communication and Computing.

[3]  D. Goldfeld,et al.  An algebraic method for public-key cryptography , 1999 .

[4]  C. Milies,et al.  An introduction to group rings , 2002 .

[5]  K. Appel,et al.  Artin groups and infinite Coxeter groups , 1983 .

[6]  Patrick Dehornoy.  Braid-based cryptography , 2004 .

[7]  N. Koblitz.  Introduction to Elliptic Curves and Modular Forms , 1984 .

[8]  M.I. Aziz,et al.  Introduction to Cryptography , 2002, 2005 International Conference on Microelectronics.