A Fast Signature Scheme with New On-line Computation(<Special Section>Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

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

• 社団法人電子情報通信学会の論文
• 2004-05-01

著者

• Okamoto Eiji

  Institute Of Information Sciences And Electronics University Of Tsukuba

• OKAMOTO Takeshi

  Institute of Information Sciences and Electronics, University of Tsukuba

• KATSUNO Hirofumi

  Department of Information Science, Tokyo Denki University

• Katsuno Hirofumi

  Department Of Information Science Tokyo Denki University

• Okamoto Takeshi

  Institute Of Information Sciences And Electronics University Of Tsukuba

関連論文

• The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem (Applications) (Cryptography and Information Security)
• The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem
• Security of Kuwakado-Tanaka Transitive Signature Scheme for Directed Trees(Information Security)
• A Fast Signature Scheme with New On-line Computation(Discrete Mathematics and Its Applications)

スポンサーリンク