CryptoDB
A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness
| Authors: | |
|---|---|
| Download: | |
| 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} |
BibTeX
@misc{eprint-2005-12362,
title={A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / algebraic coding, random coding, public-key cryptosystem},
url={http://eprint.iacr.org/2005/023},
note={SCIS 2005 (The 2005 Symposium on Cryptography and Information Security) kasahara@utc.osaka-gu.ac.jp 12812 received 28 Jan 2005},
author={Masao Kasahara},
year=2005
}