JISE

[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21]

Journal of Information Science and Engineering, Vol. 26 No. 1, pp. 131-143

Transitive Signature Scheme from LFSR

ZHENG GONG¹, ZHENG HUANG², WEIDONG QIU² AND KEFEI CHEN³
¹Distributed and Embedded Security Group
Faculty of EEMCS, University of Twente
PO Box 217, 7500 AE Enschede, Netherlands
E-mail: cis.gong@gmail.com
²School of Information Security Engineering
³Department of Computer Science and Engineering
Shanghai Jiaotong University
Shanghai, 200240 P.R. China
E-mail: {huang-zheng; qiuwd; kfchen}@sjtu.edu.cn

Linear feedback sequence register (LFSR) is a useful cryptographic primitive which is widely implemented in many cryptosystems to represent finite field elements with the counterparts of minimal polynomials. In this paper, an efficient transitive signature scheme from LFSR (LFSR-TS) is considered. First, two derived LFSR sequence operations are designed for LFSR-TS, which are not proposed prior to the current work. Next, the security of LFSR-TS is proven to be existentially unforgeable against the adaptive chosen-message attack in the standard model, which only requires the assumption of the discrete logarithm problem (DLP). Finally, the comparison of performances is presented amongst LFSR-TS and some related schemes.

Keywords: public-key cryptography, linear feedback sequence register, graph authentication, transitive signature, provable security

Retrieve PDF document (JISE_201001_10.pdf)