A Fast RSA-Type Public-Key Primitive Modulo pkq Using Hensel Lifting

Tsuyoshi Takagi

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

We propose a public-key primitive modulo pkq 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((log2 p)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 p2g and the 1024-bit Multi-Prime RSA for modulus p 1p2p3, where p, q, p1, p 2, p3 are 342bits. 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.

Original languageEnglish
Pages (from-to)94-101
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE87-A
Issue number1
Publication statusPublished - Jan 1 2004

Fingerprint

Public key
Modulo
Chinese remainder theorem
Cryptography
Inversion
Modulus
RSA Cryptosystem
Calculate
Software

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

A Fast RSA-Type Public-Key Primitive Modulo pkq Using Hensel Lifting. / Takagi, Tsuyoshi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E87-A, No. 1, 01.01.2004, p. 94-101.

Research output: Contribution to journalArticle

@article{51a750cba53e4404b2545298b340ceea,
title = "A Fast RSA-Type Public-Key Primitive Modulo pkq Using Hensel Lifting",
abstract = "We propose a public-key primitive modulo pkq 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((log2 p)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 p2g and the 1024-bit Multi-Prime RSA for modulus p 1p2p3, where p, q, p1, p 2, p3 are 342bits. 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.",
author = "Tsuyoshi Takagi",
year = "2004",
month = "1",
day = "1",
language = "English",
volume = "E87-A",
pages = "94--101",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "1",

}

TY - JOUR

T1 - A Fast RSA-Type Public-Key Primitive Modulo pkq Using Hensel Lifting

AU - Takagi, Tsuyoshi

PY - 2004/1/1

Y1 - 2004/1/1

N2 - We propose a public-key primitive modulo pkq 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((log2 p)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 p2g and the 1024-bit Multi-Prime RSA for modulus p 1p2p3, where p, q, p1, p 2, p3 are 342bits. 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.

AB - We propose a public-key primitive modulo pkq 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((log2 p)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 p2g and the 1024-bit Multi-Prime RSA for modulus p 1p2p3, where p, q, p1, p 2, p3 are 342bits. 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.

UR - http://www.scopus.com/inward/record.url?scp=0842267122&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0842267122&partnerID=8YFLogxK

M3 - Article

VL - E87-A

SP - 94

EP - 101

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 1

ER -