A New Related Message Attack on RSA

Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax+b)e mod N for known constants a,b ∈ ℤN, one can usually compute x in O(elog 2e) ℤN-operations (there are O(e2) messages for which the method fails). We show that given e cryptograms ci≡ (aix+bi)e mod N, i...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Yacobi, Oded, Yacobi, Yacov
Format:	Buchkapitel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!