Avatar

Thom Wiggers

PhD candidate at Radboud University

Radboud University

Biography

Thom Wiggers is a PhD Candidate at Radboud University in The Netherlands. He is working on the interactions of post-quantum cryptography with protocols, under the supervision of Peter Schwabe.

Interests

  • Cryptography
  • Post-quantum Cryptography
  • Protocols
  • Information Security

Education

  • MSc in Computing Science, 2018

    Radboud University Nijmegen

  • BSc in Computing Science (Informatica), 2015

    Radboud University Nijmegen

  • BSc in Information Sciences (Informatiekunde), 2015

    Radboud University Nijmegen

Teaching

I have been involved as a teaching assistant in the following courses:

  • Functional Programming (2013-2017)
  • Operating Systems (2014-2017)
  • Object-Oriented Programming for Science students (2015)
  • Operating Systems Security (2016, 2017)
  • Hacking in C (2018, 2019)

See the teaching pages for course materials.

Recent Posts

Extract only needed citations from large bibfiles

I like to use cryptobib, because it gives me consistent results and it contains almost everything relevant to me. However, as …

Rephrasing TLS key exchange in terms of KEMs

In the RFC for TLS 1.3 (RFC8446) especially, the key exchange is defined in terms of (EC)DH key shares being exchanged. This limits us …

Using (post-quantum) KEMs in TLS 1.3

The new TLS 1.3 standard [1] does not yet provide any support for post-quantum algorithms. In this blog post we’ll be talking …

Recent & Upcoming Talks

Solving LPN Using Large Covering Codes

Since quantum computers are expected to break most of the cryptographic schemes we rely on today, we need to look at alternatives. …

Recent Publications

Energy-efficient ARM64 Cluster with Cryptanalytic Applications: 80 cores that do not cost you an ARM and a leg

Getting a lot of CPU power used to be an expensive under-taking. Servers with many cores cost a lot of money and consume large …

Solving LPN using Large Covering Codes

Learning Parity with Noise (LPN) is a computational problem that we can use for cryptographic algorithms. It is suspected that LPN can …

Contact

  • Room 3.11b, Toernooiveld 212, Nijmegen, 6525 EC, The Netherlands
  • Third floor of the Mercator I building, next to the break room.