Dr. Fré Vercauteren

Post-doc

Address:

COSIC - Electrical Engineering
Katholieke Universiteit Leuven
Kasteelpark Arenberg 10
B-3001 Heverlee
Belgium

Office : Electrical Engineering, Room 1.60

Phone: +32-16-32-1073
Fax: +32-16-32-1969

E-mail: fvercaut@esat.kuleuven.ac.be

Research Interests:

Algorithmic number theory and computational algebraic geometry
Applications of the above in cryptography

Programme Committees:

Cirencester 2005, Tenth IMA International Conference on Cryptography and Coding, 19 - 21 December 2005 Royal Agricultural College, Cirencester, UK.
ICALP 2006, 33rd International Colloquium on Automata, Languages and Programming, July 9 - 16, 2006, S. Servolo, Venice - Italy.
Cirencester 2007, Eleventh IMA International Conference on Cryptography and Coding, 18 - 20 December 2007 Royal Agricultural College, Cirencester, UK.
Pairing 08, Second International Conference on Pairing-based Cryptography, 1-3 September 2008, Royal Holloway, University of London, UK.
Africacrypt 2009, June 21-25, 2009, Gammarth, Tunisia.
Pairing 09, Third International Conference on Pairing-based Cryptography, 12-14 August, 2009, Stanford University.
Cirencester 2009, Twelfth IMA International Conference on Cryptography and Coding, 14 - 17 December 2009 Royal Agricultural College, Cirencester, UK.
ANTS-IX , Ninth Algorithmic Number Theory Symposium, July 19 – 23, 2010, Nancy, France.
Eurocrypt 2010, May 30 - June 3, 2010, Nice, France.

Publications:

F. Vercauteren, B. Preneel, J. Vandewalle. A Memory Efficient Version of Satoh's Algorithm. In Birgit Pfitzmann (Ed.) Advances in Cryptology - EUROCRYPT 2001, Lecture Notes in Computer Science 2045 Springer 2001, p. 1-13.
S. Janssen, J. Thomas, W. Borremans, P. Gijsels, I. Verbauwhede, F. Vercauteren, B. Preneel, J. Vandewalle. Hardware/Software Co-design of an Elliptic Curve Public-key Cryptosystem. In Proceedings IEEE Workshop on Signal Processing Systems, SiPS-2001, Antwerp, Belgium, 2001, p. 209-216.
J. Denef, F. Vercauteren. An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2. In C. Fieker, D. R. Kohel (Eds.) Algorithmic number theory - ANTS V, Lecture Notes in Computer Science 2369, Springer 2002, p. 308-323.
F. Vercauteren. Computing zeta functions of hyperelliptic curves over finite fields of characteristic 2. In Moti Young (Ed.) Advances in cryptology - CRYPTO 2002, Lecture Notes in Computer Science 2442, Springer 2002, p. 369-384.
F. Vercauteren. Computing zeta functions of curves over finite fields. PhD thesis, Katholieke Universiteit Leuven, November 2003.
A. Muzereau, N.P. Smart, F. Vercauteren. The equivalence between the DHP and DLP for elliptic curves used in practical applications. LMS J. Comput. Math, 7 (2004), p. 50-72. , 2004.
J. Denef, F. Vercauteren. An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic 2. Journal of Cryptology, Vol. 19 (1), Springer 2006, p. 1-25.
R. Granger, A. Holt, D. Page, N.P. Smart, F. Vercauteren. Function Field Sieve in Characteristic Three. In D. Buell (Ed.) Algorithmic number theory - ANTS VI, Lecture Notes in Computer Science 3076, Springer 2004, p. 223-234.
J. Scholten, F. Vercauteren. An Introduction to Elliptic and Hyperelliptic Curve Cryptography and the NTRU Cryptosystem. To appear in B. Preneel (Ed.) State of the Art in Applied Cryptography -- COSIC '03, Lecture Notes in Computer Science, Springer 2004.
J. H. Silverman, N. P. Smart, F. Vercauteren. An Algebraic Approach to NTRU (q = 2^n) via Witt Vectors and Overdetermined Systems of Nonlinear Equations. In C. Blundo, S. Cimato (Eds.) Security in Communication Networks, SCN 2004, Lecture Notes in Computer Science 3352, Springer 2005, p. 278-293.
J. Denef, F. Vercauteren. Computing zeta functions of C_{ab} curves using Monsky-Washnitzer cohomology. Finite Fields and Their Applications, Vol. 12 (1), Elsevier 2006, p. 78-102.
R. Granger, F. Vercauteren. On the discrete logarithm problem on algebraic tori. In V. Shoup (Ed.), CRYPTO 2005, Lecture Notes in Computer Science 3621, Springer 2005, p. 66-85.
D. Page, F. Vercauteren. A Fault Attack on Pairing Based Cryptography. In IEEE Transactions on Computers, Vol. 55(9), p. 1075-1080, 2006.
D. Page, N. Smart, F. Vercauteren. A comparison of MNT curves and supersingular curves. In Applicable Algebra in Engineering, Communication and Computing, Vol. 17 (5), Springer 2006, p. 379-392.
N. Smart, F. Vercauteren. On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems. Discrete Applied Mathematics, Vol. 155, Iss. 4, 2007, p. 538-547.
A. Joux, R. Lercier, N. Smart, F. Vercauteren. The number field sieve in the medium prime case. In C. Dwork (Ed.), CRYPTO 2006, Lecture Notes in Computer Science, 4117, p. 326-344, Springer 2006.
F. Hess, N. Smart, F. Vercauteren. The Eta-pairing revisited. In IEEE Transactions on Information Theory, Vol. 52(10), p. 4595-4602, 2006.
W. Castryck, J. Denef, F. Vercauteren. Computing Zeta Functions of Nondegenerate Curves. International Mathematics Research Papers, vol. 2006, Article ID 72017, 57 pages, 2006.
R. Granger, F. Hess, R. Oyono, N. Thériault, F. Vercauteren Ate Pairing on Hyperelliptic Curves In M. Naor (Ed.) EUROCRYPT 2007, Lecture Notes in Computer Science 4515, Springer 2007, p. 430-447.
S. D. Galbraith, F. Hess, F. Vercauteren. Hyperelliptic Pairings In T. Takagi, T. Okamoto, E. Okamoto, T. Okamoto (Eds.) Pairing 2007, Lecture Notes in Computer Science 4575, Springer 2007, p. 108-131.
W. Castryck, H. Hubrechts, F. Vercauteren. Computing zeta functions in families of C_{ab} curves using deformation In A. van der Poorten, A. Stein (Ed.) Algorithmic number theory - ANTS VIII, Lecture Notes in Computer Science, Springer 2008, 16 pages.
S. D. Galbraith, F. Hess, F. Vercauteren. Aspects of Pairing Inversion IEEE Transactions on Information Theory 54(12): 5719-5728, 2008.
F. Vercauteren. The Hidden Root Problem In Steven D. Galbraith and Kenneth G. Paterson (Eds.), Pairing 2008, Lecture Notes in Computer Science 5209, Springer 2008, p. 89-99.
F. Vercauteren. Optimal Pairings To appear in IEEE Transactions on Information Theory, 2009.
J. Daemen, M. Lamberger, N. Pramstaller, V. Rijmen, F. Vercauteren. Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers Computing 85(1-2), p. 85-104, 2009.
J. Fan, F. Vercauteren, I. Verbauwhede. Faster -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves In C. Clavier, K. Gaj (Eds.), CHES 2009, Lecture Notes in Computer Science, 5747, Springer 2009, p. 240-253.
M. Knezevic, F. Vercauteren, I. Verbauwhede. Improved Barrett and Montgomery Modular Multiplications for w-bit architecture To appear in IEEE Transactions on Computers 2009.

Chapters in Books:

F. Vercauteren. Advances in Point Counting. In I. F. Blake, G. Seroussi, N. P. Smart (Eds.) Advances in Elliptic Curve Cryptography, 103-132, London Math. Soc. Lecture Note Ser., 317, Cambridge Univ. Press, Cambridge, 2005.
D. Lubicz, F. Vercauteren. Cohomological Background on Point Counting. In Handbook of elliptic and hyperelliptic curve cryptography, 133-141, Discrete Math. Appl. (Boca Raton), Chapman & Hall/CRC, 2006.
R. Lercier, D. Lubicz, F. Vercauteren. Point Counting on Elliptic and Hyperelliptic Curves. In Handbook of elliptic and hyperelliptic curve cryptography, 239-263, Discrete Math. Appl. (Boca Raton), Chapman & Hall/CRC, 2006.
F. Vercauteren. p-adic Arithmetic. In Handbook of elliptic and hyperelliptic curve cryptography, 407-453, Discrete Math. Appl. (Boca Raton), Chapman & Hall/CRC, 2006.
F. Vercauteren. Pairings on Elliptic Curves. In M. Joye and G. Neven (Eds.) Identity-Based Cryptography}. To appear in IOS Press Cryptology and Information Security Series, 2008.
C. Whelan, A. Byrne, D. Page, F. Vercauteren, M. Scott and W. Marnane. Implementation Attacks, Countermeasures and Performance Evaluation. In M. Joye and G. Neven (Eds.) Identity-Based Cryptography. To appear in IOS Press Cryptology and Information Security Series, 2008.

Preprints:

J. Hermans, M. Schneider, J. Buchmann, F. Vercauteren, B. Preneel. Shortest Lattice Vector Enumeration on Graphics Cards
J. Hermans, F. Vercauteren, B. Preneel. Speed records for NTRU
L. Batina, B. Gierlichs, N. Smart, M. Tunstall, F. Vercauteren. Revisiting Collision Based Power Analysis of Scalar Multiplication
W. Castryck, F. Vercauteren. Toric forms of elliptic curves and their arithmetic

Notes:

F. Vercauteren. The SEA algorithm in Characteristic 2. Note 18/01/2000.

Presentations:

Visual cryptography. pdf
An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2. ps
Recent developments in public key cryptography. ps
Computing zeta functions of hyperelliptic curves over finite fields of characteristic 2. ps
Extensions of Kedlaya's algorithm. ps
Counting points on hyperelliptic curves over finite fields of small characteristic. ps
Counting points on curves using Mosnky-Washnitzer cohomology. ps
Function field sieve in characteristic 3. ps
An introduction to p-adic point counting. pdf
The discrete logarithm problem on algebraic tori. ps
Zeta functions of non-degenerate curves. pdf
The discrete logarithm problem in finite fields. pdf
The discrete logarithm problem on elliptic curves. pdf
Introduction to public key cryptography. pdf
Elliptic and hyperelliptic curve cryptography. pdf
Mini course on point counting: intro pdf, p-adic arithmetic pdf, canonical lift methods pdf, Monsky-Washnitzer cohomology pdf
Witt vectors and NTRU pdf
The number field sieve in the medium prime case pdf
Mathematics of pairings: part I pdf, part II pdf
Ate pairing on hyperelliptic curves pdf
Pairing inversion pdf

Curriculum Vitae:
CV available on request.
Last modified on 10/09/2009.