International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

New Public Key Cryptosystems Using Polynomials over Non-commutative Rings

Authors:
Zhenfu Cao
Xiaolei Dong
Licheng Wang
Download:
URL: http://eprint.iacr.org/2007/009
Search ePrint
Search Google
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).
BibTeX
@misc{eprint-2007-13291,
  title={New Public Key Cryptosystems Using Polynomials over Non-commutative Rings},
  booktitle={IACR Eprint archive},
  keywords={foundations / public-key cryptography, non-commutative rings},
  url={http://eprint.iacr.org/2007/009},
  note={ zfcao@cs.sjtu.edu.cn 13532 received 9 Jan 2007, last revised 19 Jan 2007},
  author={Zhenfu Cao and Xiaolei Dong and Licheng Wang},
  year=2007
}