Knapsack Public Key Cryptosystems and Diophantine Approximation
- 1 January 1984
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Solving low density subset sum problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- On breaking generalized knapsack public key cryptosystemsPublished by Association for Computing Machinery (ACM) ,1983
- A Preliminary Report on the Cryptanalysis of Merkle-Hellman Knapsack CryptosystemsPublished by Springer Nature ,1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978