The Wiener's attack, named after cryptologist Michael J. Wiener, is a type of cryptographic attack against RSA. The attack uses the continuedâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- K. R. Raghunandan, Rashmitha Shetty, Ganesh Aithal
- 2017 International Conference on Intelligentâ€¦
- 2017

Security is major aspect when information is shared in a communication era. To keep the information secure various algorithm areâ€¦Â (More)

Is this relevant?

2013

2013

- T. Chandra Segar, Rangasamy Vijayaragavan
- 2013 Fourth International Conference on Computingâ€¦
- 2013

In this paper, a new variant of RSA has been proposed whose key generation method is distinct with the standard RSA. Generallyâ€¦Â (More)

Is this relevant?

2010

2010

- Justin Jose, Siddharth Raina, +16 authors Craig Putnam
- 2010

The paper discusses encryption schemes such as public key algorithms (RSA) and One Time Pads. It also discusses various attacksâ€¦Â (More)

Is this relevant?

2010

2010

- Navaneet Ojha, Sahadeo Padhye
- 2010 International Conference on Computer andâ€¦
- 2010

In this paper we improve the range of weak keys of RSA cryptosystem for the Generalized Wiener's attack given by Blomer & May. Weâ€¦Â (More)

Is this relevant?

2008

2008

- Subhamoy Maitra, Santanu Sarkar
- ISC
- 2008

In this paper we revisit Wienerâ€™s method (IEEE-IT 1990) of continued fraction (CF) to find new weaknesses in RSA. We consider RSAâ€¦Â (More)

Is this relevant?

2008

2008

- Abderrahmane Nitaj
- AFRICACRYPT
- 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â€¦Â (More)

Is this relevant?

2008

2008

- Andrej Dujella
- ACM Comm. Computer Algebra
- 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â€¦Â (More)

Is this relevant?

2008

2008

- Andrej Dujella
- Computing
- 2008

Wienerâ€™s attack is a well-known polynomial-time attack on a RSA cryptosystem with small secret decryption exponent d, which worksâ€¦Â (More)

Is this relevant?

2004

2004

- Johannes BlÃ¶mer, Alexander May
- Public Key Cryptography
- 2004

We present an extension of Wienerâ€™s attack on small RSA secret decryption exponents [10]. Wiener showed that every RSA public keyâ€¦Â (More)

Is this relevant?

1999