Peter Schwabe (樂岩)
Academia Sinica
Institute of Information Science
No. 128 Academia Road, Section 2
Nankang, Taipei 11529
Taiwan
Room: 307
E-Mail: peter@cryptojedi.org
GPG-Key: 603ABD5D,
Fingerprint: 64A9 1D22 F226 EA50 7B8C 7197 A715 A6B7 603A BD5D
About Me
I am a postdoc in the
Research Center for Information Technology Innovation
and the
Institute of Information Science of
Academia Sinica.
Before I was postdoc in the
Department of Electrical Engineering of
National Taiwan University within the
Intel-NTU Connected Context Computing Center.
Before I was a postdoc in the
Institute of Information Science at
Academia Sinica.
Before I was a Ph.D. student in the
Department of Mathematics and Computer Science at
Eindhoven University of Technology.
In January 2011, I completed my Ph.D. at Eindhoven University of Technology in the Coding and Cryptology Group under the supervision of Tanja Lange and Daniel J. Bernstein.
In 2006, I finished my Diplom in computer science at RWTH Aachen University at the Institute for Theoretical Information Technology under the supervision of Rudolf Mathar and Michael Naehrig.
Theses
-
Ph.D. thesis: High-Speed Cryptography and Cryptanalysis, Eindhoven University of Technology, The Netherlands, 2011.
For the thesis and related software please refer to my separate Ph.D. thesis website. - Diplomarbeit: Effiziente Implementierung von Elliptischen und Hyperelliptischen Kurven für Anwendungen in der Kryptographie, RWTH Aachen University, Germany, 2006. [ps]
Publications
-
Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, and Bo-Yin Yang:
High-speed high-security signatures.
Cryptographic Hardware and Embedded Systems – CHES 2011.
Lecture Notes in Computer Science 6917, Springer-Verlag (2011), pp 124–142.
Date: 2011-09-26 [pdf] [bibtex] [more]
Supersedes: 2011-07-05[pdf] -
Daniel J. Bernstein, Tanja Lange, Christiane Peters, and Peter Schwabe:
Really fast syndrome-based hashing.
Progress in Cryptology – AFRICACRYPT 2011, Lecture Notes in Computer Science 6737, Springer-Verlag (2011), pp 134–152.
Date: 2011-05-08 [pdf] [bibtex]
[more]
Supersedes: 2011-02-14 [pdf] -
Daniel J. Bernstein, Tanja Lange, Christiane Peters, and Peter Schwabe:
Faster 2-regular information-set decoding.
Coding and Cryptology, Lecture Notes in Computer Science 6639, Springer Verlag (2011), pp 81–98.
Date: 2011-03-09 [pdf] [bibtex] -
Daniel J. Bernstein, Tanja Lange, and Peter Schwabe:
On the correct use of the negation map in the Pollard rho method.
Public Key Cryptography – PKC 2011, Lecture Notes in Computer Science 6571, Springer-Verlag (2011), pp 128–146.
Date: 2011-01-02 [pdf] [bibtex]
-
Daniel J. Bernstein, Hsieh-Chung Chen, Chen-Mou Cheng, Tanja Lange, Ruben Niederhagen, Peter Schwabe, and Bo-Yin Yang:
ECC2K-130 on NVIDIA GPUs.
Progress in Cryptology – INDOCRYPT 2010, Lecture Notes in Computer Science 6498, Springer Verlag (2010), pp 328–346.
Date: 2012-01-02 [pdf] [bibtex]
-
Michael Naehrig, Ruben Niederhagen, and Peter Schwabe:
New software speed records for cryptographic pairings.
Progress in Cryptology – LATINCRYPT 2010, Lecture Notes in Computer Science 6212, Springer-Verlag (2010), pp 109–123.
Date: 2010-07-14 [pdf] [bibtex] [more]
Supersedes: 2010-05-28 [pdf], supersedes: 2010-04-06 [pdf]
Caution: The software as described in versions 2010-05-28 and 2010-04-06 of the paper has a bug related to the choice of curve parameters. This also affects the version in the Latincrypt 2010 proceedings. A corrected version of the software is available and the bug is corrected from version 2010-07-14 of the paper. -
Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhagen, and Peter Schwabe:
ECC2K-130 on Cell CPUs.
Progress in Cryptology – AFRICACRYPT 2010, Lecture Notes in Computer Science 6055, Springer Verlag (2010), pp 225–242.
Date: 2010-02-28 [pdf] [bibtex]
Supersedes: 2010-02-12 [pdf] -
Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, and Peter Schwabe:
FSBDay: Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB.
Progress in Cryptology – INDOCRYPT 2009, Lecture Notes in Computer Science 5922, Springer Verlag (2009), pp 18–38.
Date: 2011-09-27 [pdf] [bibtex]
[bibtex]
Supersedes: 2009-09-24 [pdf], supersedes: 2009-09-01 [pdf], supersedes: 2009-06-17 [pdf] -
Daniel V. Bailey, Brian Baldwin, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Gauthier van Damme,
Giacomo de Meulenaer, Junfeng Fan, Tim Güneysu, Frank Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens,
Christof Paar, Francesco Regazzoni, Peter Schwabe, and Leif Uhsadel:
The Certicom Challenges ECC2-X.
Workshop Record of SHARCS'09: Special-purpose Hardware for Attacking Cryptographic Systems, pp 51–82.
Date: 2009-09-17 [pdf] [bibtex] -
Michael Naehrig, Christiane Peters, and Peter Schwabe:
SHA-2 will soon retire - The SHA-3 Song.
Journal of Craptology, volume 7 (invited paper).
Date: 2009-06-22 [pdf] [bibtex] [more] -
Emilia Käsper and Peter Schwabe:
Faster and Timing-Attack Resistant AES-GCM.
Cryptographic Hardware and Embedded Systems – CHES 2009, Lecture Notes in Computer Science 5745, Springer-Verlag (2009), pp 1–17.
Date: 2009-06-16 [pdf] [bibtex] [more]
Supersedes: 2009-03-19 [pdf] -
David Kammler, Diandian Zhang, Peter Schwabe, Hanno Scharwaechter, Markus Langenberg,
Dominik Auras, Gerd Ascheid, and Rudolf Mathar:
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves.
Cryptographic Hardware and Embedded Systems – CHES 2009, Lecture Notes in Computer Science 5745, Springer-Verlag (2009), pp 254–271.
Date: 2009-07-14 [pdf] [bibtex]
See also full version of the paper by David Kammler, Diandian Zhang, Peter Schwabe, Hanno Scharwaechter, Markus Langenberg, Dominik Auras, Rainer Leupers, Gerd Ascheid, Rudolf Mathar, and Heinrich Meyr: [pdf]
Supersedes: 2009-03-31 [pdf], supersedes: 2009-02-05 [pdf] -
Neil Costigan and Peter Schwabe:
Fast elliptic-curve cryptography on the Cell Broadband Engine.
Progress in Cryptology – AFRICACRYPT 2009, Lecture Notes in Computer Science 5580, Springer-Verlag (2009), pp 368–385.
Date: 2009-03-31 [pdf] [bibtex] [more]
Supersedes: 2009-01-21 [pdf], supersedes: 2009-01-07 [pdf] -
Daniel J. Bernstein and Peter Schwabe:
New AES software speed records.
Progress in Cryptology - INDOCRYPT 2008, Lecture Notes in Computer Science 5365, Springer-Verlag (2008), pp 322–336.
Date: 2008-09-26 [pdf] [bibtex] [more]
Supersedes: 2008-09-08 [pdf] -
Michael Naehrig, Paulo S. L. M. Barreto and 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] [more]
Technical Reports
-
Peter Schwabe, Bo-Yin Yang, and Shang-Yi Yang:
SHA-3 on ARM11 processors.
Date: 2011-11-25 [pdf] [bibtex]
-
Daniel J. Bernstein, Tanja Lange, and Peter Schwabe:
The security impact of a new cryptographic library.
Date: 2011-12-01 [pdf] [bibtex]
[more]
-
Daniel V. Bailey, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos,
Hsieh-Chung Chen, Chen-Mou Cheng, Gauthier Van Damme, Giacomo de Meulenaer,
Luis Julian Dominguez Perez, Junfeng Fan, Tim Güneysu, Frank Gürkaynak, Thorsten Kleinjung,
Tanja Lange, Nele Mentens, Ruben Niederhagen, Christof Paar, Francesco Regazzoni,
Peter Schwabe, Leif Uhsadel, Anthony Van Herrewege, and Bo-Yin Yang:
Breaking ECC2K-130.
Date: 2009-11-06 [pdf] [bibtex]
Talks
- Slides from my presentation High-Speed Cryptography, 2011-10-24 in the Graduate Seminar of National Taiwan University
- Slides from my presentation Fun things to do with your mobile phone, 2011-09-30 in the rump session of CHES 2011 in Nara, Japan.
- Slides from my presentation High-speed high-security signatures, 2011-09-29 at CHES 2011 in Nara, Japan.
- Slides from my presentation High-speed high-security signatures, 2011-09-14 in the EiPSI seminar at Eindhoven University of Technology.
- Slides from my talk Really fast syndrome-based hashing, 2011-07-05 at Africacrypt 2011.
- Slides from my talk How to use the negation map in the Pollard rho method, 2011-06-16 in the crypto seminar of the Laboratoire PRiSM at Université de Versailles Saint-Quentin-en-Yvelines.
- Slides from my talk On the correct use of the negation map in the Pollard rho method, 2010-10-18 in the rump session of ECC 2010, Redmond, USA.
- Slides from my talk New software speed records for cryptographic pairings, 2010-08-09 at Latincrypt 2010.
- Slides from my talk New software speed records for cryptographic pairings, 2010-07-08 in the HGI Colloquium at Ruhr Universität Bochum.
-
Slides from my talk Breaking ECC2K-130, 2010-05-20 in the
Obersemiar Computer Security
at B-IT Bonn.
Subsets of these slides I used for the talks
ECC2K-130 on Cell processors, 2010-05-05, at Africacrypt 2010,
Breaking ECC2K-130 on Cell processors and GPUs, 2010-04-14 in the Workshop on Computer Security and Cryptography at CRM Montréal, and
Breaking ECC2K-130 (on Cell CPUs and NVIDIA GPUs), 2010-03-21 at CARAMEL group, INRIA Nancy. - Slides from my talk How do deal with annoying questions from Dan, 2010-05-04 at the rump session of Africacrypt 2010.
- Slides from my talk NaCl — Networking and Cryptography library, 2009-12-04 at the SPAN meeting at TU Eindhoven and code examples I used in the talk: enc-auth-openssl.c, enc-auth-nacl.c.
- Slides from my talk AES-GCM plus rapide et résistant aux attaques temporelles, 2009-11-13 in the séminaire de cryptographie at Université de Rennes 1.
- Slides from the joint talk by Christiane Peters and me FSBDay: Implementing Wagner's Generalized Birthday Attack against the round-1 SHA-3 Candidate FSB, 2009-09-10 at SHARCS 2009.
- Slides from the joint talk by Daniel V. Bailey, Daniel J. Bernstein, Frank Gurkaynak, Tanja Lange and me The Certicom Challenges ECC2-X, 2009-09-09 at SHARCS 2009.
- Slides from my talk Fast elliptic-curve cryptography on the Cell Broadband Engine, 2009-06-24 at Africacrypt 2009 and similarly 2009-05-20 at the COSIC seminar at KU Leuven.
- Slides from the joint talk by Christiane Peters and me FSBDay: Implementing Wagner's Generalized Birthday Attack against the SHA-3 Candidate FSB, 2009-06-16 at the INRIA Paris - Rocquencourt.
-
Slides from the joint "talk" by Christiane Peters,
Michael Naehrig", and me
"A brief look at the 56 SHA-3 submissions",
2009-04-28 at the rump session of
Eurocrypt 2009.
See also the Lyrics with guitar chords and the video on youtube. - Slides from the joint presentation by Emilia Käsper and me "How fast is AES?", 2009-02-12 at the rump session of FSE 2009.
- Slides from my presentation "New AES software speed records", 2008-12-16 at Indocrypt 2008.
- Slides from my presentation "Achieving Software Speed Records with qhasm", 2008-11-12 in the EiPSI seminar at Eindhoven University of Technology.
- Slides from my presentation "Effiziente Berechnung der Tate Paarung", 2007-06-06 at the Institute for Theoretical Information Technology at RWTH Aachen University.
- Slides from my presentation "Paarungen und Identitätsbasierte Kryptographie", 2007-05-10 at the Institute for Theoretical Information Technology at RWTH Aachen University.
- Slides from my presentation "Effiziente Implementierung von elliptischen und hyperelliptischen Kurven", 2006-5-31 at the Institute for Theoretical Information Technology at RWTH Aachen University.
- Slides from my presentation "Arithmetik auf hyperelliptischen Kurven", 2005-12-14 at the Institute for Theoretical Information Technology at RWTH Aachen University.
- Slides from my seminar talk "Seitenkanalattacken gegen Kryptographie auf Elliptischen Kurven", 2005-05-17 at the Institute for Theoretical Information Technology at RWTH Aachen University and related report.
Teaching
Lecture "Security Issues in Cloud Computing", NTU, 2011/2012
Whiteboard transcripts:- 2011-10-07: Introduction to Cryptography
- 2011-10-14: Modern Cryptography I – Symmetric Cryptography
- 2011-10-21: Modern Cryptography I – Symmetric Cryptography (ctd.)
- 2011-10-28: Modern Cryptography II – Asymmetric Cryptography
- Homework assignment to be handed in on December 11, 2011:
Describe where cryptographic hash functions are used. Explain for what purpose they are used and what properties of the hash function are required for the respective applications. Focus on applications that have not been dealt with in the lecture.
Remarks: This is not about finding as many applications as possible, focus on just 1-2 applications. Your essay should be about 1 page in length.