Efficient blind signatures from linear feedback shift register

Authors:
Xiangxue Li;Dong Zheng;Kefei Chen
Affiliations:
School of information Security Engineering, Shanghai JiaoTong University and State Key Laboratory of information Security, institute of Software of Chinese Academy of Sciences, China;Department of Computer Science and Engineering, Shanghai JiaoTong University;Department of Computer Science and Engineering, Shanghai JiaoTong University
Venue:
CDVE'07 Proceedings of the 4th international conference on Cooperative design, visualization, and engineering
Year:
2007

Citing 3
Cited 0

Shift Register Sequences

Shift Register Sequences
A Generalized Birthday Problem

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
New LFSR-based cryptosystems and the trace discrete log problem (Trace-DLP)

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear feedback shift register(LFSR) sequencces can be used to shorten the representation of the elements of a finite field. We employ n-stage LFSR sequence to construct an efficient blind signature scheme where main computation operations are performed in GF(q) and there do not need any exponentiation in its extension field GF(qn).