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

Authors:
Seongan Lim;Seungjoo Kim;Ikkwon Yie;Hongsub Lee
Affiliations:
-;-;-;-
Venue:
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Year:
2000

Citing 4
Cited 1

Algorithms in number theory

Handbook of theoretical computer science (vol. A)
Factoring N = prq for Large r

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Fast RSA-Type Cryptosystems Using N-Adic Expansion

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Fast RSA-Type Cryptosystem Modulo pkq

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology

Cryptanalysis of multi-prime RSA with small prime difference

ICICS'12 Proceedings of the 14th international conference on Information and Communications Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.