New LFSR-based cryptosystems and the trace discrete log problem (Trace-DLP)

Authors:
Kenneth J. Giuliani;Guang Gong
Affiliations:
Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada;Dept. of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada
Venue:
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Year:
2004

Citing 6
Cited 9

An efficient formula for linear recurrences

SIAM Journal on Computing
A public-key cryptosystem based on shift register sequences

Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Cryptanalysis of the Dickson-scheme

Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
The XTR Public Key System

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete Logarithms

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Public-key cryptosystems based on cubic finite field extensions

IEEE Transactions on Information Theory

Double-Exponentiation in Factor-4 Groups and Its Applications

Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Efficient linkable ring signatures and threshold signatures from linear feedback shift register

ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Efficient blind signatures from linear feedback shift register

CDVE'07 Proceedings of the 4th international conference on Cooperative design, visualization, and engineering
Linkable ring signatures from linear feedback shift register

EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Authenticating DSR using a novel multisignature scheme based on cubic LFSR sequences

ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Generating elements of orders dividing p6 ± p5 + p4 ± p3 + p2 + p ± 1

Annales UMCS, Informatica - Cryptography and data protection
A new algorithm to compute remote terms in special types of characteristic sequences

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Index tables of finite fields and modular golomb rulers

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Message transmission for GH-public key cryptosystem

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially equivalent to systems based on characteristic sequences generated by a linear feedback shift register (LFSR). We propose a general class of LFSR-based key agreement and signature schemes based on n-th order characteristic sequences. These schemes have the advantage that they do not require as much bandwidth as their counterparts based on finite fields. In particular, we present a signature scheme based on a new computational problem, the Trace Discrete Logarithm Problem (Trace-DLP). The Trace-DLP and its variants are discussed and their relationship with well-known finite field-based computational problems is examined. In addition, we prove the equivalence between several LFSR-based computational problems and their finite field-based counterparts.