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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Dokumenttyp: | Article (Journal) |
| Sprache: | Englisch |
| Veröffentlicht: |
11 Jan 2016
|
| In: |
Cryptologia
Year: 2016, Jahrgang: 40, Heft: 4, Pages: 303-315 |
| ISSN: | 1558-1586 |
| DOI: | 10.1080/01611194.2015.1055385 |
| Online-Zugang: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1080/01611194.2015.1055385
|
| Verfasserangaben: | Klaus Pommerening |
MARC
| LEADER | 00000caa a2200000 c 4500 | ||
|---|---|---|---|
| 001 | 1737645505 | ||
| 003 | DE-627 | ||
| 005 | 20220819011327.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201103s2016 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1080/01611194.2015.1055385 |2 doi | |
| 035 | |a (DE-627)1737645505 | ||
| 035 | |a (DE-599)KXP1737645505 | ||
| 035 | |a (OCoLC)1341375274 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 084 | |a 27 |2 sdnb | ||
| 100 | 1 | |a Pommerening, Klaus |d 1946-2023 |e VerfasserIn |0 (DE-588)1055083634 |0 (DE-627)793187400 |0 (DE-576)411164899 |4 aut | |
| 245 | 1 | 0 | |a Cryptanalysis of nonlinear feedback shift registers |c Klaus Pommerening |
| 264 | 1 | |c 11 Jan 2016 | |
| 300 | |a 13 | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Published online: 11 Jan 2016 | ||
| 500 | |a Gesehen am 03.11.2020 | ||
| 520 | |a 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. | ||
| 650 | 4 | |a Boyar-Krawczyk algorithm | |
| 650 | 4 | |a cryptanalysis | |
| 650 | 4 | |a nonlinear feedback shift register | |
| 650 | 4 | |a stream cipher | |
| 773 | 0 | 8 | |i Enthalten in |t Cryptologia |d London [u.a.] : Taylor and Francis, 1977 |g 40(2016), 4, Seite 303-315 |h Online-Ressource |w (DE-627)508726697 |w (DE-600)2225163-7 |w (DE-576)252614658 |x 1558-1586 |7 nnas |a Cryptanalysis of nonlinear feedback shift registers |
| 773 | 1 | 8 | |g volume:40 |g year:2016 |g number:4 |g pages:303-315 |g extent:13 |a Cryptanalysis of nonlinear feedback shift registers |
| 856 | 4 | 0 | |u https://doi.org/10.1080/01611194.2015.1055385 |x Verlag |x Resolving-System |z lizenzpflichtig |3 Volltext |
| 951 | |a AR | ||
| 992 | |a 20201103 | ||
| 993 | |a Article | ||
| 994 | |a 2016 | ||
| 998 | |g 1055083634 |a Pommerening, Klaus |m 1055083634:Pommerening, Klaus |p 1 |x j |y j | ||
| 999 | |a KXP-PPN1737645505 |e 3791731904 | ||
| BIB | |a Y | ||
| SER | |a journal | ||
| JSO | |a {"type":{"media":"Online-Ressource","bibl":"article-journal"},"note":["Published online: 11 Jan 2016","Gesehen am 03.11.2020"],"recId":"1737645505","language":["eng"],"title":[{"title_sort":"Cryptanalysis of nonlinear feedback shift registers","title":"Cryptanalysis of nonlinear feedback shift registers"}],"person":[{"family":"Pommerening","given":"Klaus","roleDisplay":"VerfasserIn","display":"Pommerening, Klaus","role":"aut"}],"physDesc":[{"extent":"13 S."}],"relHost":[{"type":{"media":"Online-Ressource","bibl":"periodical"},"note":["Gesehen am 18.10.11"],"disp":"Cryptanalysis of nonlinear feedback shift registersCryptologia","language":["eng"],"recId":"508726697","pubHistory":["1.1977 -"],"part":{"volume":"40","text":"40(2016), 4, Seite 303-315","extent":"13","year":"2016","issue":"4","pages":"303-315"},"title":[{"title_sort":"Cryptologia","title":"Cryptologia"}],"physDesc":[{"extent":"Online-Ressource"}],"origin":[{"dateIssuedDisp":"1977-","publisher":"Taylor and Francis","dateIssuedKey":"1977","publisherPlace":"London [u.a.]"}],"id":{"zdb":["2225163-7"],"eki":["508726697"],"issn":["1558-1586"]}}],"origin":[{"dateIssuedKey":"2016","dateIssuedDisp":"11 Jan 2016"}],"id":{"doi":["10.1080/01611194.2015.1055385"],"eki":["1737645505"]},"name":{"displayForm":["Klaus Pommerening"]}} | ||
| SRT | |a POMMERENINCRYPTANALY1120 | ||