Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

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

2012

2012

429 Abstract:Communication is the basic process of exchanging information. The effectiveness of computer communication is… Expand

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

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

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

Highly Cited

2008

Highly Cited

2008

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

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

At Asiacrypt '99, Sun, Yang and Laih proposed three RSA variants with short secret exponent that resisted all known attacks… Expand

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