FACTORING VIA SUPERENCYRPTION

It is shown that a Simmons and Norris cycling attack against an RSA public key cryptosystem can be modified to search for factors of the modulus of the system. The cycling can be accomplished by superencyrption or by repeated applications of a function chosen by the cryptanalyst. Finally, the safest...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cryptologia 1982-07, Vol.6 (3), p.229-237
1. Verfasser: BERKOVITS, SHIMSHON
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:It is shown that a Simmons and Norris cycling attack against an RSA public key cryptosystem can be modified to search for factors of the modulus of the system. The cycling can be accomplished by superencyrption or by repeated applications of a function chosen by the cryptanalyst. Finally, the safest choice of system parameters is discussed.
ISSN:0161-1194
1558-1586
DOI:10.1080/0161-118291857028