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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
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
Is this relevant?
Highly Cited
2013
Highly Cited
2013
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
Is this relevant?
2012
2012
429  Abstract:Communication is the basic process of exchanging information. The effectiveness of computer communication is… Expand
Is this relevant?
2008
2008
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
Is this relevant?
2008
2008
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
Is this relevant?
2008
2008
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
Is this relevant?
2008
2008
AES.- Improving Integral Attacks Against Rijndael-256 Up to 9 Rounds.- Implementation of the AES-128 on Virtex-5 FPGAs.- Analysis… Expand
Is this relevant?
2004
2004
Extending the classical Legendre's result, we describe all solutions of the inequality |x - a/b| < c/b^2 in terms of convergents… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
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
Is this relevant?
1999
1999
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
Is this relevant?