A generalised bound for the Wiener attack on RSA

A generalised bound for the Wiener attack on RSA

Since Wiener pointed out that the RSA can be broken if the private exponent d is relatively small compared to the modulus N, it has been a general belief that the Wiener attack works for d

Saved in:

Bibliographic Details
Main Authors:	SUSILO, Willy, TONIEN, Joseph, YANG, Guomin
Format:	text
Language:	English
Published:	Institutional Knowledge at Singapore Management University 2020
Subjects:	RSA Continued fractions Wiener technique Small secret exponent Databases and Information Systems Information Security
Online Access:	https://ink.library.smu.edu.sg/sis_research/7274 https://ink.library.smu.edu.sg/context/sis_research/article/8277/viewcontent/1_s2.0_S2214212620302301_main.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Singapore Management University
Language:	English

Description
Summary:	Since Wiener pointed out that the RSA can be broken if the private exponent d is relatively small compared to the modulus N, it has been a general belief that the Wiener attack works for d