Copyright © 2006 The Institute of Electronics, Information and Communication Engineers
Special Section on Cryptography and Information Security -- Papers -- Public Key Cryptography |
A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness
1 The author is with the Faculty of Informatics, Osaka Gakuin University, Suita-shi, 564-8511 Japan. E-mail: kasahara{at}utc.osaka-gu.ac.jp
In this paper, we present a new class of public-key cryptosystem (PKC) using algebraic coding on the basis of superimposition and randomness. The proposed PKC is featured by a generator matrix, in a characteristic form, where the generator matrix of an algebraic code is repeatedly used along with the generator matrix of a random code, as sub-matrices. This generator matrix, in the characteristic form, will be referred to as K-matrix. We show that the K-matrix yields the following advantages compared with the conventional schemes: (i) It realizes an abundant supply of PKCs, yielding more secure PKCs, (ii) It realizes a short public key.
Key Words: algebraic coding, random coding, public-key cryptosystem
Manuscript received March 22, 2005. Manuscript revised July 31, 2005. Final manuscript received September 2, 2005.