A new construction of knapsack PKC by using a random sequence

Authors:
Yasuyuki Murakami
Affiliations:
Osaka Electro-Communication University, Neyagawa-shi, Osaka
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 3
Cited 0

Solving low-density subset sum problems

Journal of the ACM (JACM)
Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

The knapsack scheme is expected to be not only a light-weight public-key cryptosystem but also a post quantum cryptosystem. In this paper, we propose a new method for constructing knapsack PKC by using a random sequence. We also give two concrete knapsack schemes based on the proposed method. The scheme constructed the proposed method can be secure against the low-density attack because the density can be made as large as one desires. The scheme constructed the proposed method can be also secure against the attack of computing the secret key, because the public key is almost indistinguishable from a random numbers.