Multi-Prime (MP)RSA is an RSA construction in which the public modulus is a product of more than two primes, and its private key operations can be accelerated by using the Chinese Reminder Theorem (CRT). While MPRSA has been studied extensively, only limited information is found for other MP constructions, such as Paillier cryptosystem. This paper shows how to extend the security proofs for Quadratic Residue Problem (QRP), Higher Residuosity Problem (HRP) and Decisional Composite Residuosity Problem (DCRP), formulated for a two-primes modulus, to a MP setting. For the Paillier cryptosystem, we demonstrate how this technique can speed up decryption by more than 17x.
|Title of host publication||CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||7|
|State||Published - 16 Mar 2018|
|Event||15th IEEE Annual Consumer Communications and Networking Conference, CCNC 2018 - Las Vegas, United States|
Duration: 12 Jan 2018 → 15 Jan 2018
|Conference||15th IEEE Annual Consumer Communications and Networking Conference, CCNC 2018|
|Period||12/01/18 → 15/01/18|
Bibliographical noteFunding Information:
This research was supported by the ISRAEL SCIENCE FOUNDATION (grant No. 1018/16), and by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office.
© 2018 IEEE.
ASJC Scopus subject areas
- Computer Networks and Communications
- Signal Processing
- Media Technology