Fast RSA-type cryptosystem modulo p kq

Tsuyoshi Takagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

121 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAdvances in Cryptology – CRYPTO 1998 - 18th Annual International Cryptology Conference, Proceedings
EditorsHugo Krawczyk
PublisherSpringer Verlag
Pages318-326
Number of pages9
ISBN (Print)3540648925, 9783540648925
DOIs
Publication statusPublished - Jan 1 1998
Event18th Annual International Cryptology Conference, CRYPTO 1998 - Santa Barbara, United States
Duration: Aug 23 1998Aug 27 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1462
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other18th Annual International Cryptology Conference, CRYPTO 1998
CountryUnited States
CitySanta Barbara
Period8/23/988/27/98

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fast RSA-type cryptosystem modulo p <sup>k</sup>q'. Together they form a unique fingerprint.

Cite this