A Simple Acceptance/Rejection Criterium for Sequence Generators in Symmetric Cryptography

  • Amparo Fúster-Sabater
  • Pino Caballero-Gil
Conference paper

DOI: 10.1007/11424857_79

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3482)
Cite this paper as:
Fúster-Sabater A., Caballero-Gil P. (2005) A Simple Acceptance/Rejection Criterium for Sequence Generators in Symmetric Cryptography. In: Gervasi O. et al. (eds) Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg

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.

Keywords

Confidentiality stream cipher bit-string algorithm cryptography 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Amparo Fúster-Sabater
    • 1
  • Pino Caballero-Gil
    • 2
  1. 1.Instituto de Física AplicadaC.S.I.C.MadridSpain
  2. 2.DEIOCUniversity of La LagunaLa Laguna, TenerifeSpain

Personalised recommendations