Bachelor

Project list

(updated on 20 November 2018)

Factoring polynomials over finite fields in Python

Person of contact: Novak Kaluderovic (novak.kaluderovic@epfl.ch)

Resources:  https://people.csail.mit.edu/dmoshkov/courses/codes/poly-factorization.pdf

Implement and benchmark an efficient verifiable delay function

Person of contact: Novak Kaluderovic (novak.kaluderovic@epfl.ch)

Resources:  https://eprint.iacr.org/2018/623.pdf

Implement a program in C for finding the next “memorable” prime (A173426)

Person of contact: Novak Kaluderovic (novak.kaluderovic@epfl.ch)

Resources:

https://www.ams.org/journals/notices/201809/201809FullIssue.pdf  (page 1070, “A memorable prime”)

Implement a program in C for finding the first prime in the list A007908

Person of contact: Novak Kaluderovic (novak.kaluderovic@epfl.ch)

Resources:

https://www.ams.org/journals/notices/201809/201809FullIssue.pdf  (page 1071, “A missing prime”)

Implementation of belief propagation algorithm in template attack

Person of contact: Aymeric Genet (aymeric.genet@epfl.ch)

Implement the belief propagation algorithm in an efficient way to evaluate the feasibility of template attacks on lattice-based cryptography using side-channel information.

Resources:

https://eprint.iacr.org/2017/594.pdf

https://eprint.iacr.org/2014/410.pdf

Improve lattice-based attacks on digital signature schemes

Person of contact: Aymeric Genet (aymeric.genet@epfl.ch)

Based on an existing library (fplll), determine which lattice reduction algorithm performs better in a key recovery attack on digital signature schemes to match (or potentially break) a current world record.

Resources:

http://www.hpl.hp.com/techreports/1999/HPL-1999-90.pdf

https://eprint.iacr.org/2018/396

https://eprint.iacr.org/2013/346

http://ljk.imag.fr/membres/Jean-Guillaume.Dumas/Enseignements/ProjetsCrypto/FautesECC/Nguyen.pdf

https://github.com/fplll/fplll