Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application

  • Authors:
  • A. Fúster-Sabater;P. Caballero-Gil;O. Delgado-Mohatar

  • Affiliations:
  • Institute of Applied Physics, C.S.I.C., Madrid, Spain 28006;Fac. of Maths, D.E.I.O.C., University of La Laguna, Tenerife, Spain 38271;Institute of Applied Physics, C.S.I.C., Madrid, Spain 28006

  • Venue:
  • ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

An easy method of checking balancedness degree as well as run quantification in sequences obtained from LFSR-based keystream generators has been developed. The procedure is a deterministic alternative to the traditional application of statistical tests. The computation method allows one to check deviation of balancedness and run distribution goodness from standard values. The method here developed can be considered as a first selective criterium for acceptance/rejection of this type of generators of cryptographic application.