The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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...
The study of the knapsack PKC is important from both practical and theoretical standpoints. We proposed a double-sequence knapsack PKC on the basis of MH PKC. We also proposed a single-sequence knapsack PKC using the Chinese remainder theorem on the basis of this scheme. In this paper, we explain the double-sequence knapsack PKC and the single-sequence knapsack PKC. We describe examples of trapdoors...
Merkle and Hellman proposed the first knapsack cryptosystem. However, it was broken because the density is not sufficiently high. The knapsack scheme is expected to be one of the post quantum cryptosystems. In this paper, we describe the high-density knapsack PKCs with plaintext encoding over GF(2). We discuss the influence of the number of non-zero elements of the generator matrix on the security...
The order of the public-key components of knapsack cryptosystems are usually scrambled by a random permutation. It is well known that the effect of the scrambling is to keep the secret key secure. However, little is known about the influence that the scrambling affects the security against LDA in the knapsack cryptosystem. In this paper, we report the performances of LDA for the chosen permutations...
This paper proposes new product-sum type public-key cryptosystems using the Chinese remainder theorem as the trapdoor. The security of the proposed schemes is based on the difficulty of finding a specific solution of the linear Diophantine equation. The proposed schemes are invulnerable to the low-density attack because they can realize the sufficiently high density for a practical parameter.
Knapsack public-key cryptosystem is known to be vulnerable to the low-density attack (LDA) when the density is low. Nasako and Murakami proposed the method of realizing high density by plaintext encoding over finite fields. However, little is known about the effectiveness of plaintext encoding against LDA in the knapsack cryptosystem. In this paper, we confirm that the plaintext encoding is very effective...
FPGAs are widely used recently, and security on configuration bitstreams is of concern to both users and suppliers of configuration bitstreams (e.g., intellectual property vendors). In order to protect configuration bitstreams against the threats such as FPGA viruses, piracy and reverse engineering, configuration bitstreams need to be encrypted and authenticated before loaded into FPGAs. We previously...
Merkle and Hellman proposed a knapsack cryptosystem. However, it was broken because the density is not sufficiently high. In this paper, we shall explain the high-density knapsack PKCs with plaintext encoding over GF(2). We discuss the influence of the number of non-zero elements of generator matrix on the security against the low-density attack. As the result, this scheme is secure against the low-density...
In this paper we propose a new trapdoor in knapsack public-key cryptosystem, where two independent sequences is used as the public key. We show that the proposed scheme is secure against the low-density attack, because the density can be made as large as one desires. We also discuss the security of the secret key of the proposed scheme.
In this paper we describe the KMN PKC and the special class of it. KMN PKC has the feature that, two sequences are used as the public keys. We discuss on the security of KMN PKC against the low-density attack with computer experiments.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.