Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,000,553 papers from all fields of science
Search
Sign In
Create Free Account
Wiener's attack
The Wiener's attack, named after cryptologist Michael J. Wiener, is a type of cryptographic attack against RSA. The attack uses the continued…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Alice and Bob
Cryptosystem
Encryption
Euclidean algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Pell's RSA key generation and its security analysis
T. C. Segar
,
R. Vijayaragavan
International Conference on Computing…
2013
Corpus ID: 17846532
In this paper, a new variant of RSA has been proposed whose key generation method is distinct with the standard RSA. Generally…
Expand
2012
2012
An Analysis of the Attack on RSA Cryptosystem Through Formal Methods
Sachin Upadhyay
,
Yashpal Singh
,
Amit Jain
2012
Corpus ID: 212561112
429 Abstract:Communication is the basic process of exchanging information. The effectiveness of computer communication is…
Expand
2009
2009
Digital multisignature on the generalized conic curve over Zn
Song Lin
,
Biao Wang
,
Zhoujun Li
Computers & security
2009
Corpus ID: 41020480
2008
2008
Revisiting Wiener's Attack - New Weak Keys in RSA
S. Maitra
,
Santanu Sarkar
IACR Cryptology ePrint Archive
2008
Corpus ID: 10478519
In this paper we revisit Wiener's method (IEEE-IT, 1990) of continued fraction (CF) to find new weaknesses in RSA. We consider…
Expand
2008
2008
Another Generalization of Wiener's Attack on RSA
Abderrahmane Nitaj
International Conference on Cryptology in Africa
2008
Corpus ID: 18294125
A well-known attack on RSA with low secret-exponent d was given by Wiener in 1990. Wiener showed that using the equation ed - (p…
Expand
2008
2008
A variant of Wiener's attack on RSA with small secret exponent
A. Dujella
ACM Communications in Computer Algebra
2008
Corpus ID: 52807941
To speed up the RSA decryption one may try to use small secret decryption exponent d. The choice of a small d is especially…
Expand
Highly Cited
2008
Highly Cited
2008
Progress in Cryptology - AFRICACRYPT 2008, First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008. Proceedings
S. Vaudenay
International Conference on Cryptology in Africa
2008
Corpus ID: 7094145
AES.- Improving Integral Attacks Against Rijndael-256 Up to 9 Rounds.- Implementation of the AES-128 on Virtex-5 FPGAs.- Analysis…
Expand
Highly Cited
2004
Highly Cited
2004
Continued fractions and RSA with small secret exponent
A. Dujella
ArXiv
2004
Corpus ID: 1475102
Extending the classical Legendre's result, we describe all solutions of the inequality |x - a/b| < c/b^2 in terms of convergents…
Expand
Highly Cited
2000
Highly Cited
2000
Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99
G. Durfee
,
Phong Q. Nguyen
International Conference on the Theory and…
2000
Corpus ID: 16722872
At Asiacrypt '99, Sun, Yang and Laih proposed three RSA variants with short secret exponent that resisted all known attacks…
Expand
1999
1999
Extending Wiener's Attack in the Presence of Many Decrypting Exponents
Nick Howgrave-Graham
,
J. Seifert
International Exhibition and Congress on Network…
1999
Corpus ID: 29283435
Wiener has shown that when the RSA protocol is used with a decrypting exponent, d, which is less than N1/4 and an encrypting…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE