Michael Naehrig
Eindhoven University of Technology
Department of Mathematics and Computer Science
Coding Theory and Cryptology
Den Dolech 2
5600 MB Eindhoven
The Netherlands
Room: HG 10.72
Phone: +31 40 2474157
E-Mail: michael@cryptojedi.org
GPG-Key: 5BFDD3D9
Publications
-
Michael Naehrig, Paulo S. L. M. Barreto, Peter Schwabe: On compressible pairings and their computation,
Progress in Cryptology - AfricaCrypt 2008 , Lecture Notes in Computer Science 5023, Springer-Verlag (2008), pp 371--388.
[pdf] [bibtex] Cryptology ePrint Archive, Report 2007/429. -
Paulo S. L. M. Barreto, Michael Naehrig: Pairing-Friendly Elliptic Curves of Prime Order,
Selected Areas in Cryptography -- SAC'2005, Lecture Notes in Computer Science 3897, Springer-Verlag (2006), pp 319--331.
[pdf] [bibtex] Preliminary version: Cryptology ePrint Archive, Report 2005/133.
Preprints
-
Christophe Arène, Tanja Lange, Michael Naehrig, Christophe
Ritzenthaler: Faster Pairing Computation,
Cryptology ePrint Archive, Report 2009/155, arXiv.org, arXiv:0904.0854. - Laura Hitt O'Connor, Gary McGuire, Michael Naehrig, Marco Streng: CM
construction of genus 2 curves with p-rank 1,
Cryptology ePrint Archive, Report 2008/491, arXiv.org, arXiv:0811.3434v1.
Talks
- Constructive and Computational Aspects of Cryptographic Pairings [pdf slides], short presentation during my PhD defense, Eindhoven University of Technology, The Netherlands, 2009-05-07.
- Pairings on Edwards curves [pdf slides], invited talk at the Workshop on Pairings in Arithmetic Geometry and Cryptography, IEM, University of Duisburg-Essen, Essen, Germany, 2009-05-05.
- Pairings II [pdf slides], Diamant Summer School on Elliptic and Hyperelliptic Curve Cryptography, Eindhoven, The Netherlands, 2008-09-19.
- Pairings I [pdf slides], Diamant Summer School on Elliptic and Hyperelliptic Curve Cryptography, Eindhoven, The Netherlands, 2008-09-18.
- On compressible pairings and their computation [pdf slides], AfricaCrypt 2008, Casablanca, Morocco, 2008-06-13.
- How to construct pairing-friendly curves [pdf slides], seminar talk, LARC, University of São Paulo, Brasil, 2007-09-28.
- Pairing-friendly elliptic curves of prime order [pdf slides], seminar talk, Computer Security group, b-it Bonn, Germany, 2006-01-12.
- Pairing-friendly elliptic curves of prime order [pdf slides], Selected Areas in Cryptography -- SAC 2005, Queen's University, Kingston, Canada, 2005-08-12.
Theses
- PhD thesis: Constructive and Computational Aspects of Cryptographic
Pairings, Eindhoven University of Technology, The
Netherlands, 2009.
(2009-05-13: updated version, corrected some typos and mistakes) [pdf] - Diploma thesis: Die Brauer-Bäume des Monsters M in Charakteristik 29 (german), RWTH Aachen University, Germany, 2002. [pdf]
Misc
- Redmond 2009
- www.die-naehrigs.de
- Slides from the joint "talk" "A brief look at the 56 SHA-3 submissions" with Christiane Peters and Peter Schwabe, given at the rump session of Eurocrypt 2009 (2009-04-28). See also the Lyrics with guitar chords and the video on youtube.
-
A web interface to get parameters for
BN curves.