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
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
id sg-smu-ink.sis_research-8277
record_format dspace
spelling sg-smu-ink.sis_research-82772022-09-22T07:30:24Z A generalised bound for the Wiener attack on RSA SUSILO, Willy TONIEN, Joseph YANG, Guomin 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 2020-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7274 info:doi/10.1016/j.jisa.2020.102531 https://ink.library.smu.edu.sg/context/sis_research/article/8277/viewcontent/1_s2.0_S2214212620302301_main.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University RSA Continued fractions Wiener technique Small secret exponent Databases and Information Systems Information Security
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic RSA
Continued fractions
Wiener technique
Small secret exponent
Databases and Information Systems
Information Security
spellingShingle RSA
Continued fractions
Wiener technique
Small secret exponent
Databases and Information Systems
Information Security
SUSILO, Willy
TONIEN, Joseph
YANG, Guomin
A generalised bound for the Wiener attack on RSA
description 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
format text
author SUSILO, Willy
TONIEN, Joseph
YANG, Guomin
author_facet SUSILO, Willy
TONIEN, Joseph
YANG, Guomin
author_sort SUSILO, Willy
title A generalised bound for the Wiener attack on RSA
title_short A generalised bound for the Wiener attack on RSA
title_full A generalised bound for the Wiener attack on RSA
title_fullStr A generalised bound for the Wiener attack on RSA
title_full_unstemmed A generalised bound for the Wiener attack on RSA
title_sort generalised bound for the wiener attack on rsa
publisher Institutional Knowledge at Singapore Management University
publishDate 2020
url 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
_version_ 1770576296356610048