A Fast Signature Scheme with New On-line Computation

Takeshi OKAMOTO; Hirofumi KATSUNO; Eiji OKAMOTO

A Fast Signature Scheme with New On-line Computation

Takeshi OKAMOTO, Hirofumi KATSUNO, Eiji OKAMOTO

Full Text Views

0

Share
Cite this

Summary :

In this paper, we propose a fast signature scheme which realizes short transmissions and minimal on-line computation. Our scheme requires a modular exponentiation as preprocessing (i.e., off-line computation). However, we need to acknowledge the existance of the following remarkable properties: neither multiplication nor modular reduction is used in the actual signature generation (i.e., on-line computation). Our scheme requires only two operations: hashing and addition. Although some fast signature schemes with small on-line computation have been proposed so far, those schemes require multiplication or modular reduction in the on-line phase. This leads to a large amount of work compared to that of addition. As far as we know, this is the first approach to obtain the fast signature without those two calculus methods.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.5 pp.1154-1161

Publication Date: 2004/05/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Takeshi OKAMOTO, Hirofumi KATSUNO, Eiji OKAMOTO, "A Fast Signature Scheme with New On-line Computation" in IEICE TRANSACTIONS on Fundamentals, vol. E87-A, no. 5, pp. 1154-1161, May 2004, doi: .
Abstract: In this paper, we propose a fast signature scheme which realizes short transmissions and minimal on-line computation. Our scheme requires a modular exponentiation as preprocessing (i.e., off-line computation). However, we need to acknowledge the existance of the following remarkable properties: neither multiplication nor modular reduction is used in the actual signature generation (i.e., on-line computation). Our scheme requires only two operations: hashing and addition. Although some fast signature schemes with small on-line computation have been proposed so far, those schemes require multiplication or modular reduction in the on-line phase. This leads to a large amount of work compared to that of addition. As far as we know, this is the first approach to obtain the fast signature without those two calculus methods.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e87-a_5_1154/_p

Copy

@ARTICLE{e87-a_5_1154,
author={Takeshi OKAMOTO, Hirofumi KATSUNO, Eiji OKAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Fast Signature Scheme with New On-line Computation},
year={2004},
volume={E87-A},
number={5},
pages={1154-1161},
abstract={In this paper, we propose a fast signature scheme which realizes short transmissions and minimal on-line computation. Our scheme requires a modular exponentiation as preprocessing (i.e., off-line computation). However, we need to acknowledge the existance of the following remarkable properties: neither multiplication nor modular reduction is used in the actual signature generation (i.e., on-line computation). Our scheme requires only two operations: hashing and addition. Although some fast signature schemes with small on-line computation have been proposed so far, those schemes require multiplication or modular reduction in the on-line phase. This leads to a large amount of work compared to that of addition. As far as we know, this is the first approach to obtain the fast signature without those two calculus methods.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - A Fast Signature Scheme with New On-line Computation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1154
EP - 1161
AU - Takeshi OKAMOTO
AU - Hirofumi KATSUNO
AU - Eiji OKAMOTO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2004
AB - In this paper, we propose a fast signature scheme which realizes short transmissions and minimal on-line computation. Our scheme requires a modular exponentiation as preprocessing (i.e., off-line computation). However, we need to acknowledge the existance of the following remarkable properties: neither multiplication nor modular reduction is used in the actual signature generation (i.e., on-line computation). Our scheme requires only two operations: hashing and addition. Although some fast signature schemes with small on-line computation have been proposed so far, those schemes require multiplication or modular reduction in the on-line phase. This leads to a large amount of work compared to that of addition. As far as we know, this is the first approach to obtain the fast signature without those two calculus methods.
ER -