Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Integer programming and cryptography

From MaRDI portal
Publication:799477
Jump to:navigation, search

DOI10.1007/BF03024123zbMath0548.90050MaRDI QIDQ799477

Hendrik 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) Integer programming (90C10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of error-correcting codes and error-detecting codes (94B99)


Related Items

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



Cites Work

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


This page was built for publication: Integer programming and cryptography

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:799477&oldid=12740647"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 12:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki