A multivariate GNFS implementation over a biquadratic extension of Q
Seminar for the Admission at Final Exam
2 October 2018
October 2, 2018
share
Luogo: PovoZero, via Sommarive, 14 - Povo - Sala Seminari 1
Ore: 14:30
Relatore:
- Santilli Giordano (PhD Student in Mathematics)
Abstract:
SA is one of the most used algorithm in Public Key Cryptography and its security relies in the hardness of the Factorization Problem. At the moment, the most efficient algorithm known for factorization is the General Number Field Sieve (GNFS), which allowed to break RSA moduli up to 768 bits. During this talk, I will expose a multivariate version of the algorithm, focusing on the changes in the choice of the Algebraic Factor Base and I will present a way to possibly improve the computational time of GNFS.
Referente: Massimiliano Sala
