A New Efficient Variant of the Batch RSA Cryptosystem

Article Preview

Abstract:

This paper aims at speeding up Batch RSA decryption. The performance of Batch RSA decryption has directs relationship with the efficiency of the full-sized modular exponentiation implementation in the Exponentiation Phase. This paper proposes a variant (BS1PRSA-Batch RSA-S1 Multi-Power RSA) to improve the Batch RSA decryption performance. The experimental results show that the speed of the decryption has been substantially improved.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

2660-2662

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. Rivest, A. Shamir, A Method for Obtaining DigitalSignatures and Public-key Cryptosystems,J. Communications of the ACM, 1978, 21(2): 120-126.

DOI: 10.1145/359340.359342

Google Scholar

[2] A. Fiat, BatchRSA, "C. Procof Crypto , 89, LNCS435, 1989. Berlin: Springer-Verlag, 1989: 175-185.

Google Scholar

[3] D. Boneh,H. Shacham, Fast Variants of RSA,R. RSA Laboratories Cryptobytes, 2002, 5(1): 1-8.

Google Scholar

[4] T. Takagi. Fast RSA-type cryptosystem modulo pkq. In H. Krawczyk, 2007, (06): 63-64.

Google Scholar

[5] T. Matsumoto, K. Kato, Speeding up secret computations with insecure auxiliary device, C. Proc of the 8th Annual International Crypto Conference on Advances in Cryptology. London: Springer-Verlag, (1988).

DOI: 10.1007/0-387-34799-2_35

Google Scholar