Generalized powering functions and their application to digital signatures

Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Kazuo Takaragi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayness is secure under the factoring assumption. The previously reported encryption schemes using a powering function are variants of either the 4-to-1 mapping or higher n-to-1 mapping, where n > 4. In this paper, we propose an optimized powering function that is a 3-to-1 mapping using a p2q-type modulus. The one-wayness of the proposed powering function is as hard as the infeasibility of the factoring problem. We present an efficient algorithm for computing the decryption for a p 2q-type modulus, which requires neither modular inversion nor division. Moreover, we construct new provably secure digital signatures as an application of the optimized functions. In order to achieve provable security in the random oracle model, we usually randomize a message using random hashing or padding. However, we have to compute the randomization again if the randomized message is a non-cubic residue element - it is inefficient for long messages. We propose an algorithm that can deterministically find the unique cubic residue element for a randomly chosen element.

Original languageEnglish
Pages (from-to)81-89
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE89-A
Issue number1
DOIs
Publication statusPublished - 2006 Jan
Externally publishedYes

Fingerprint

Electronic document identification systems
Digital Signature
Generalized Functions
Cryptography
Factoring
Encryption
Modulus
Provable Security
Modular Functions
Infeasibility
Random Oracle Model
Hashing
Randomisation
Division
Inversion
Efficient Algorithms
Computing

Keywords

  • Digital signature
  • Factoring
  • Modular powering function
  • RSA

ASJC Scopus subject areas

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

Cite this

Generalized powering functions and their application to digital signatures. / Sato, Hisayoshi; Takagi, Tsuyoshi; Tezuka, Satoru; Takaragi, Kazuo.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E89-A, No. 1, 01.2006, p. 81-89.

Research output: Contribution to journalArticle

@article{c11d0955afef4c32a80ef1f6110b9fd1,
title = "Generalized powering functions and their application to digital signatures",
abstract = "This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayness is secure under the factoring assumption. The previously reported encryption schemes using a powering function are variants of either the 4-to-1 mapping or higher n-to-1 mapping, where n > 4. In this paper, we propose an optimized powering function that is a 3-to-1 mapping using a p2q-type modulus. The one-wayness of the proposed powering function is as hard as the infeasibility of the factoring problem. We present an efficient algorithm for computing the decryption for a p 2q-type modulus, which requires neither modular inversion nor division. Moreover, we construct new provably secure digital signatures as an application of the optimized functions. In order to achieve provable security in the random oracle model, we usually randomize a message using random hashing or padding. However, we have to compute the randomization again if the randomized message is a non-cubic residue element - it is inefficient for long messages. We propose an algorithm that can deterministically find the unique cubic residue element for a randomly chosen element.",
keywords = "Digital signature, Factoring, Modular powering function, RSA",
author = "Hisayoshi Sato and Tsuyoshi Takagi and Satoru Tezuka and Kazuo Takaragi",
year = "2006",
month = "1",
doi = "10.1093/ietfec/e89-a.1.81",
language = "English",
volume = "E89-A",
pages = "81--89",
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 - Generalized powering functions and their application to digital signatures

AU - Sato, Hisayoshi

AU - Takagi, Tsuyoshi

AU - Tezuka, Satoru

AU - Takaragi, Kazuo

PY - 2006/1

Y1 - 2006/1

N2 - This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayness is secure under the factoring assumption. The previously reported encryption schemes using a powering function are variants of either the 4-to-1 mapping or higher n-to-1 mapping, where n > 4. In this paper, we propose an optimized powering function that is a 3-to-1 mapping using a p2q-type modulus. The one-wayness of the proposed powering function is as hard as the infeasibility of the factoring problem. We present an efficient algorithm for computing the decryption for a p 2q-type modulus, which requires neither modular inversion nor division. Moreover, we construct new provably secure digital signatures as an application of the optimized functions. In order to achieve provable security in the random oracle model, we usually randomize a message using random hashing or padding. However, we have to compute the randomization again if the randomized message is a non-cubic residue element - it is inefficient for long messages. We propose an algorithm that can deterministically find the unique cubic residue element for a randomly chosen element.

AB - This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayness is secure under the factoring assumption. The previously reported encryption schemes using a powering function are variants of either the 4-to-1 mapping or higher n-to-1 mapping, where n > 4. In this paper, we propose an optimized powering function that is a 3-to-1 mapping using a p2q-type modulus. The one-wayness of the proposed powering function is as hard as the infeasibility of the factoring problem. We present an efficient algorithm for computing the decryption for a p 2q-type modulus, which requires neither modular inversion nor division. Moreover, we construct new provably secure digital signatures as an application of the optimized functions. In order to achieve provable security in the random oracle model, we usually randomize a message using random hashing or padding. However, we have to compute the randomization again if the randomized message is a non-cubic residue element - it is inefficient for long messages. We propose an algorithm that can deterministically find the unique cubic residue element for a randomly chosen element.

KW - Digital signature

KW - Factoring

KW - Modular powering function

KW - RSA

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

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

U2 - 10.1093/ietfec/e89-a.1.81

DO - 10.1093/ietfec/e89-a.1.81

M3 - Article

AN - SCOPUS:32244449208

VL - E89-A

SP - 81

EP - 89

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 -