Knapsack Public Key Cryptosystems and Diophantine Approximation

DOI10.1007/978-1-4684-4730-9_1zbMath1486.94123OpenAlexW1504382989MaRDI QIDQ5019314

Jeffrey C. Lagarias

Publication date: 8 January 2022

Published in: Advances in Cryptology (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.3273

zbMATH Keywords

cryptanalytic attackssimultaneous Diophantine approximationsknapsack public key cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60) Simultaneous homogeneous approximation, linear forms (11J13)

Related Items

Simultaneous diophantine approximation of rationals by rationals ⋮ Towards faster polynomial-time lattice reduction ⋮ A knapsack-based probabilistic encryption scheme ⋮ Interactions of computational complexity theory and mathematics ⋮ Preimage selective trapdoor function: how to repair an easy problem ⋮ Quadratic compact knapsack public-key cryptosystem ⋮ Selected Applications of LLL in Number Theory

Cites Work

• Simultaneous diophantine approximation of rationals by rationals
• Factoring polynomials with rational coefficients
• Integer Programming with a Fixed Number of Variables
• On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem
• Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
• A critical analysis of the security of knapsack public-key algorithms
• Hiding information and signatures in trapdoor knapsacks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Knapsack Public Key Cryptosystems and Diophantine Approximation