%0 Journal Article
%T Accelerating RSA Encryption Using Random Precalculations
%A Lor¨¢nd Sz£¿ll£¿si
%A Tam¨¢s Marosits
%A G¨¢bor Feh¨¦r
%J International Journal of Network Security
%D 2010
%I Femto Technique
%X RSA encryption and digital signature algorithm is considered secure if keys are 1024-4096 bits long. Since it requires modular exponentiation on numbers of this length, embedded systems need either a cryptographic co-processor or a fast CPU to calculate ciphertexts and signatures. In many applications, the sender is resource-scare, so optimization is necessary. In our paper we show a method for precalculations that accelerates the real-time performance of the sender in the expense of additional calculations at the receiver. When completed, the receiver gets an RSA-equivalent ciphertext for the encryption algorithm.
%K Embedded systems
%K public key cryptography
%K RSA
%U http://ijns.femto.com.tw/download_paper.jsp?PaperID=IJNS-2008-11-13-1&PaperName=ijns-v10-n2/ijns-2010-v10-n2-p157-160.pdf