The projects involve theoretical study or practical implementation of algorithms related to asymmetric cryptosystems, in any combination as seen fit given the student’s background.
In particular we are interested in students who want to get their hands dirty working with the various cluster computing projects we are involved in (large scale integer factorization efforts, discrete logarithm computation in large finite fields of small characteristic, shortest and nearest vector problems in integer lattices).
Student proposals: Students are encouraged to propose projects of their own choice that match
the interests at LACAL. If you have an idea about a challenging or otherwise interesting cryptology
related algorithmic project, please come and talk to us.
Please login here to see the available project proposals.