Tunable Balancing of RSA

We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanced according to the application requirements. Our method is a generalisation of using small public exponents and small Chinese remainder (CRT) private exponents. Our results are most relevant in the case where the cost of private operations must be optimised. We give methods for which the cost of private operations is the same as the previous fastest methods, but where the public operations are significantly faster. For example, the fastest known (1024 bit) RSA decryption is using small CRT private exponents and moduli which are a product of three primes. In this case we equal the fastest known decryption time and also make the encryption time around 4 times faster. The paper gives an analysis of the security of keys generated by our method, and several new attacks. The ingredients of our analysis include se...

• Type: Conference
• Year: 2005
• Where: ACISP
• Authors: Steven D. Galbraith, Chris Heneghan, James F. McKee
• Keywords: ACISP 2005, Private Exponents, Private Operations, Public Operations, Security Privacy