Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring

Mototsugu Nishioka, Hisayoshi Satoh, Kouichi Sakurai

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

10 Citations (Scopus)

Abstract

We design a provably secure public-key encryption scheme based on modular squaring (Rabin’s public-key encryption scheme [28]) over ZN, where N = pdq (p and q are prime integers, and d > 1), and we show that this scheme is extremely faster than the existing provably secure schemes. Security of our scheme is enhanced by the original OAEP padding scheme [3]. While Boneh presents two padding schemes that are simplified OAEP, and applies them to design provably secure Rabin-based schemes (Rabin-SAEP, Rabin-SAEP+), no previous works explores Rabin-OAEP. We gives the exact argument of security of our OAEP-based scheme. For speeding up our scheme, we develop a new technique of fast decryption, which is a modification of Takagi’s method for RSA-type scheme with N = pdq [31]. Takagi’s method uses Chinese Remainder Theorem (CRT), whereas our decryption requires no CRTlike computation. We also compare our scheme to existing factoringbased schemes including RSA-OAEP, Rabin-SAEP and Rabin-SAEP+. Furthermore, we consider the (future) hardness of the integer-factoring: N = pdq vs. N = pq for large size of N.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings
PublisherSpringer Verlag
Pages81-102
Number of pages22
Volume2288
ISBN (Print)3540433198, 9783540433194
Publication statusPublished - Jan 1 2002
Event4th International Conference on Information Security and Cryptology, ICISC 2001 - Seoul, Korea, Republic of
Duration: Dec 6 2001Dec 7 2001

Publication series

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

Other

Other4th International Conference on Information Security and Cryptology, ICISC 2001
CountryKorea, Republic of
CitySeoul
Period12/6/0112/7/01

Fingerprint

Public-key Cryptosystem
Cryptography
Hardness
Public Key Encryption
Design
Chinese remainder theorem
Integer
Factoring

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Nishioka, M., Satoh, H., & Sakurai, K. (2002). Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring. In Information Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings (Vol. 2288, pp. 81-102). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2288). Springer Verlag.

Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring. / Nishioka, Mototsugu; Satoh, Hisayoshi; Sakurai, Kouichi.

Information Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings. Vol. 2288 Springer Verlag, 2002. p. 81-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2288).

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

Nishioka, M, Satoh, H & Sakurai, K 2002, Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring. in Information Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings. vol. 2288, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2288, Springer Verlag, pp. 81-102, 4th International Conference on Information Security and Cryptology, ICISC 2001, Seoul, Korea, Republic of, 12/6/01.
Nishioka M, Satoh H, Sakurai K. Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring. In Information Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings. Vol. 2288. Springer Verlag. 2002. p. 81-102. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Nishioka, Mototsugu ; Satoh, Hisayoshi ; Sakurai, Kouichi. / Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring. Information Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings. Vol. 2288 Springer Verlag, 2002. pp. 81-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0b53cb6952074109a498fd9fea7d0f01,
title = "Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring",
abstract = "We design a provably secure public-key encryption scheme based on modular squaring (Rabin’s public-key encryption scheme [28]) over ZN, where N = pdq (p and q are prime integers, and d > 1), and we show that this scheme is extremely faster than the existing provably secure schemes. Security of our scheme is enhanced by the original OAEP padding scheme [3]. While Boneh presents two padding schemes that are simplified OAEP, and applies them to design provably secure Rabin-based schemes (Rabin-SAEP, Rabin-SAEP+), no previous works explores Rabin-OAEP. We gives the exact argument of security of our OAEP-based scheme. For speeding up our scheme, we develop a new technique of fast decryption, which is a modification of Takagi’s method for RSA-type scheme with N = pdq [31]. Takagi’s method uses Chinese Remainder Theorem (CRT), whereas our decryption requires no CRTlike computation. We also compare our scheme to existing factoringbased schemes including RSA-OAEP, Rabin-SAEP and Rabin-SAEP+. Furthermore, we consider the (future) hardness of the integer-factoring: N = pdq vs. N = pq for large size of N.",
author = "Mototsugu Nishioka and Hisayoshi Satoh and Kouichi Sakurai",
year = "2002",
month = "1",
day = "1",
language = "English",
isbn = "3540433198",
volume = "2288",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "81--102",
booktitle = "Information Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring

AU - Nishioka, Mototsugu

AU - Satoh, Hisayoshi

AU - Sakurai, Kouichi

PY - 2002/1/1

Y1 - 2002/1/1

N2 - We design a provably secure public-key encryption scheme based on modular squaring (Rabin’s public-key encryption scheme [28]) over ZN, where N = pdq (p and q are prime integers, and d > 1), and we show that this scheme is extremely faster than the existing provably secure schemes. Security of our scheme is enhanced by the original OAEP padding scheme [3]. While Boneh presents two padding schemes that are simplified OAEP, and applies them to design provably secure Rabin-based schemes (Rabin-SAEP, Rabin-SAEP+), no previous works explores Rabin-OAEP. We gives the exact argument of security of our OAEP-based scheme. For speeding up our scheme, we develop a new technique of fast decryption, which is a modification of Takagi’s method for RSA-type scheme with N = pdq [31]. Takagi’s method uses Chinese Remainder Theorem (CRT), whereas our decryption requires no CRTlike computation. We also compare our scheme to existing factoringbased schemes including RSA-OAEP, Rabin-SAEP and Rabin-SAEP+. Furthermore, we consider the (future) hardness of the integer-factoring: N = pdq vs. N = pq for large size of N.

AB - We design a provably secure public-key encryption scheme based on modular squaring (Rabin’s public-key encryption scheme [28]) over ZN, where N = pdq (p and q are prime integers, and d > 1), and we show that this scheme is extremely faster than the existing provably secure schemes. Security of our scheme is enhanced by the original OAEP padding scheme [3]. While Boneh presents two padding schemes that are simplified OAEP, and applies them to design provably secure Rabin-based schemes (Rabin-SAEP, Rabin-SAEP+), no previous works explores Rabin-OAEP. We gives the exact argument of security of our OAEP-based scheme. For speeding up our scheme, we develop a new technique of fast decryption, which is a modification of Takagi’s method for RSA-type scheme with N = pdq [31]. Takagi’s method uses Chinese Remainder Theorem (CRT), whereas our decryption requires no CRTlike computation. We also compare our scheme to existing factoringbased schemes including RSA-OAEP, Rabin-SAEP and Rabin-SAEP+. Furthermore, we consider the (future) hardness of the integer-factoring: N = pdq vs. N = pq for large size of N.

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

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

M3 - Conference contribution

AN - SCOPUS:84949984322

SN - 3540433198

SN - 9783540433194

VL - 2288

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

SP - 81

EP - 102

BT - Information Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings

PB - Springer Verlag

ER -