Posted in
Speaker:
Peter Stevenhagen
Date:
Wed, 20/11/2013 - 16:30 - 17:30
Location:
MPIM Lecture Hall Algorithms going under the name `complex multiplication' typically have a run time that is exponential in the size of the input data. We will show that nevertheless such algorithms may sometimes be profitably used in cryptographic settings.
© MPI f. Mathematik, Bonn | Impressum & Datenschutz |