DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Arjen Lenstra
Arjen Lenstra
Selecting Cryptographic Key Sizes
Congress on Privacy & Surveillance
Four Integer Factorization Algorithms NA Carella, September, 2010 Abstract
Integer Factoring
Factorization of a 512–Bit RSA Modulus?
Selecting Cryptographic Key Sizes
Selecting Cryptographic Key Sizes Extended Abstract
Factorization of a 512–Bit RSA Modulus *
09 Special-Purpose Hardware for Attacking Cryptographic Systems 9
Design and Analysis of Hash Functions
RSA, Integer Factorization, Record Computations
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
The LLL Algorithm
Short Chosen-Prefix Collisions for MD5 and The
Cryptographic Competitions.Pdf
On the Amount of Sieving in Factorization Methods Proefschrift
MD5 Considered Harmful Today
Top View
The Security Impact of a New Cryptographic Library
Chosen-Prefix Collisions for MD5 and Applications Marc Stevens Arjen
Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm
Chosen-Prefix Collisions for MD5 and Colliding X
On the Amount of Sieving in Factorization Methods
Proceedings of the ECRYPT Workshop on Tools for Cryptanalysis 2010
Factorization of a 768-Bit RSA Modulus
UNIVERSITY of CALIFORNIA Los Angeles an FFT Extension of The
A Tale of Two Sieves Carl Pomerance
The LLL Algorithm Survey and Applications
MD5 Considered Harmful Today MD5 Considered Harmful Today
Factorization of RSA-140 Using the Number Field Sieve *
Centrum Wiskunde & Informatica Annual Report
Algorithms, Key Sizes and Parameters Report 2013 Recommendations Version 1.0 – October 2013
Bit RSA Modulus
The Security Impact of a New Cryptographic Library