[HGI-News-de] HGI Kolloquium Do. 18.06.: "The Generic Hardness of Subset Membership Problems under the Factoring Assumption " von T. Jager

[Newsletter des Horst Görtz Instituts]

Hallo,

im Rahmen des HGI Kolloquiums "Aktuelle Themen der IT-Sicherheit" wird
am kommenden *Donnerstag* der folgende Vortrag angeboten:

Tibor Jager (NDS):
*The Generic Hardness of Subset Membership Problems under the Factoring
Assumption*


Termin:
Donnerstag, der 18. Juni um  11.00 Uhr (*s.t.*)
Raum: IC 4/161

Interessierte sind herzlich eingeladen!


==============================================================
Abstract:

We analyze a large class of subset membership problems related to
integer factorization. We show that there is no algorithm solving these
problems efficiently without exploiting properties of the given
representation of ring elements, unless factoring integers is easy. Our
results imply that problems with high relevance for a large number of
cryptographic applications, such as the quadratic residuosity and the
subgroup decision problems, are generically equivalent to factoring.
==============================================================

Informationen über die nächsten geplanten Vorträge im Rahmen des
HGI Kolloquiums sind auch im Web zu finden:
http://www.hgi.rub.de/hgi/hgi-seminar/aktuelles

Gruß,
Mathias Herrmann