Balancedness in binary sequences with cryptographic applications

Authors:
Candelaria Hernández-Goya;Amparo Fúster-Sabater
Affiliations:
DEIOC, University of La Laguna, La Laguna, Tenerife, Spain;C.S.I.C. Serrano, Madrid, Spain
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 3
Cited 0

Shift Register Sequences

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

Information Processing Letters
A New Statistical Testing for Symmetric Ciphers and Hash Functions

ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient algorithm to compute the degree of balancedness in sequence generators of cryptographic application has been developed. The computation is realized by means of simple logic operations on bit strings. An MPI-based implementation of such an algorithm is also described. Emphasis is on the computational features of this algorithm concluding that results of cryptographic interest may be obtained within affordable time and memory consumption. The procedure checks deviation of balancedness from standard values for key-stream cryptographic generators in a completely deterministic approach.