Integer programming and cryptography

DOI10.1007/BF03024123zbMATH Open0548.90050MaRDI QIDQ799477FDOQ799477

H. W. jun. Lenstra

Publication date: 1984

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

zbMATH Keywords

cryptographypolynomial-time algorithminteger coordinatesinteger linear programming problemtriangle in the plane

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Integer programming (90C10) Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• Title not available (Why is that?)
• Factoring polynomials with rational coefficients
• Integer Programming with a Fixed Number of Variables
• Hiding information and signatures in trapdoor knapsacks
• A new linear programming algorithm - better or worse than the simplex method?
• Cryptology: The mathematics of secure communication

Cited In (2)

• On the reduction of a random basis
• Lower time bounds for integer programming with two variables

   Recommendations

• Title not available (Why is that?) 👍 👎
• A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem 👍 👎
• Solving Low Density Knapsacks 👍 👎
• A critical analysis of the security of knapsack public-key algorithms 👍 👎
• Solving low-density subset sum problems 👍 👎

This page was built for publication: Integer programming and cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799477)