Deterministic analysis of balancedness in symmetric cryptography

Authors:
Candelaria Hernández-Goya;Amparo Fúster-Sabater
Affiliations:
Dept. of Statistics, Operations Research and Computation, University of La Laguna, La Laguna, Tenerife, Spain;Instituto de Física Aplicada, C.S.I.C., Madrid, Spain
Venue:
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Year:
2006

Citing 7
Cited 0

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Introduction to finite fields and their applications

Introduction to finite fields and their applications
The shrinking generator

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Analysis and Synthesis of Logic Systems

Analysis and Synthesis of Logic Systems
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Shift Register Sequences

Shift Register Sequences
On the balancedness of nonlinear generators of binary sequences

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient algorithm to compute the degree of balancedness in LFSR-based sequence generators has been developed. The computation is realized by means of logic operations on bit-strings. Emphasis is on the computational features of this algorithm. The procedure checks deviation of balancedness from standard values for this type of generators with application in symmetric cryptography.