Cryptanalysis of nonlinear feedback shift registers
For a successful cryptanalysis of an NLFSR, the needed number of known plaintext bits is about the smaller of two numbers: the period (including the preperiod if the sequence is not purely periodic) and the number of degrees of freedom of the feedback function. Therefore, under the assumption that t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
11 Jan 2016
|
| In: |
Cryptologia
Year: 2016, Volume: 40, Issue: 4, Pages: 303-315 |
| ISSN: | 1558-1586 |
| DOI: | 10.1080/01611194.2015.1055385 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1080/01611194.2015.1055385
|
| Author Notes: | Klaus Pommerening |
| Summary: | For a successful cryptanalysis of an NLFSR, the needed number of known plaintext bits is about the smaller of two numbers: the period (including the preperiod if the sequence is not purely periodic) and the number of degrees of freedom of the feedback function. Therefore, under the assumption that the feedback function is completely unknown, there is no better way to cryptanalyse an NLFSR than a straightforward search for the period. If the choice of the feedback function is restricted in order to guarantee its efficient computation, then an algorithm by Boyar and Krawczyk gives an efficient cryptanalysis of the NLFSR in the sense of asymptotic complexity. |
|---|---|
| Item Description: | Published online: 11 Jan 2016 Gesehen am 03.11.2020 |
| Physical Description: | Online Resource |
| ISSN: | 1558-1586 |
| DOI: | 10.1080/01611194.2015.1055385 |