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

Masao KASAHARA

doi:10.1093/ietfec/e89-a.1.47

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

Masao KASAHARA

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.1 pp.47-54

Publication Date: 2006/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.1.47

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Public Key Cryptography

Cite this

Copy

Masao KASAHARA, "A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 1, pp. 47-54, January 2006, doi: 10.1093/ietfec/e89-a.1.47.
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: (i) It realizes an abundant supply of PKCs, yielding more secure PKCs, (ii) It realizes a short public key.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.1.47/_p

Copy

@ARTICLE{e89-a_1_47,
author={Masao KASAHARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness},
year={2006},
volume={E89-A},
number={1},
pages={47-54},
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: (i) It realizes an abundant supply of PKCs, yielding more secure PKCs, (ii) It realizes a short public key.},
keywords={},
doi={10.1093/ietfec/e89-a.1.47},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 47
EP - 54
AU - Masao KASAHARA
PY - 2006
DO - 10.1093/ietfec/e89-a.1.47
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2006
AB - 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.
ER -