Arjen K. Lenstra

From MaRDI portal
Person:218818

Available identifiers

zbMath Open lenstra.arjen-kDBLP58/1591WikidataQ671213 ScholiaQ671213MaRDI QIDQ218818

List of research outcomes





PublicationDate of PublicationType
Introduction2023-04-21Paper
General Purpose Integer Factoring2023-04-21Paper
Computation of a 30750-bit binary field discrete logarithm2021-09-02Paper
Parametrizations for Families of ECM-Friendly Curves2020-09-09Paper
Trustworthy public randomness with sloth, unicorn, and trx2018-11-26Paper
Efficient ephemeral elliptic curve cryptographic keys2018-10-18Paper
STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement2018-09-14Paper
Computation of a 768-Bit Prime Field Discrete Logarithm2017-06-13Paper
Mersenne Factorization Factory2015-01-16Paper
Discrete Logarithm Variants of VSH2014-08-21Paper
Using the Cloud to Determine Key Strengths2014-08-20Paper
Universal Security2013-12-10Paper
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction2012-11-16Paper
Chosen-prefix collisions for MD5 and applications2012-11-16Paper
Public Keys2012-09-25Paper
On the Use of the Negation Map in the Pollard Rho Method2010-09-29Paper
Factorization of a 768-Bit RSA Modulus2010-08-24Paper
The History of the LLL-Algorithm2010-03-05Paper
Advances in Cryptology - ASIACRYPT 20032010-01-05Paper
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate2009-10-20Paper
Improving the Boneh-Franklin Traitor Tracing Scheme2009-03-24Paper
A Kilobit Special Number Field Sieve Factorization2008-05-15Paper
Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities2007-11-29Paper
VSH, an Efficient and Provable Collision-Resistant Hash Function2007-09-24Paper
Progress in Cryptology – Mycrypt 20052006-10-05Paper
Information Security and Privacy2006-06-22Paper
https://portal.mardi4nfdi.de/entity/Q33748972006-03-01Paper
Hard Equality Constrained Integer Knapsacks2005-11-11Paper
Information Security and Privacy2005-09-07Paper
https://portal.mardi4nfdi.de/entity/Q47375382004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47375062004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q30439412004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44741692004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741662004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45362822004-01-26Paper
https://portal.mardi4nfdi.de/entity/Q44324572003-12-18Paper
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances2003-10-28Paper
https://portal.mardi4nfdi.de/entity/Q44257162003-09-11Paper
Analysis of Bernstein’s Factorization Circuit2003-07-16Paper
https://portal.mardi4nfdi.de/entity/Q45362832002-10-08Paper
https://portal.mardi4nfdi.de/entity/Q45367912002-10-07Paper
https://portal.mardi4nfdi.de/entity/Q27245822002-09-19Paper
https://portal.mardi4nfdi.de/entity/Q27245832002-09-01Paper
An overview of the XTR public key system2002-06-13Paper
Factoring multivariate integral polynomials2002-05-13Paper
Selecting cryptographic key sizes2002-01-02Paper
Solving a system of linear Diophantine equations with lower and upper bounds on the variables.2001-11-26Paper
https://portal.mardi4nfdi.de/entity/Q49500642001-11-22Paper
Integer factoring2001-07-19Paper
https://portal.mardi4nfdi.de/entity/Q27074172001-07-03Paper
https://portal.mardi4nfdi.de/entity/Q45014922000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49347432000-02-01Paper
Chinese remaindering based cryptosystems in the presence of faults2000-01-05Paper
https://portal.mardi4nfdi.de/entity/Q42636981999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42492501999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42506481999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q38403621998-08-10Paper
https://portal.mardi4nfdi.de/entity/Q43855161998-05-04Paper
https://portal.mardi4nfdi.de/entity/Q43434351997-08-24Paper
https://portal.mardi4nfdi.de/entity/Q43434491997-08-14Paper
https://portal.mardi4nfdi.de/entity/Q43434111997-08-14Paper
https://portal.mardi4nfdi.de/entity/Q43417961997-06-18Paper
https://portal.mardi4nfdi.de/entity/Q43417441997-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48479091996-06-03Paper
https://portal.mardi4nfdi.de/entity/Q48436291996-02-01Paper
Addendum: The Factorization of the Ninth Fermat Number1995-08-22Paper
https://portal.mardi4nfdi.de/entity/Q42796761995-05-02Paper
Multi-exponentiation (cryptographic protocols)1995-02-23Paper
Factoring with Two Large Primes1994-12-20Paper
The Factorization of the Ninth Fermat Number1994-07-31Paper
User impersonation in key certification schemes1994-01-19Paper
https://portal.mardi4nfdi.de/entity/Q42736831994-01-13Paper
https://portal.mardi4nfdi.de/entity/Q42736791994-01-13Paper
https://portal.mardi4nfdi.de/entity/Q40368601993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q39740911992-06-26Paper
Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38222271988-01-01Paper
Factoring Multivariate Polynomials over Algebraic Number Fields1987-01-01Paper
Implementation of a new primality test1987-01-01Paper
Factoring multivariate polynomials over finite fields1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36983131985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33442941984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36842001984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33268371983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30413031983-01-01Paper
Factoring polynomials with rational coefficients1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39337391982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33277151982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47482211982-01-01Paper
Two Lines Least Squares1982-01-01Paper
Lattices and factorization of polynomials1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38978721981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39150781980-01-01Paper

Research outcomes over time

This page was built for person: Arjen K. Lenstra