Fast RSA-type cryptosystem modulo p kq

Tsuyoshi Takagi

研究成果: 著書/レポートタイプへの貢献会議での発言

114 引用 (Scopus)

抄録

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.

元の言語英語
ホスト出版物のタイトルAdvances in Cryptology – CRYPTO 1998 - 18th Annual International Cryptology Conference, Proceedings
編集者Hugo Krawczyk
出版者Springer Verlag
ページ318-326
ページ数9
ISBN(印刷物)3540648925, 9783540648925
DOI
出版物ステータス出版済み - 1 1 1998
イベント18th Annual International Cryptology Conference, CRYPTO 1998 - Santa Barbara, 米国
継続期間: 8 23 19988 27 1998

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1462
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他18th Annual International Cryptology Conference, CRYPTO 1998
米国
Santa Barbara
期間8/23/988/27/98

Fingerprint

RSA Cryptosystem
Cryptosystem
Cryptography
Modulo
Modulus
Choose
Number Field Sieve
Chinese remainder theorem
Factoring
Resist
Elliptic Curves
Fast Algorithm
Sieves

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Takagi, T. (1998). Fast RSA-type cryptosystem modulo p kq. : H. Krawczyk (版), Advances in Cryptology – CRYPTO 1998 - 18th Annual International Cryptology Conference, Proceedings (pp. 318-326). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 1462). Springer Verlag. https://doi.org/10.1007/BFb0055738

Fast RSA-type cryptosystem modulo p kq. / Takagi, Tsuyoshi.

Advances in Cryptology – CRYPTO 1998 - 18th Annual International Cryptology Conference, Proceedings. 版 / Hugo Krawczyk. Springer Verlag, 1998. p. 318-326 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 1462).

研究成果: 著書/レポートタイプへの貢献会議での発言

Takagi, T 1998, Fast RSA-type cryptosystem modulo p kq. : H Krawczyk (版), Advances in Cryptology – CRYPTO 1998 - 18th Annual International Cryptology Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 1462, Springer Verlag, pp. 318-326, 18th Annual International Cryptology Conference, CRYPTO 1998, Santa Barbara, 米国, 8/23/98. https://doi.org/10.1007/BFb0055738
Takagi T. Fast RSA-type cryptosystem modulo p kq. : Krawczyk H, 編集者, Advances in Cryptology – CRYPTO 1998 - 18th Annual International Cryptology Conference, Proceedings. Springer Verlag. 1998. p. 318-326. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0055738
Takagi, Tsuyoshi. / Fast RSA-type cryptosystem modulo p kq. Advances in Cryptology – CRYPTO 1998 - 18th Annual International Cryptology Conference, Proceedings. 編集者 / Hugo Krawczyk. Springer Verlag, 1998. pp. 318-326 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
year = "1998",
month = "1",
day = "1",
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",

}

TY - GEN

T1 - Fast RSA-type cryptosystem modulo p kq

AU - Takagi, Tsuyoshi

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/BFb0055738

DO - 10.1007/BFb0055738

M3 - Conference contribution

AN - SCOPUS:84957625495

SN - 3540648925

SN - 9783540648925

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 318

EP - 326

BT - Advances in Cryptology – CRYPTO 1998 - 18th Annual International Cryptology Conference, Proceedings

A2 - Krawczyk, Hugo

PB - Springer Verlag

ER -