Cryptanalysis of a knapsack-based probabilistic encryption scheme
暂无分享,去创建一个
[1] Arjen K. Lenstra,et al. Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables , 2000, Math. Oper. Res..
[2] Claus-Peter Schnorr,et al. An Improved Low-Denisty Subset Sum Algorithm , 1991, EUROCRYPT.
[3] Yupu Hu,et al. A knapsack-based probabilistic encryption scheme , 2007, Inf. Sci..
[4] Martin E. Hellman,et al. Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.
[5] G. Nemhauser,et al. Integer Programming , 2020 .
[6] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[7] Jacques Stern,et al. Lattice Reduction in Cryptology: An Update , 2000, ANTS.
[8] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[9] Noboru Kunihiro. New Definition of Density on Knapsack Cryptosystems , 2008, AFRICACRYPT.
[10] Jacques Stern,et al. Adapting Density Attacks to Low-Weight Knapsacks , 2005, ASIACRYPT.
[11] G. Hardy,et al. An Introduction to the Theory of Numbers , 1938 .
[12] Andrew Odlyzko,et al. The Rise and Fall of Knapsack Cryptosystems , 1998 .