Open Access Open Access  Restricted Access Subscription Access

Signature Schemes with Efficient Online Computation

Fuw-Yi Yang,

Abstract


This paper presents two signature schemes which are specially designed so as to reduce the online computational work for a signer. In many schemes of signature, the signer's major online computational cost is the operation of modular multiplication which consists of an integer multiplication and a reduction. The proposed schemes are arranged to remove the operation of integer multiplication from online signing procedure. The benefit is to reduce the amount of online computations. Theoretically, while sizes of public key and secret key, signature size, and security level remain unchanged, the cost of online computations can be reduced about 14%, comparing with that of Schnorr signature scheme.

Keywords


Digital signature; Discrete logarithm-based signature; Factorization of RSA modulus; RSA-based signature

Citation Format:
Fuw-Yi Yang, "Signature Schemes with Efficient Online Computation," Journal of Internet Technology, vol. 11, no. 4 , pp. 451-456, Jul. 2010.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.




Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314　　E-mail: jit.editorial@gmail.com