Cryptology ePrint Archive: Report 2007/009

New Public Key Cryptosystems Using Polynomials over Non-commutative Rings

Zhenfu Cao, Xiaolei Dong and 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).

Category / Keywords: foundations / public-key cryptography, non-commutative rings

Date: received 9 Jan 2007, last revised 19 Jan 2007

Contact author: zfcao at cs sjtu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20070119:094247 (All versions of this report)

Short URL: ia.cr/2007/009

Discussion forum: Show discussion | Start new discussion