Abstract
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 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.
Original language | English |
---|---|
Pages (from-to) | 67-86 |
Number of pages | 20 |
Journal | International Journal of Pure and Applied Mathematics |
Volume | 69 |
Issue number | 1 |
Publication status | Published - 2011 |
Keywords
- Coding
- Cryptography
- Group ring
- Public key cryptography
- Units