Performance evaluation of highly efficient techniques for software implementation of LFSR

Authors:
Oscar Delgado-Mohatar;Amparo Fúster-Sabater;José M. Sierra
Affiliations:
Instituto de Física Aplicada, C.S.I.C, C./Serrano 144, Madrid, Spain;Instituto de Física Aplicada, C.S.I.C, C./Serrano 144, Madrid, Spain;Universidad Carlos III de Madrid, Departamento de Informática, Avda. de la Universidad, 30, Leganés, Madrid, Spain
Venue:
Computers and Electrical Engineering
Year:
2011

Citing 13
Cited 0

On functions of linear shift register sequences

Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Compiler transformations for high-performance computing

ACM Computing Surveys (CSUR)
Tables of maximally equidistributed combined LFSR generators

Mathematics of Computation
On the Security of Nonlinear Filter Generators

Proceedings of the Third International Workshop on Fast Software Encryption
On the m-Parallel Nonlinear Combine Functions for the Parallel Stream Cipher

ICHIT '06 Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02
Stream-Based Implementation of Hash Functions for Multi-Gigabit Message Authentication Codes

PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
LFSR multipliers over GF(2m) defined by all-one polynomial

Integration, the VLSI Journal
New Stream Cipher Designs: The eSTREAM Finalists

New Stream Cipher Designs: The eSTREAM Finalists
An area/performance trade-off analysis of a GF(2m) multiplier architecture for elliptic curve cryptography

Computers and Electrical Engineering
An efficient cryptosystem Delta for stream cipher applications

Computers and Electrical Engineering
Design and analysis of a highly secure stream cipher based on linear feedback shift register

Computers and Electrical Engineering
Modified self-shrinking generator

Computers and Electrical Engineering
Computing the correct Increment of Induction Pointers with application to loop unrolling

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear feedback shift registers (LFSR) are widely used in many different areas. In this paper, we study the operation of LFSR defined over extension fields GF(2^n), instead of traditional binary fields, quantifying and comparing the theoretical with the real performance improvement. We also examine other techniques for efficient implementation, analyzing the effectiveness of both approaches. The experiments show that speedups up to 10.15 can be easily achieved. Surprisingly, data also show that the use of extension fields greater than GF(2^1^6) is not always worth, due to the increasing internal operation costs. The benefits are clear for all possible applications of LFSR, and specifically for cryptographic purposes.