Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations

This publication has 11 references indexed in Scilit:

• Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
  Published by Springer Nature ,1995
• The knapsack problem in cryptography
  Contemporary Mathematics, 1994
• A Course in Computational Algebraic Number Theory
  Published by Springer Nature ,1993
• Improved low-density subset sum algorithms
  computational complexity, 1992
• The rise and fall of knapsack cryptosystems
  Published by American Mathematical Society (AMS) ,1991
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
  IEEE Transactions on Information Theory, 1988
• A hierarchy of polynomial time lattice basis reduction algorithms
  Theoretical Computer Science, 1987
• Factoring polynomials with rational coefficients
  Mathematische Annalen, 1982
• A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• Hiding information and signatures in trapdoor knapsacks
  IEEE Transactions on Information Theory, 1978