A new algorithm for cryptanalysis of filtered LFSRs: the "probability-matching" algorithm

  • Sabine Leveiller
  • Published 2004 in
    International Symposium onInformation Theory…
We present a new algorithm for crypt-analysis of filtered LFSRs that exploits an unusual property of Boolean functions. The overall idea is to try and match a theoretical probability distribution that has constant relationships on its preimage, thereby inferring the secret key.