Agenda

07 Mar 2018 12:15

Efficient factorization of composite integers

Campus Scientifico via Torino - edificio ZETA, Sala Riunioni B

Sedláček Vladimír, Università Ca' Foscari

Abstract:
Efficient factorization of composite integers is an old and important problem and cryptographic schemes such as RSA are based on its intractability. In this talk, we will study a polynomial time factorization algorithm that works for numbers with a prime factor of a special form. The algorithm relies on the construction of an anomalous elliptic curve, for which the theory of complex multiplication is used, but no prior knowledge of it is expected.

Lingua

L'evento si terrà in italiano

Organizzatore

ACADIA Research Centre

Cerca in agenda