[HGI-News] HGI-Seminar, Donnerstag 26.10.06: On the Equivalence of RSA and Factoring regarding Generic Ring Algorithms

[Newsletter des Horst Görtz Instituts]

Achtung: Anderer Tag und andere Zeit als normal!

                        Andy Rupp, COSY, RUB

          Donnerstag 26. Oktober 2006, 14:15 Uhr IC 4 / 39-41

 On the Equivalence of RSA and Factoring regarding Generic Ring Algorithms

To prove or disprove the computational equivalence of solving the RSA
problem and factoring integers is a longstanding open problem in
cryptography. We provide some evidence towards the validity of this
equivalence by showing that any efficient generic ring algorithm which
solves the (flexible) low-exponent RSA problem can be converted into an
efficient factoring algorithm. Thus, the low-exponent RSA problem is
intractable w.r.t. generic ring algorithms provided that factoring is hard.

In Kooperation mit Gregor Leander.


_____________________________________________________________________________
Die Webseite des HGI-Seminars mit allen Informationen zu vergangenen und
zukünftigen Vorträgen: http://www.hgi.rub.de/deutsch/lehrangebot/seminar.html