SEMINARIO: "COPPERSMITH'S METHOD: SOLUTIONS TO MODULAR POLYNOMIALS" - TEA BOON CHIAN

Seminario della serie "CRITTOGRAFIA: dalla teoria alle applicazioni", in collaborazione con Telsy SPA, azienda del gruppo TIM specializzata in cybersecurity.

"Coppersmith's Method: Solutions to Modular Polynomials"
Tea Boon Chian - Universiti Putra Malaysia (UPM)
Martedì 22 giugno 2021 - ore 14:30
Webinar

Sarà possibile seguire live il seminario mediante Zoom, attraverso il seguente link: Coppersmith's Method: Solutions to Modular Polynomials. Il seminario sarà tenuto in lingua inglese.

Il client di Zoom esiste su ogni piattaforma e può essere scaricato gratuitamente al link: https://zoom.us/download
In caso aveste dei problemi a seguire il seminario in diretta, vi ricordiamo che tutti i seminari sono visionabili a posteriori sul canale YouTube CrypTO.

Abstract: The Coppersmith’s method was introduced by Don Coppersmith in 1996, aiming to search “small” root(s) to polynomial equations. This heuristic method is vastly utilized in cryptography, especially in analysing the RSA-type cryptosystems, as well as lattice-based and multivariate cryptography. Although elegant, the Coppersmith’s method can be confusing to those who just started to learn it, particularly in constructing a basis lattice which enables one to use the LLL-reduction subsequently to find root(s) to polynomial equations. In this sharing session, the Coppersmith’s method is reviewed and discussed. The focus is primarily to demonstrate step-by-step with the aid of some examples on how to implement the method to construct a basis lattice for a given polynomial function. The session firstly considers the case of univariate polynomial, and next extended to bivariate/multivariate cases if time permits. Some applications related to the Coppersmith’s method are briefly outlined to conclude the sharing session.