You are looking at a specific version 20050201:104847 of this paper. See the latest version.

Paper 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}

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. SCIS 2005 (The 2005 Symposium on Cryptography and Information Security)
Keywords
algebraic codingrandom codingpublic-key cryptosystem
Contact author(s)
kasahara @ utc osaka-gu ac jp
History
2005-02-01: received
Short URL
https://ia.cr/2005/023
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.