Dual RSA and its security analysis
We present new variants of an RSA whose key generation algorithms output two distinct
RSA key pairs having the same public and private exponents. This family of variants, called …
RSA key pairs having the same public and private exponents. This family of variants, called …
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
E Jochemsz, A May - Advances in Cryptology-CRYPTO 2007: 27th Annual …, 2007 - Springer
Wiener's famous attack on RSA with d< N 0.25 shows that using a small d for an efficient
decryption process makes RSA completely insecure. As an alternative, Wiener proposed to …
decryption process makes RSA completely insecure. As an alternative, Wiener proposed to …
[PDF][PDF] Enhancing security in cloud computing using public key cryptography with matrices
B Goswani, DS Singh - International Journal of Engineering Research and …, 2012 - Citeseer
Cloud applications increasing demand for led to an ever growing need for security
mechanisms. Cloud computing is a technique to leverage on distributed computing …
mechanisms. Cloud computing is a technique to leverage on distributed computing …
[PDF][PDF] Study on Improvement in RSA Algorithm and its Implementation
P Saveetha, S Arumugam - International Journal of …, 2012 - advancedsourcecode.com
The Network Security means to protect data during their transmission over channel of
networks similarly Internet Security also to protect data during their transmission over a …
networks similarly Internet Security also to protect data during their transmission over a …
Another look at small RSA exponents
MJ Hinek - Cryptographers' Track at the RSA Conference, 2006 - Springer
In this work we consider a variant of RSA whose public and private exponents can be
chosen significantly smaller than in typical RSA. In particular, we show that it is possible to …
chosen significantly smaller than in typical RSA. In particular, we show that it is possible to …
[PDF][PDF] Improvement in rebalanced CRT RSA.
S Verma, D Garg - International Arab Journal of Information Technology …, 2015 - iajit.org
Many improvements have been made since the RSA origin in terms of encryption/decryption
speed and memory saving. This paper concentrates on the performance improvement …
speed and memory saving. This paper concentrates on the performance improvement …
Analysis and comparison of several algorithms in SSL/TLS handshake protocol
L Qing, L Yaping - 2009 international conference on information …, 2009 - ieeexplore.ieee.org
SSL/TLS servers are often overloaded with many simultaneous requests or denial of service
(DoS) attack which will result in degradation of performance. So SSL/TLS servers have to …
(DoS) attack which will result in degradation of performance. So SSL/TLS servers have to …
Efficient doubling on genus 3 curves over binary fields
X Fan, T Wollinger, Y Wang - Topics in Cryptology–CT-RSA 2006: The …, 2006 - Springer
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is
the scalar multiplication by an integer k, ie, computing an integer k times a divisor D on the …
the scalar multiplication by an integer k, ie, computing an integer k times a divisor D on the …
Efficient CRT-RSA decryption for small encryption exponents
Consider CRT-RSA with the parameters p, q, e, dp, dq, where p, q are secret primes, e is the
public encryption exponent and dp, dq are the private decryption exponents. We present an …
public encryption exponent and dp, dq are the private decryption exponents. We present an …
Short-exponent RSA
In some applications, a short private exponent d is chosen to improve the decryption or
signing process for RSA public key cryptosystem. However, in a typical RSA, if the private …
signing process for RSA public key cryptosystem. However, in a typical RSA, if the private …