A simple acceptance/rejection criterium for sequence generators in symmetric cryptography

Authors:
Amparo Fúster-Sabater;Pino Caballero-Gil
Affiliations:
Instituto de Física Aplicada, C.S.I.C., Madrid, Spain;DEIOC, University of La Laguna, La Laguna, Tenerife, Spain
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Year:
2005

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
Contemporary Cryptology: The Science of Information Integrity

Contemporary Cryptology: The Science of Information Integrity
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple method of checking the degree of balancedness in key-stream generators of cryptographic application has been developed. The procedure is based exclusively on the handling of bit-strings by means of logic operations and can be applied to standard generators proposed and published in the open literature (combinational generators, multiple clocking generators, irregularly clocked generators). The requirements of time and memory complexity are negligible. The method here developed is believed to be a first selective criterium for acceptance/rejection of this type of generators with application in symmetric cryptography.