Results 11  20
of
9,829
Moduli for Testing Implementations of the RSA Cryptosystem
 in IEEE 14th Symposium on Computer Arithmetic
, 1999
"... Comprehensive testing of any implementation of the RSA cryptosystem requires the use of a number of moduli with specific properties. It is shown how to generate a sufficient variety of these to enable testing which will justify high confidence in the correctness of both the design and the operation ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Comprehensive testing of any implementation of the RSA cryptosystem requires the use of a number of moduli with specific properties. It is shown how to generate a sufficient variety of these to enable testing which will justify high confidence in the correctness of both the design and the operation
1 Lattices and their Applications to RSA Cryptosystem.
"... The purpose of this diploma thesis is the study both of the mathematical background on lattice theory and of the corresponding applications to the RSA Cryptosystem. In bibliography, there are two quite different mathematical structures that are usually called lattices. The first one has to do with p ..."
Abstract
 Add to MetaCart
The purpose of this diploma thesis is the study both of the mathematical background on lattice theory and of the corresponding applications to the RSA Cryptosystem. In bibliography, there are two quite different mathematical structures that are usually called lattices. The first one has to do
A Modified RSA Cryptosystems and Analysis
"... Abstract — As the growth of the Internet and electronic commerce have brought to the forefront the issue of privacy in electronic communication. Large volumes of personal and sensitive information are electronically transmitted every day. In this paper we present modified RSA algorithm and analysis ..."
Abstract
 Add to MetaCart
for secure data transmission. The security of RSA public key cryptosystem is based on the assumption that factoring of a large number (modulus) is difficult. In RSA if one can factor modulus into its prime numbers then the private key is also detected and hence the security of the cryptosystem is broken
Serious Security Weakness in RSA Cryptosystem
"... Nowadays, RSA is the wellknown cryptosystem which supports most of electronic commercial communications. RSA is working on the base of multiplication of two prime numbers. Currently different kinds of attacks have indentified against RSA by cryptanalysis. This paper has shown that regardless to the ..."
Abstract
 Add to MetaCart
Nowadays, RSA is the wellknown cryptosystem which supports most of electronic commercial communications. RSA is working on the base of multiplication of two prime numbers. Currently different kinds of attacks have indentified against RSA by cryptanalysis. This paper has shown that regardless
Architectural Analysis of RSA Cryptosystem on FPGA
"... This paper presents different architectures in FPGA based implementations of a public key crypto algorithm RSA algorithm. A hardwarebased cryptographic system is preferred as it provides better security, integrity and is resistant to power analysis attacks [1]. After the complete cryptosystem is ..."
Abstract
 Add to MetaCart
This paper presents different architectures in FPGA based implementations of a public key crypto algorithm RSA algorithm. A hardwarebased cryptographic system is preferred as it provides better security, integrity and is resistant to power analysis attacks [1]. After the complete cryptosystem
REMARKS CONCERNING RSACRYPTOSYSTEM EXPONENTS
"... ABSTRACT. Two problems associated with RSAencryption exponents are discussed. Firstly, how many plaintexts are to be read by the Simmons and Norris attack for given exponent and modulus. Secondly, what is the number of exponents belonging to a possible kattack for given k and modulus. The goal i ..."
Abstract
 Add to MetaCart
ABSTRACT. Two problems associated with RSAencryption exponents are discussed. Firstly, how many plaintexts are to be read by the Simmons and Norris attack for given exponent and modulus. Secondly, what is the number of exponents belonging to a possible kattack for given k and modulus. The goal
Attacks on the RSA Cryptosystem and Some of Its Instances
"... Two types of attacking the RSA cryptosystem are discussed. The first aims at a careless choice of the primes p and q, which are the basis of RSA security. Choosing these primes carefully can prevent the cryptosystem from this type of attack. The second aims at special instances of RSAbased cryptogr ..."
Abstract
 Add to MetaCart
Two types of attacking the RSA cryptosystem are discussed. The first aims at a careless choice of the primes p and q, which are the basis of RSA security. Choosing these primes carefully can prevent the cryptosystem from this type of attack. The second aims at special instances of RSA
© Science Publications 2006 Mathematical Attacks on RSA Cryptosystem
"... Abstract: In this paper some of the most common attacks against Rivest, Shamir, and Adleman (RSA) cryptosystem are presented. We describe the integer factoring attacks, attacks on the underlying mathematical function, as well as attacks that exploit details in implementations of the algorithm. Algor ..."
Abstract
 Add to MetaCart
Abstract: In this paper some of the most common attacks against Rivest, Shamir, and Adleman (RSA) cryptosystem are presented. We describe the integer factoring attacks, attacks on the underlying mathematical function, as well as attacks that exploit details in implementations of the algorithm
An Efficient Variant of RSA Cryptosystem with Semantic Security
, 2005
"... An e#cient variant of RSA cryptosystem was proposed by Cesar [2]. He called it Rprime RSA. The Rprime RSA is a combination of Mprime RSA [3] and Rebalanced RSA [9, 1]. Although the decryption speed of Rprime RSA is 27 times faster than the standard RSA and 8 times faster than the QC RSA [6] in t ..."
Abstract
 Add to MetaCart
An e#cient variant of RSA cryptosystem was proposed by Cesar [2]. He called it Rprime RSA. The Rprime RSA is a combination of Mprime RSA [3] and Rebalanced RSA [9, 1]. Although the decryption speed of Rprime RSA is 27 times faster than the standard RSA and 8 times faster than the QC RSA [6
RSA cryptosystem design based on the chinese remainder theorem
 in Proceedings of the ASPDAC’01
, 2001
"... Abstract—In this paper, we present the design and implementation of a systolic RSA cryptosystem based on a modified Montgomery’s algorithm and the Chinese Remainder Theorem (CRT) technique. The CRT technique improves the throughput rate up to 4 times in the best case. The processing unit of the syst ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Abstract—In this paper, we present the design and implementation of a systolic RSA cryptosystem based on a modified Montgomery’s algorithm and the Chinese Remainder Theorem (CRT) technique. The CRT technique improves the throughput rate up to 4 times in the best case. The processing unit
Results 11  20
of
9,829