@inproceedings{f46ce084a9c34290a1ab82f5e19adae4,
title = "Fast RSA-type cryptosystem modulo p kq",
abstract = "We propose a cryptosystem modulo pkq based on the RSA cryptosystem. We choose an appropriate modulus pkq which resists two of the fastest factoring algorithms, namely the number field sieve and the elliptic curve method. We also apply the fast decryption algorithm modulo pk proposed in [22]. The decryption process of the proposed cryptosystems is faster than the RSA cryptosystem using Chinese remainder theorem, known as the Quisquater-Couvreur method [17]. For example, if we choose the 768-bit modulus p2q for 256-bit primes p and q, then the decryption process of the proposed cryptosystem is about 3 times faster than that of RSA cryptosystem using Quisquater-Couvreur method.",
author = "Tsuyoshi Takagi",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 18th Annual International Cryptology Conference, CRYPTO 1998 ; Conference date: 23-08-1998 Through 27-08-1998",
year = "1998",
doi = "10.1007/BFb0055738",
language = "English",
isbn = "3540648925",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "318--326",
editor = "Hugo Krawczyk",
booktitle = "Advances in Cryptology – CRYPTO 1998 - 18th Annual International Cryptology Conference, Proceedings",
address = "Germany",
}