A Fast RSA-Type Public-Key Primitive Modulo p^kq Using Hensel Lifting (Asymmetric Cipher) (<Special Section>Cryptography and Information Security)

概要

論文の詳細を見る
We propose a public-key primitive modulo p^kq based on the RSA primitive. The decryption process of the proposed scheme is faster than those of two variants of PKCS #1 version 2.1, namely the RSA cryptosystem using Chinese remainder theorem (CRT) and the Multi-Prime RSA. The message M of the proposed scheme is decrypted from M mod pk and M mod q using the CRT, where we apply the Hensel lifting to calculate M mod pk from M mod p that requires only quadratic complexity O((log_2p)^2). Moreover, we propose a trick that avoids modular inversions used for the Hensel lifting, and thus the proposed algorithm can be computed without modular inversion. We implemented in software both the proposed scheme with 1024-bit modulus p^2q and the 1024-bit Multi-Prime RSA for modulus p1p2p3, where p,q,pi,p2,ps are 342 bits. The improvements of the proposed scheme over the Multi-Prime RSA are as follows: The key generation is about 49% faster, the decryption time is about 42% faster, and the total secret key size is 33% smaller.
社団法人電子情報通信学会の論文
2004-01-01