Cryptanalytic attack on the self-shrinking sequence generator

  • Authors:
  • Maria Eugenia Pazo-Robles;Amparo Fúster-Sabater

  • Affiliations:
  • Instituto Tecnológico de Buenos Aires, Buenos Aires, Argentina;Institute of Applied Physics, C.S.I.C., Madrid, Spain

  • Venue:
  • ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a cryptanalysis on the Self-Shrinking Generator a well known sequence generator with cryptographic application is presented. An improvement in the Guess-and-Determine cryptanalytic technique has been proposed. Numerical results that improve other cryptanalysis developed on such a generator are given. In particular, complexities in the order of O(20.2L) for the amount of intercepted sequence, O(L2) for computer memory and O(20.5L) for execution time (L being the length of the generator register) are obtained. In addition, a specific hardware for a practical cryptanalysis has been proposed.