A Generalized Takagi-Cryptosystem with a modulus of the form prqs

In this paper, we propose a generalized Takagi-Cryptosystem with a modulus of the form pr qs. We've studied for the optimal choice for r, s that gives the best efficiency while maintaining a prescribed security level, and we show that the choice of either pr qr+1, pr-1 qr+1, or pr-2qr+2 depending on the value r + s is the optimal. We also present comparison tables for the efficiency of RSA, the multiprime technology, Takagi's scheme, and our proposed scheme.

[1]  Tsuyoshi Takagi,et al.  Fast RSA-Type Cryptosystem Modulo pkq , 1998, CRYPTO.

[2]  Arjen K. Lenstra,et al.  Selecting Cryptographic Key Sizes , 2000, Journal of Cryptology.

[3]  Tsuyoshi Takagi,et al.  Fast RSA-Type Cryptosystems Using N-Adic Expansion , 1997, CRYPTO.

[4]  Arjen K. Lenstra,et al.  Algorithms in Number Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  Dan Boneh,et al.  Factoring N = prq for Large r , 1999, CRYPTO.