Reynald Lercier

	2011
20		Antoine Joux, Reynald Lercier: Number Field Sieve for the DLP. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 867-873
	2010
19		Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault: Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time. Pairing 2010: 278-297
18		Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault: Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time CoRR abs/1005.1454: (2010)
	2009
17		Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé: Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. IMA Int. Conf. 2009: 351-367
16		Clement Dunand, Reynald Lercier: Normal Elliptic Bases and Torus-Based Cryptography CoRR abs/0909.0236: (2009)
15		Jean Marc Couveignes, Reynald Lercier: Elliptic periods for finite fields. Finite Fields and Their Applications 15(1): 1-22 (2009)
	2008
14		Pierre-Alain Fouque, Reynald Lercier, Denis Réal, Frédéric Valette: Fault Attack onElliptic Curve Montgomery Ladder Implementation. FDTC 2008: 92-98
13		Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé: Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. IACR Cryptology ePrint Archive 2008: 217 (2008)
	2006
12		Antoine Joux, Reynald Lercier, Nigel P. Smart, Frederik Vercauteren: The Number Field Sieve in the Medium Prime Case. CRYPTO 2006: 326-344
11		Antoine Joux, Reynald Lercier: The Function Field Sieve in the Medium Prime Case. EUROCRYPT 2006: 254-270
10		Antoine Joux, Reynald Lercier: Counting points on elliptic curves in medium characteristic. IACR Cryptology ePrint Archive 2006: 176 (2006)
	2004
9		Éliane Jaulmes, Reynald Lercier: FRMAC, a Fast Randomized Message Authentication Code. IACR Cryptology ePrint Archive 2004: 166 (2004)
	2003
8		Reynald Lercier, David Lubicz: Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time. EUROCRYPT 2003: 360-373
7		Antoine Joux, Reynald Lercier: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method. Math. Comput. 72(242): 953-967 (2003)
	2002
6		Antoine Joux, Reynald Lercier: The Function Field Sieve Is Quite Special. ANTS 2002: 431-445
	2001
5		Antoine Joux, Reynald Lercier: "Chinese & Match", an alternative to Atkin's "Match and Sort" method used in the SEA algorithm. Math. Comput. 70(234): 827-836 (2001)
	2000
4		Reynald Lercier, François Morain: Computing isogenies between elliptic curves over Fpn using Couveignes's algorithm. Math. Comput. 69(229): 351-370 (2000)
	1997
3		Reynald Lercier: Finding Good Random Elliptic Curves for Cryptosystems Defined over F2n. EUROCRYPT 1997: 379-392
	1996
2		Reynald Lercier: Computing Isogenies in F2n. ANTS 1996: 197-212
	1995
1		Reynald Lercier, François Morain: Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance. EUROCRYPT 1995: 79-94

Coauthor Index

1	Jean Marc Couveignes	[15]
2	Clement Dunand	[16]
3	Pierre-Alain Fouque	[14]
4	Éliane Jaulmes	[9]
5	Antoine Joux	[5] [6] [7] [10] [11] [12] [13] [17] [20]
6	Jean-Gabriel Kammerer	[18] [19]
7	David Lubicz	[8]
8	François Morain	[1] [4]
9	David Naccache (Deh Cac Can)	[13] [17]
10	Denis Réal	[14]
11	Guénaël Renault	[18] [19]
12	Nigel P. Smart	[12]
13	Emmanuel Thomé	[13] [17]
14	Frédéric Valette	[14]
15	Frederik Vercauteren	[12]

Colors in the list of coauthors

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page