Cryptology ePrint Archive: Report 2005/023

A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness

Masao Kasahara

Abstract: 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: \begin​{description} \item [(i)] It realizes an abundant supply of PKCs, yielding more secure PKCs. \item [(i\hspace{-.1em}i)] It realizes a fast encryption and decryption process. \end{description}

Category / Keywords: public-key cryptography / algebraic coding, random coding, public-key cryptosystem

Publication Info: SCIS 2005 (The 2005 Symposium on Cryptography and Information Security)

Date: received 28 Jan 2005

Contact author: kasahara at utc osaka-gu ac jp

Available format(s): PDF | BibTeX Citation

Version: 20050201:104847 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]