Christiane Peters

Publications

Below a list of publications where I’m a (co-)author. The list is given by date in reverse chronological order and fall into the categories architecture [arch], book chapter [book], peer-reviewed conference proceedings [conf], dissertation [diss], peer-reviewed journal [jour], or miscellaneous [misc].

2017:

2016:

  • [misc] George Danezis, Stefan Katzenbeisser, Christiane Peters, Bart Preneel. Privacy and Security in Smart Energy Grids (Dagstuhl Seminar 16032). In Dagstuhl Reports 6(1), pp. 99-107, 2016. pdf bibtex

2015:

  • [conf] Klaus Kursawe, Christiane Peters. Structural Weaknesses in the Open Smart Grid Protocol. In IEEE Computer Society 2015 10th International Conference on Availability, Reliability and Security. ARES Best Paper Award. 2015. pdf doi bibtex

2014:

  • [arch] Co-author of requirements document by Projektgruppe Oesterreichs Energie / European Network for Cyber Security. Sicherheitsanforderungen für Smart Meter/ End-to-End Security for Smart Metering. Version 1 was superseeded in the meantime by version 1.1 here by Oesterreichs Energie.

2013:

  • [jour] Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters. ECM using Edwards curves. In Mathematics of Computation, Vol. 82, pp. 1139–1179, AMS, 2013. doi eprint bibtex eecm comic

2011:

  • [conf] 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 bibtex wild challenges
  • [book] 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
  • [conf] 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 bibtex
  • [diss] Christiane Peters. Curves, Codes, and Cryptography. Ph.D. thesis. Technische Universiteit Eindhoven, the Netherlands. 2011. pdf bibtex statements
  • [conf] 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 bibtex
  • [conf] 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 bibtex

2010:

  • [conf] 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 bibtex wild Goppa code decoder
  • [conf] Christiane Peters. Information-set decoding for linear codes over Fq. In Post-Quantum Cryptography, Lecture Notes in Computer Science, Vol. 6061, pp. 81–94. Springer-Verlag Berlin Heidelberg, 2010. pdf bibtex ISD cost (C code, scripts, examples) GitHub repo

2009:

  • [conf] 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 bibtex implementation by Ruben Niederhagen and Peter Schwabe
  • [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 bibtex
  • [conf] 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

2008:

  • [conf] 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 bibtex iteration count press release
  • [conf] 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 bibtex

2007:

  • [conf] 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 bibtex