News  Publications  Ph.D. thesis  Talks  Conferences  Travel 

Christiane Peters

I am a postdoc in the Discrete Mathematics group at the Technical University of Denmark. This position is funded by the Danish Council for Independent Research (FTP grant for "Code-based Cryptography").

Before I was a research associate in the Computer Science Department at the University of Illinois at Chicago in the United States (NIST project "Post-Quantum Cryptography" led by Daniel J. Bernstein).
Before I was a Ph.D. student in the Coding and Cryptology group at the Technische Universiteit Eindhoven in the Netherlands.
My research interests are code-based cryptography and elliptic-curve cryptography.

Contact

News

• YACC submission deadline: June 15, 2012.
• CrossFyre Workshop at TU Eindhoven: June 14-15, 2012.
• Code-based Cryptography Workshop 2012 at DTU: May 9-11, 2012. Slides of invited and contributed talks are online.

Publications

Journal article

• Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters. ECM using Edwards curves. Accepted for publication in Mathematics of Computation (2011).   pdf   eprint   bibtex   eecm website   eecm comic

Book chapter

• Christiane Peters. Decoding algorithms. In Encyclopedia of Cryptography and Security (2nd edition), Henk C.A. van Tilborg and Sushil Jajodia (eds.), pp. 319--322. Springer-Verlag Berlin Heidelberg, 2011.   doi   bibtex

Conference proceedings

• Daniel J. Bernstein, Tanja Lange, Christiane Peters. Wild McEliece Incognito. In Post-Quantum Cryptography, Lecture Notes in Computer Science, Vol. 7071, pp. 244--254. Springer-Verlag Berlin Heidelberg, 2011.   pdf   doi   bibtex   wild challenges
• Daniel J. Bernstein, Tanja Lange, Christiane Peters. Smaller decoding exponents: ball-collision decoding. In CRYPTO 2011, Lecture Notes in Computer Science, Vol. 6841, pp. 743--760. Springer-Verlag Berlin Heidelberg, 2011.   pdf   doi   bibtex
• Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe. Really fast syndrome-based hashing. In AFRICACRYPT 2011, Lecture Notes in Computer Science, Vol. 6737, pp. 134--152. Springer-Verlag Berlin Heidelberg, 2011.   pdf   doi   bibtex
• Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe. Faster 2-regular information-set decoding. In IWCC 2011, Lecture Notes in Computer Science, Vol. 6639, pp. 81--98. Springer-Verlag Berlin Heidelberg, 2011.   pdf   doi   bibtex
• Daniel J. Bernstein, Tanja Lange, Christiane Peters. Wild McEliece. In SAC 2010, Lecture Notes in Computer Science, Vol. 6544, pp. 143--158. Springer-Verlag Berlin Heidelberg, 2011.   pdf   doi   bibtex   wild-Goppa-code decoder
• Christiane Peters. Information-set decoding for linear codes over F_q. In Post-Quantum Cryptography, Lecture Notes in Computer Science, Vol. 6061, pp. 81--94. Springer-Verlag Berlin Heidelberg, 2010.   pdf   doi   bibtex   ISD cost (C code, scripts, examples)
• Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, Peter Schwabe. FSBday: Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB. In SHARCS'09 Workshop Record (Proceedings 4th Workshop on Special-purpose Hardware for Attacking Cryptographic Systems, Lausanne, Switzerland, September 9--10, 2009). pp. 85--104, 2009, and
  in Progress in Cryptology ‒ INDOCRYPT 2009, Lecture Notes in Computer Science, Vol. 5922, pp. 18--38. Springer-Verlag Berlin Heidelberg, 2009.   pdf   doi   bibtex   implementation by Ruben Niederhagen and Peter Schwabe
• Daniel J. Bernstein, Tanja Lange, Christiane Peters, Henk C.A. van Tilborg. Explicit bounds for generic decoding algorithms for code-based cryptography. In Pre-proceedings of WCC 2009, pp. 168--180, 2009. See Chapter 5 of my Ph.D. thesis.   bibtex
• Daniel J. Bernstein, Tanja Lange, Christiane Peters. Attacking and defending the McEliece cryptosystem. In Post-Quantum Cryptography, Lecture Notes in Computer Science, Vol. 5299, pp. 31--46. Springer-Verlag Berlin Heidelberg, 2008.   pdf   doi   bibtex   iteration count   press release
• Daniel J. Bernstein, Peter Birkner, Marc Joye, Tanja Lange, Christiane Peters. Twisted Edwards curves. In AFRICACRYPT 2008, Lecture Notes in Computer Science, Vol. 5023 , pp. 389--405. Springer-Verlag Berlin Heidelberg, 2008.   pdf   doi   bibtex
• Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters. Optimizing double-base elliptic-curve single-scalar multiplication. In Progress in Cryptology ‒ INDOCRYPT 2007, Lecture Notes in Computer Science, Vol. 4859, pp. 167--182. Springer-Verlag Berlin Heidelberg, 2007.   pdf   doi   bibtex

Misc

• Michael Naehrig, Christiane Peters, Peter Schwabe. SHA-2 will soon retire - The SHA-3 Song. In Journal of Craptology, volume 7 (invited paper), 2009.   pdf   Eurocrypt'09 rump session talk   bibtex

Dissertation

In May 2011, I completed my Ph.D. studies at the Technische Universiteit Eindhoven in the Coding and Cryptology Group under the supervision of Tanja Lange and Daniel J. Bernstein.

• Ph.D. thesis: Curves, Codes, and Cryptography. Technische Universiteit Eindhoven. The Netherlands, 2011. pdf   bibtex
• Stellingen: pdf

Talks and Presentations

• 2011.12.02 - Wild McEliece Incognito. PQCrypto 2011. Taipei, Taiwan.  slides
• 2011.09.29 - Curves, Codes, and Cryptography. DTU crypto group seminar. Kgs. Lyngby, Denmark.
• 2011.09.20 - Code-based Cryptography. Elliptic Curve Cryptography conference (ECC 2011). Nancy, France. Invited talk.  slides
• 2011.08.16 - Playing "Spot the Difference" with Springer. CRYPTO 2011 Rump Session. Santa Barbara, CA, United States.  slides
• 2011.04.14 - An Introduction to Post-Quantum Cryptography/Code-based Cryptography. CrossFyre. Darmstadt, Germany.  slides
• 2011.04.01 - Wild McEliece Incognito. Séminaire de Cryptographie. Rennes, France. Invited talk.  slides
• 2010.11.18 - Ball-collision decoding. Oberseminar Cryptography and Computer Algebra. Darmstadt, Germany. Invited talk.  slides
• 2010.11.05 - Wild McEliece. Discrete Mathematics Seminar. Kgs. Lyngby, Denmark.  slides
• 2010.10.28 - Off-Shor. JQI/NIST Quantum Information Workshop. College Park, MD, United States. Invited talk.  slides
• 2010.10.01 - Wild McEliece. EIDMA/DIAMANT Cryptography Working Group. Utrecht, the Netherlands. Same slides as for the Intercity Number Theory Seminar.
• 2010.09.17 - Wild McEliece. Intercity Number Theory Seminar. Eindhoven, the Netherlands.   slides
• 2010.08.12 - Wild McEliece. Selected Areas in Cryptography (SAC) 2010. Waterloo, Canada.   slides
• 2010.05.28 - Ball-collision decoding. Recent Results Session PQCrypto 2010. Darmstadt, Germany.   slides
• 2010.05.26 - Information-set decoding for linear codes over F_q. PQCrypto 2010. Darmstadt, Germany.   slides
• 2010.04.19 - Algebraic construction of the Elkies factor. Workshop on Counting Points: Theory, Algorithms and Practice. Montréal, Canada.   slides
• 2010.04.12 - Code-based Cryptography. Workshop on Computer Security and Cryptography. Montréal, Canada. Invited talk.   slides
• 2009.09.10 - FSBday: Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB. Joint talk by Peter Schwabe and me at SHARCS 2009. Lausanne, Switzerland.   slides
• 2009.07.17 - A successful attack on the McEliece cryptosystem with original parameters. S³CM 2009 - Applied Computational Algebraic Geometric Modelling. Soria, Spain.   slides
• 2009.06.16 - FSBday: Implementing Wagner's generalized birthday attack against the SHA-3 candidate FSB. Joint talk by Peter Schwabe and me at the Code-based crypto day at INRIA. Paris-Rocquencourt, France.   slides
• 2009.06.12 - Attacking the McEliece cryptosystem. Google Europe Anita Borg Scholarship Retreat 2009. Zürich, Switzerland.   poster
• 2009.05.12 - Explicit Bounds for Generic Decoding Algorithms for Code-Based Cryptography. WCC 2009. Ullensvang, Norway.   slides
• 2009.04.28 - A brief look at the 56 SHA-3 submissions. Joint "talk" by Michael Naehrig, Peter Schwabe, and me during the rump session of Eurocrypt 2009. Cologne, Germany.   slides   lyrics and chords   invited paper
• 2009.04.01 - Explicit Bounds for Generic Decoding Algorithms for Code-Based Cryptography. EIPSI seminar. Eindhoven, the Netherlands.   slides
• 2009.02.20 - Advances in Information-Set Decoding. EIDMA/DIAMANT Cryptography Working Group. Utrecht, the Netherlands.   slides
• 2008.10.18 - Attacking and defending the McEliece cryptosystem. PQCrypto 2008 ‒ 2nd Workshop on Postquantum Cryptography . Cincinnati, OH, United States.   slides
• 2008.10.01 - Attacking and defending the McEliece cryptosystem. EIPSI seminar. Eindhoven, the Netherlands.   slides
• 2008.09.17 - Counting points on elliptic curves over F_q. DIAMANT Summer School on Elliptic and Hyperelliptic Curve Cryptography. Eindhoven, the Netherlands.   slides
• 2008.07.10 - Edwards Curves. S³CM 2008 - Algebraic Coding Theory. Soria, Spain.   slides
• 2008.06.20 - Edwards Curves. Séminaire de Cryptographie. Rennes, France. Invited talk.   slides
• 2007.12.11 - Optimizing double-base elliptic curve single-scalar multiplication. INDOCRYPT 2007 ‒ 8th International Conference on Cryptology in India. Chennai, India.   slides
• 2007.11.29 - Optimizing double-base elliptic curve single-scalar multiplication. DIAMANT/EIDMA Symposium November 2007. Soesterberg, the Netherlands.   slides
• 2007.11.23 - Edwards Curves. CACAO Seminar, LORIA institute. Nancy, France.   slides

Conferences

Member of the program committees of

• Code-based Cryptography Workshop ‒ Kongens Lyngby, Denmark, May 2012 [Co-organizer].
• YACC 2012 ‒ Porquerolles Island, France, September 2012.
• PKC 2012 ‒ Darmstadt, Germany, May 2012.
• PQCrypto 2011 ‒ Taipei, Taiwan, December 2011.
• ECRYPT-II Code-based Cryptography Workshop ‒ Eindhoven, the Netherlands, May 2011 [Co-organizer].
• CrossFyre 2011 ‒ Darmstadt, Germany, April 2011 [Co-organizer].

Work-related travel :-)

Take a look at my conference map.