To Design and Implement Novel Method of Encryption using Modified RSA and Chinese Remainder Theorem
نویسندگان
چکیده
Security can only be as strong as the weakest link. In this world of cryptography, it is now well established, that the weakest link lies in the implementation of cryptographic algorithms. This paper deals with RSA algorithm with and without Chinese Remainder Theorem. In practice, RSA public exponents are chosen to be small which makes encryption and signature verification reasonably fast. Private exponents however should never be small for obvious security reasons. This makes decryption slow. One way to speed things up is to split things up, calculate modulo p and modulo q using Chinese Remainder Theorem. Random numbers are the numbers, which play an important role for various network security applications. In essence, CRT says it is possible to reconstruct integers in a certain range from their residues modulo a set of pair wise relatively prime modulo. National Conference On Research Trends In Electronics, Computer Science & Information Technology And Doctoral Research Meet, Feb 21 st & 22nd NCDRM-2014 Rajiv Gandhi College of Engineering Research & Technology, Chandrapur Page 2
منابع مشابه
Modified RSA Algorithm with CRT & OAEP
The most active subjects in the security related communities are the necessary protection against the data thieves. This gives an importance and the value of exchanged data over the Internet or other media types. In many RSA cryptosystems, we usually select a small value for the public key e. This kind of choice can only speed up the encryption operation but do not forget that by this way, the ...
متن کاملVLSI Design of RSA Cryptosystem Based on the Chinese Remainder Theorem
This paper presents 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 systolic array has 100% utilization because of the proposed block interleaving technique for multiplication and squa...
متن کاملDesign of Rebalanced RSA-CRT for Fast Encryption
Based on the Chinese Remainder Theorem (CRT), Quisquater and Couvreur proposed an RSA variant, RSA-CRT, to speed up RSA decryption. Then, Wiener suggested another RSA variant, Rebalanced RSA-CRT, to further accelerate RSA-CRT decryption by shifting decryption cost to encryption cost. However, such an approach makes RSA encryption very timeconsuming because the public exponent e in Rebalanced RS...
متن کاملOn the Design of Rebalanced RSA-CRT
In 1982, Quisquater & Couvreur proposed a variant of RSA based on the Chinese Remainder Theorem, called RSA-CRT, to speed up RSA decryption. In 1990, Wiener suggested another variant, called Rebalanced RSA-CRT, which further speeds up RSA decryption by shifting decryption costs to encryption costs. However, this approach essentially maximizes the encryption time since the public exponent e in R...
متن کاملAn SPA-Based Extension of Schindler's Timing Attack against RSA Using CRT
At CHES 2000, Schindler introduced a timing attack that enables the factorization of an RSA-modulus if RSA implementations use the Chinese Remainder Theorem and Montgomery multiplication. In this paper we introduce another approach for deriving the secret prime factor by focusing on the conditional branch Schindler used in his attack. One of the countermeasures against Schindler’s attack is the...
متن کامل