• What's new
• Archive
• Best Papers
• Videos
• Authors
• Coauthors
• By year
• By conference
• All Committees
• Most Committees
• Report errors
• Maps
• About

Arjen K. Lenstra  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2012	Public Keys	crypto	626-642
2	2010	Factorization of a 768-Bit RSA Modulus	crypto	333-350
3	2010	Factorization of a 768-bit RSA modulus	eprint	online
4	2010	Pushing the Limits of ECM	eprint	online
5	2009	Improving the Boneh-Franklin Traitor Tracing Scheme	pkc	88-104
6	2009	Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate	crypto	55-69
7	2007	Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities	eurocrypt	1-22
8	2007	A kilobit special number field sieve factorization	eprint	online
9	2007	A Kilobit Special Number Field Sieve Factorization	asiacrypt	1-12
10	2006	Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities	eprint	online
11	2006	VSH, an Efficient and Provable Collision-Resistant Hash Function	eurocrypt	online
12	2005	Colliding X.509 Certificates	eprint	online
13	2005	VSH, an Efficient and Provable Collision Resistant Hash Function	eprint	online
14	2005	Twin RSA	eprint	online
15	2004	Preface	jofc	233
16	2003	Factoring Estimates for a 1024-Bit RSA Modulus	asiacrypt	online
17	2002	Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions	ches	318-332
18	2002	Analysis of Bernstein's Factorization Circuit	asiacrypt	online
19	2002	Selective Forgery of RSA Signatures with Fixed-Pattern Padding	pkc	228-236
20	2001	Unbelievable Security. Matching AES Security Using Public Key Systems	asiacrypt	67-86
21	2001	On the Security of Lenstra's Variant of DSA without Long Inversions	pkc	64-72
22	2001	Fast Irreducibility and Subgroup Membership Testing in XTR	pkc	73-86
23	2001	Selecting Cryptographic Key Sizes	jofc	255-293
24	2001	Speeding Up XTR	asiacrypt	125-143
25	2000	The XTR Public Key System	crypto	1-19
26	2000	Key Improvements to XTR	asiacrypt	220-233
27	2000	Factorization of a 512-Bit RSA Modulus	eurocrypt	1-18
28	2000	Selecting Cryptographic Key Sizes	pkc	446-465
29	2000	Analysis and Optimization of the TWINKLE Factoring Device	eurocrypt	35-52
30	1999	Factorization of RSA-140 Using the Number Field Sieve	asiacrypt	195-207
31	1999	Chinese Remaindering Based Cryptosystems in the Presence of Faults	jofc	241-245
32	1998	Generating RSA Moduli with a Predetermined Portion	asiacrypt	1-10
33	1996	A World Wide Number Field Sieve Factoring Record: On to 512 Bits	asiacrypt	382-394
34	1996	Generating Standard DSA Signatures Without Long Inversion	asiacrypt	57-64
35	1995	Some Remarks on Lucas-Based Cryptosystems	crypto	386-396
36	1995	A Key Escrow System with Warrant Bounds	crypto	197-207
37	1995	NFS with Four Large Primes: An Explosive Experiment	crypto	372-385
38	1994	The Magic Words are Squeamish Ossifrage	asiacrypt	263-277
39	1993	User Impersonation in Key Certification Schemes	jofc	225-232
40	1993	On the Factorization of RSA-120	crypto	166-174
41	1993	Factoring Integers Using SIMD Sieves	eurocrypt	28-39
42	1992	The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel)	eurocrypt	194-199
43	1992	Massively Parallel Elliptic Curve Factorin	eurocrypt	183-193
44	1990	Factoring With Two Large Primes	eurocrypt	72-82
45	1989	Factoring by Electronic Mail	eurocrypt	355-371