### Abstract

We present a new cryptanalytic attack on PN-generators filtered by a Boolean function. The key-idea is to jointly combine the knowledge of the Boolean function and the LFSR structure so as to introduce a new iterative decoding technique. The results we obtained prove to be very good: indeed, even in the case of systems for which classical iterative algorithms appear powerless, our scheme enables us to recover the LFSR initial state with a very low error probability. The latter is such that ending the algorithm by an exhaustive search among sequences of limited length is hardly needed. Therefore, the overall complexity of our scheme remains very small and the algorithm appears as an excellent candidate for cryptanalysis of filtered PN-generators.

Original language | English |
---|---|

Pages (from-to) | 232-249 |

Number of pages | 18 |

Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Volume | 2595 |

Publication status | Published - 1 Dec 2003 |

Externally published | Yes |

### Fingerprint

### Keywords

- APP decoding
- Boolean functions
- Fourier transform
- Stream ciphers

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*,

*2595*, 232-249.