Handbook of Applied Cryptography
Handbook of Applied Cryptography
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Lattice Reduction in Cryptology: An Update
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Cryptanalytic Attacks on RSA
Cryptanalysis of RSA and Its Variants
Cryptanalysis of RSA and Its Variants
Algorithmic Cryptanalysis
Quadratic compact knapsack public-key cryptosystem
Computers & Mathematics with Applications
Hiding information and signatures in trapdoor knapsacks
IEEE Transactions on Information Theory
Cryptanalysis of a quadratic compact knapsack public-key cryptosystem
Computers & Mathematics with Applications
| Hi-index | 0.09 |
Wang and Hu [B. Wang and Y. Hu, Quadratic compact knapsack public-key cryptosystem, Comput. Math. Appl. 59 (1) (2010) 194-206] proposed a knapsack-type public-key cryptosystem by introducing an easy quadratic compact knapsack problem and then using the Chinese remainder theorem to disguise the easy knapsack instant. In this paper, we present a heuristic stereotyped message attack that allows the cryptanalyst to recover the plaintext message when partial information about the original message is known. In particular, as shown by our experiments, for the proposed system parameter n=100 which corresponds to a block length of 400 bits, exposing 60% of the plaintext allows the cryptanalyst to recover the remaining 160 bits of the message with a success probability of about 90% in about 2 hours.