Andrea Tenti

Andrea Tenti

Ph.D. started in: 2016
Year of graduation: 2019
COINS consortium member: University of Bergen
Supervised by: Igor A. Semaev, Tor Helleseth
Links:
Research area: Cryptography
Project title: Analysis of Macaulay matrices over finite fields
Project description: Elliptic curve cryptography algorithms have been of common use for a decade. Unlike DLPs in finite field, there are no dedicated algorithms for solving the discrete logarithm over the groupof points on an elliptic curve significantly faster than Pollard’s rho. Semaev proposed an elliptic curve version for index calculus algorithms. Experimental results show that the algorithm is actually faster than Pollard’s rho. Our goal is to prove formally that the average complexity is smaller than known methods. In order to do this, we require a deep understanding of the Macaulay matrices that lead to the generation of the Gröbner basis that finds solutions for the summation polynomials used to write a point on the curve as sum of points whose logarithms are known.

1. Alessandro Budroni, Andrea Tenti (2019). The mersenne low hamming combination search problem can be reduced to an ILP problem
2. Bjørn Ian Dundas, Andrea Tenti (2017). Higher Hochschild homology is not a stable invariant