A note on performance of low-density attack for several knapsack PKCs
Yoshifumi Katakura, Takeshi Nasako, Yasuyuki Murakami, Masao Kasahara
Abstract
Yoshifumi Katakura, Takeshi Nasako, Yasuyuki Murakami, Masao Kasahara
Abstract
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 on several trap-doors in knapsack cryptosystems.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 on several trap-doors in knapsack cryptosystems.
Key concepts: Knapsack problem, Cryptosystem, Key (lock), Public key cryptosystem, Public-key cryptography, Computer science, Random permutation, Scrambling