Michael Naehrig
I am a postdoc in the Cryptography Group at
Microsoft Research, Redmond.
In May 2009, I completed my PhD at Eindhoven
University of Technology in the Coding and
Cryptology Group under the supervision of Tanja Lange.
Contact:
michael@cryptojedi.org
GPG-Key: 5BFDD3D9
mnaehrig@microsoft.com
My MSR web
page.
Publications
-
Craig Costello, Tanja Lange, Michael Naehrig: Faster Pairing
Computations on Curves with High-Degree Twists,
to appear in Public Key Cryptography - PKC 2010, Lecture Notes in Computer Science, Springer (2010).
Cryptology ePrint Archive, Report 2009/615. -
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 (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 (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 Computation of the Tate Pairing,
Cryptology ePrint Archive, Report 2009/155, arXiv.org, arXiv:0904.0854. - Laura Hitt O'Connor, Gary McGuire, Michael
Naehrig, Marco Streng: A CM
construction for curves of genus 2 with p-rank 1,
Cryptology ePrint Archive, Report 2008/491, arXiv.org, arXiv:0811.3434v2.
I am on the program committee of Africacrypt 2010.
Talks
- Pairings for Cryptography [pdf slides], invited talk at the seminar of the Digital Security Group, Radboud Universiteit Nijmegen, The Netherlands, 2009-12-11.
- BN curves revisited [pdf slides], invited talk at the Mini-Workshop on Computational aspects of elliptic and hyperelliptic curves, K.U. Leuven, Belgium, 2009-10-28.
- Efficient Computation of Pairings on Elliptic Curves [pdf slides], EIDMA/DIAMANT Cryptography Working Group, Utrecht, The Netherlands, 2009-10-02.
- Pairings on Edward's curves [pdf slides], talk at the Rump Session of ECC 2009, University of Calgary, Canada, 2009-08-24.
- A Quick Guide to Efficient Pairing Computation, Microsoft Research, Redmond, WA, USA, 2009-08-12.
- Computing Pairings on Elliptic Curves [pdf slides], talk at crypto group lunch, Microsoft Research, Redmond, WA, USA, 2009-07-17.
- 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.