Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Arjen K. Lenstra

Security And Privacy

Arjen Klaas Lenstra (born 2 March 1956, in Groningen) is a Dutch mathematician, cryptographer and computational number theorist. He is a professor emeritus from the Ecole Polytechnique Federale de Lausanne, where he headed the Laboratory for Cryptologic Algorithms.

Facts
Birth Year
1956 1
Connections

Credited

Source Lenstra-Lenstra-Lovász lattice basis reduction algorithm (Wikipedia)

Invented

Source Lenstra-Lenstra-Lovász lattice basis reduction algorithm (Wikipedia)
In the Other Atlases
Sources
1. Wikidata: Arjen K. Lenstra
  • Wikidata Q671213, resolved via en.wikipedia pageprops (wave rule R-L)
  • Wikidata Q671213 P569 (date of birth)
View the Source
Arjen Lenstra (Wikipedia)
In Group: Applied Cryptography, lead sentence: Arjen Klaas Lenstra (born 2 March 1956, in Groningen) is a Dutch mathematician, cryptographer and computational number theorist.View the Source
Lenstra-Lenstra-Lovász lattice basis reduction algorithm (Wikipedia)
  • Credited: Lenstra-Lenstra-Lovasz Algorithm, Lead sentence
    Lenstra-Lenstra-Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis \mathbf{B} = \{ \mathbf{b}_1,\mathbf{b}_2, \dots, \mathbf{
  • Invented: Lenstra-Lenstra-Lovasz Algorithm, Lead sentence
    Lenstra-Lenstra-Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis \mathbf{B} = \{ \mathbf{b}_1,\mathbf{b}_2, \dots, \mathbf{
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.