Paper 2007/009 Original: eprint.iacr.org/2007/009 ↗

New Public Key Cryptosystems Using Polynomials over Non-commutative Rings

Zhenfu Cao
Xiaolei Dong
Licheng Wang
Abstract

In this paper, we propose a new method for designing public key cryptosystems based on general non-commutative rings. The key idea of our proposal is that for a given non-commutative ring, we can define polynomials and take them as the underlying work structure. By doing so, it is easy to implement Diffie-Helman-like key exchange protocol. And consequently, ElGamal-like cryptosystems can be derived immediately. Moreover, we show how to extend our method to non-commutative groups (or semi-groups).

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
History
2007-01-19: last updated
2007-01-19: published
Short URL
https://ia.cr/2007/009
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2007/009,
      author = {Zhenfu Cao and Xiaolei Dong and Licheng Wang},
      title = {New Public Key Cryptosystems Using Polynomials over Non-commutative Rings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/009},
      year = {2007},
      url = {https://eprint.iacr.org/2007/009}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.