Results 1  10
of
11
On the design of RSA with short secret exponent
 Proc. of Asiacrypt ’99, LNCS
, 1999
"... Based on continued fractions Wiener showed that a typical RSA system can be to ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Based on continued fractions Wiener showed that a typical RSA system can be to
Evaluation Report on the Factoring Problem
 Society International Conference, September N., (1981C).  23rd IEEE
, 2001
"... This document is an evaluation of the factoring problem, as a basis for designing cryptographic schemes. It relies on the analysis of numerous research papers on the subject. The present report is organized as follows: firstly, we review the factoring problem ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This document is an evaluation of the factoring problem, as a basis for designing cryptographic schemes. It relies on the analysis of numerous research papers on the subject. The present report is organized as follows: firstly, we review the factoring problem
An effective Method for Attack RSA Strategy
"... The protection on many public key encoding schemes depended on the intractability of detecting the integer factoring problem such as RSA scheme. However, there are great deals of researches regarding the RSA factoring modulus compared with the other type of attack the RSA scheme. So the need for mor ..."
Abstract
 Add to MetaCart
(Show Context)
The protection on many public key encoding schemes depended on the intractability of detecting the integer factoring problem such as RSA scheme. However, there are great deals of researches regarding the RSA factoring modulus compared with the other type of attack the RSA scheme. So the need for more methods of attacks other than RSA factoring modulus to find an effective and quicker algorithm to solve this problem is still crucial. This paper introduces a new algorithmic program which approaches the RSA scheme. The suggested algorithm aims to find the private key of the RSA scheme and then factoring the modulus based on the public key of the RSA scheme. The new idea exacted to be more efficient than the already existed algorithms particularly when the public key is small, since most of public key encryption schemes select a small public encryption key e in order to improve the efficiency of encryption. Also, the suggested algorithmic program is more effective since it is faster and takes less running time.
CrypTool Number Field Sieve Extensions
"... CrypTool [9] is educational software that aims to assist in learning about cryptography. CrypTool provides tools for performing encryption, decryption, generating message authentication codes (MACs), digital signatures, and many other ..."
Abstract
 Add to MetaCart
CrypTool [9] is educational software that aims to assist in learning about cryptography. CrypTool provides tools for performing encryption, decryption, generating message authentication codes (MACs), digital signatures, and many other
AmmanJordan
"... The security on many public key encryption schemes relied on the intractability of finding the integer factoring problem such as RSA scheme. However, there are great deals of researches related to the RSA factoring modulus compared with the other type of attacks RSA scheme. So the need for more meth ..."
Abstract
 Add to MetaCart
(Show Context)
The security on many public key encryption schemes relied on the intractability of finding the integer factoring problem such as RSA scheme. However, there are great deals of researches related to the RSA factoring modulus compared with the other type of attacks RSA scheme. So the need for more methods of attacks other than RSA factoring modulus to obtain an efficient and faster algorithm to solve this problem is still essential. This paper introduces a new algorithm which attacks the RSA scheme. The suggested algorithm aims to obtain the private key of the RSA scheme and then factoring the modulus based on the public key e of the RSA scheme. The new idea claimed to be more efficient than the already existed algorithms especially when the public key e is small, since most of public key encryption schemes select a small encryption exponent e in order to improve the efficiency of encryption. The suggested algorithm is claim to be more efficient than the already existed algorithms of attack since it is faster and takes less running time.
unknown title
, 2002
"... This Master’s thesis is on cryptography, the art of secret writing. It was ..."
Abstract
 Add to MetaCart
This Master’s thesis is on cryptography, the art of secret writing. It was
GNFS Factoring Statistics
, 2004
"... GNFS (general number field sieve) algorithm is currently the fastest known algorithm for factoring large integers. Up to the present, several running time ..."
Abstract
 Add to MetaCart
GNFS (general number field sieve) algorithm is currently the fastest known algorithm for factoring large integers. Up to the present, several running time
ALIQUOT SEQUENCE 3630 ENDS AFTER REACHING 100 DIGITS
"... Abstract. In this paper we present a new computational record: the aliquot sequence starting at 3630 converges to 1 after reaching a hundred decimal digits. Also, we show the current status of all the aliquot sequences starting with a number under 10000; we have reached at leat 95 digits for all of ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper we present a new computational record: the aliquot sequence starting at 3630 converges to 1 after reaching a hundred decimal digits. Also, we show the current status of all the aliquot sequences starting with a number under 10000; we have reached at leat 95 digits for all of them. In particular, we have reached at least 112 digits for the socalled “Lehmer five sequences”, and 101 digits for the “Godwin twelve sequences”. Finally, we give a summary showing the number of aliquot sequences of unknown end starting with a number ≤ 106. 1.