Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

5 relations
Alice and BobCryptosystemEncryptionEuclidean algorithm
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Key generation and security analysis of text cryptography using cubic power of Pell's equation
Security is major aspect when information is shared in a communication era. To keep the information secure various algorithm are… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Highly Cited
2013
Highly Cited
2013
Pell's RSA key generation and its security analysis
In this paper, a new variant of RSA has been proposed whose key generation method is distinct with the standard RSA. Generally… Expand
  • figure 1
  • table I
  • table III
  • table II
2012
2012
An Analysis of the Attack on RSA Cryptosystem Through Formal Methods
429  Abstract:Communication is the basic process of exchanging information. The effectiveness of computer communication is… Expand
2008
2008
Revisiting Wiener's Attack - New Weak Keys in RSA
In this paper we revisit Wiener's method (IEEE-IT, 1990) of continued fraction (CF) to find new weaknesses in RSA. We consider… Expand
  • figure 1
2008
2008
Another Generalization of Wiener's Attack on RSA
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
  • table 2
2008
2008
A variant of Wiener's attack on RSA with small secret exponent
  • A. Dujella
  • ACM Commun. Comput. 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
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
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
At Asiacrypt '99, Sun, Yang and Laih proposed three RSA variants with short secret exponent that resisted all known attacks… Expand
  • figure 1
  • figure 2
1999
1999
Extending Wiener's Attack in the Presence of Many Decrypting Exponents
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
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE