The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arjen K. Lenstra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Arjen K. Lenstra
    Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ACISP, 1997, pp:127-138 [Conf]
  2. Arjen K. Lenstra
    Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems. [Citation Graph (0, 0)][DBLP]
    ACISP, 1999, pp:294-302 [Conf]
  3. Arjen K. Lenstra, Tim Voss
    Information Security Risk Assessment, Aggregation, and Mitigation. [Citation Graph (0, 0)][DBLP]
    ACISP, 2004, pp:391-401 [Conf]
  4. Arjen K. Lenstra, Benne de Weger
    On the Possibility of Constructing Meaningful Hash Collisions for Public Keys. [Citation Graph (0, 0)][DBLP]
    ACISP, 2005, pp:267-279 [Conf]
  5. Roger A. Golliver, Arjen K. Lenstra, Kevin S. McCurley
    Lattice sieving and trial division. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:18-27 [Conf]
  6. Paul C. Leyland, Arjen K. Lenstra, Bruce Dodson, Alec Muffett, Samuel S. Wagstaff
    MPQS with Three Large Primes. [Citation Graph (0, 0)][DBLP]
    ANTS, 2002, pp:446-460 [Conf]
  7. James Cowie, Bruce Dodson, R. Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, Jörg Zayer
    A World Wide Number Field Sieve Factoring Record: On to 512 Bits. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1996, pp:382-394 [Conf]
  8. Derek Atkins, Michael Graff, Arjen K. Lenstra, Paul C. Leyland
    The Magic Words are Squeamish Ossifrage. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1994, pp:263-277 [Conf]
  9. Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman te Riele, Paul Zimmermann
    Factorization of RSA-140 Using the Number Field Sieve. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1999, pp:195-207 [Conf]
  10. Arjen K. Lenstra
    Unbelievable Security. Matching AES Security Using Public Key Systems. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:67-86 [Conf]
  11. Arjen K. Lenstra
    Generating Standard DSA Signatures Without Long Inversion. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1996, pp:57-64 [Conf]
  12. Arjen K. Lenstra
    Generating RSA Moduli with a Predetermined Portion. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1998, pp:1-10 [Conf]
  13. Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer
    Analysis of Bernstein's Factorization Circuit. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2002, pp:1-26 [Conf]
  14. Arjen K. Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James Hughes, Paul C. Leyland
    Factoring Estimates for a 1024-Bit RSA Modulus. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2003, pp:55-74 [Conf]
  15. Arjen K. Lenstra, Eric R. Verheul
    Key Improvements to XTR. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2000, pp:220-233 [Conf]
  16. Martijn Stam, Arjen K. Lenstra
    Speeding Up XTR. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:125-143 [Conf]
  17. Martijn Stam, Arjen K. Lenstra
    Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions. [Citation Graph (0, 0)][DBLP]
    CHES, 2002, pp:318-332 [Conf]
  18. Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra
    Some Remarks on Lucas-Based Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1995, pp:386-396 [Conf]
  19. Thomas F. Denny, Bruce Dodson, Arjen K. Lenstra, Mark S. Manasse
    On the Factorization of RSA-120. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:166-174 [Conf]
  20. Bruce Dodson, Arjen K. Lenstra
    NFS with Four Large Primes: An Explosive Experiment. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1995, pp:372-385 [Conf]
  21. Arjen K. Lenstra, Eric R. Verheul
    The XTR Public Key System. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:1-19 [Conf]
  22. Arjen K. Lenstra, Peter Winkler, Yacov Yacobi
    A Key Escrow System with Warrant Bounds. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1995, pp:197-207 [Conf]
  23. Marc-Paul van der Hulst, Arjen K. Lenstra
    Factorization of Polynominals by Transcendental Evaluation. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:138-145 [Conf]
  24. Arjen K. Lenstra
    Lattices and Factorization of Polynomials over Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    EUROCAM, 1982, pp:32-39 [Conf]
  25. Arjen K. Lenstra
    Factoring polynominals over algebraic number fields. [Citation Graph (0, 0)][DBLP]
    EUROCAL, 1983, pp:245-254 [Conf]
  26. Scott Contini, Arjen K. Lenstra, Ron Steinfeld
    VSH, an Efficient and Provable Collision-Resistant Hash Function. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:165-182 [Conf]
  27. Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman te Riele, Karen Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann
    Factorization of a 512-Bit RSA Modulus. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:1-18 [Conf]
  28. Yvo Desmedt, Peter Landrock, Arjen K. Lenstra, Kevin S. McCurley, Andrew M. Odlyzko, Rainer A. Rueppel, Miles E. Smid
    The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:194-199 [Conf]
  29. Brandon Dixon, Arjen K. Lenstra
    Massively Parallel Elliptic Curve Factorin. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:183-193 [Conf]
  30. Brandon Dixon, Arjen K. Lenstra
    Factoring Integers Using SIMD Sieves. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1993, pp:28-39 [Conf]
  31. Arjen K. Lenstra, Mark S. Manasse
    Factoring by Electronic Mail. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:355-371 [Conf]
  32. Arjen K. Lenstra, Mark S. Manasse
    Factoring With Two Large Primes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:72-82 [Conf]
  33. Arjen K. Lenstra, Adi Shamir
    Analysis and Optimization of the TWINKLE Factoring Device. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:35-52 [Conf]
  34. Arjen K. Lenstra
    Polynomial Factorization by Root Approximation. [Citation Graph (0, 0)][DBLP]
    EUROSAM, 1984, pp:272-276 [Conf]
  35. Arjen K. Lenstra
    Factoring Multivariate Integral Polynomials. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:458-465 [Conf]
  36. Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
    Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:1-16 [Conf]
  37. Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
    Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:229-242 [Conf]
  38. Karen Aardal, Arjen K. Lenstra
    Hard Equality Constrained Integer Knapsacks. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:350-366 [Conf]
  39. Arjen K. Lenstra
    Massively Parallel Computing and Factoring. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:344-355 [Conf]
  40. Arjen K. Lenstra
    Factoring Multivariate Polynomials over Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:389-396 [Conf]
  41. Arjen K. Lenstra, Benjamin M. M. de Weger
    Twin RSA. [Citation Graph (0, 0)][DBLP]
    Mycrypt, 2005, pp:222-228 [Conf]
  42. Arjen K. Lenstra, Igor Shparlinski
    On the Security of Lenstra's Variant of DSA without Long Inversions. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2001, pp:64-72 [Conf]
  43. Arjen K. Lenstra, Igor Shparlinski
    Selective Forgery of RSA Signatures with Fixed-Pattern Padding. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2002, pp:228-236 [Conf]
  44. Arjen K. Lenstra, Eric R. Verheul
    Selecting Cryptographic Key Sizes. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2000, pp:446-465 [Conf]
  45. Arjen K. Lenstra, Eric R. Verheul
    Fast Irreducibility and Subgroup Membership Testing in XTR. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2001, pp:73-86 [Conf]
  46. Ravindran Kannan, Arjen K. Lenstra, László Lovász
    Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:191-200 [Conf]
  47. Arjen K. Lenstra
    Factoring Multivariate Polynomials over Finite Fields (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:189-192 [Conf]
  48. Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard
    The Number Field Sieve [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:564-572 [Conf]
  49. Arjen K. Lenstra
    Factoring. [Citation Graph (0, 0)][DBLP]
    WDAG, 1994, pp:28-38 [Conf]
  50. Arjen K. Lenstra, Daniel Page, Martijn Stam
    Discrete Logarithm Variants of VSH. [Citation Graph (0, 0)][DBLP]
    VIETCRYPT, 2006, pp:229-242 [Conf]
  51. Arjen K. Lenstra
    Integer Factoring. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2000, v:19, n:2/3, pp:101-128 [Journal]
  52. Arjen K. Lenstra, Eric R. Verheul
    Selecting Cryptographic Key Sizes. [Citation Graph (0, 0)][DBLP]
    Datenschutz und Datensicherheit, 2000, v:24, n:3, pp:- [Journal]
  53. Arjen K. Lenstra
    Polynomial - time algorithms for the factorization of polynomials. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:23, n:, pp:59-75 [Journal]
  54. Arjen K. Lenstra
    Securing the Net - The Fruits of Incompetence. [Citation Graph (0, 0)][DBLP]
    First Monday, 1996, v:1, n:4, pp:- [Journal]
  55. Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
    Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:3, pp:192-202 [Journal]
  56. Arjen K. Lenstra
    Factoring Multivariate Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:2, pp:235-248 [Journal]
  57. Marc Joye, Arjen K. Lenstra, Jean-Jacques Quisquater
    Chinese Remaindering Based Cryptosystems in the Presence of Faults. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1999, v:12, n:4, pp:241-245 [Journal]
  58. Arjen K. Lenstra
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2004, v:17, n:4, pp:233- [Journal]
  59. Arjen K. Lenstra, Eric R. Verheul
    Selecting Cryptographic Key Sizes. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2001, v:14, n:4, pp:255-293 [Journal]
  60. Arjen K. Lenstra, Yacov Yacobi
    User Impersonation in Key Certification Schemes. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:4, pp:225-232 [Journal]
  61. Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
    Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2000, v:25, n:3, pp:427-442 [Journal]
  62. Karen Aardal, Arjen K. Lenstra
    Hard Equality Constrained Integer Knapsacks. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:3, pp:724-738 [Journal]
  63. Arjen K. Lenstra
    Factoring Multivariate Polynomials over Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:3, pp:591-598 [Journal]
  64. Arjen K. Lenstra
    Factoring Multivariate Integral Polynomials. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:34, n:, pp:207-213 [Journal]
  65. Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik
    A Kilobit Special Number Field Sieve Factorization. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2007, pp:1-12 [Conf]
  66. Marc Stevens, Arjen K. Lenstra, Benne de Weger
    Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:1-22 [Conf]

  67. On the Use of the Negation Map in the Pollard Rho Method. [Citation Graph (, )][DBLP]


  68. Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. [Citation Graph (, )][DBLP]


  69. Factorization of a 768-Bit RSA Modulus. [Citation Graph (, )][DBLP]


  70. Security Observance throughout the Life-Cycle of Embedded Systems. [Citation Graph (, )][DBLP]


  71. Improving the Boneh-Franklin Traitor Tracing Scheme. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002