Design and implementation of an improved RSA algorithm
2010pp. 390–393
Citations Over TimeTop 10% of 2010 papers
Abstract
This paper aims at speeding up RSA decryption and signature. The performance of RSA decryption and signature has direct relationship with the efficiency of modular exponentiation implementation. This paper proposes a variant of RSA cryptosystem (EAMRSA-Encrypt Assistant Multi- Prime RSA) by reducing modules and private exponents in modular exponentiation. The experimental result shows that the speed of the decryption and signature has been substantially improved and the variant can be efficiently implemented in parallel.
Related Papers
- → High-radix and bit recoding techniques for modular exponentiation(1991)25 cited
- → Algorithms for multi-exponentiation based on complex arithmetic(2002)6 cited
- → Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers(2015)5 cited
- → High-speed algorithms for public-key cryptosystems(2005)1 cited
- Efficient Modular Exponentiation Using Common-Multiplicand Multiplication and Signed-Digit Recoding Techniques(2007)