An equivalence preserving transformation from the Fibonacci to the Galois NLFSRs
| dc.creator | Dubrova, Elena | |
| dc.date | 2008-01-28 | |
| dc.date | 2008-01-30 | |
| dc.date.accessioned | 2026-07-07T08:57:01Z | |
| dc.date.available | 2026-07-07T08:57:01Z | |
| dc.description | Conventional Non-Linear Feedback Shift Registers (NLFSRs) use the Fibonacci configuration in which the value of the first bit is updated according to some non-linear feedback function of previous values of other bits, and each remaining bit repeats the value of its previous bit. We show how to transform the feedback function of a Fibonacci NLFSR into several smaller feedback functions of individual bits. Such a transformation reduces the propagation time, thus increasing the speed of pseudo-random sequence generation. The practical significance of the presented technique is that is makes possible increasing the keystream generation speed of any Fibonacci NLFSR-based stream cipher with no penalty in area. | |
| dc.description | 14 pages, 4 figures, one reference added, example 4 corrected | |
| dc.identifier | https://arxiv.org/abs/0801.4079 | |
| dc.identifier | http://arxiv.org/abs/0801.4079 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/146817 | |
| dc.subject | Cryptography and Security | |
| dc.title | An equivalence preserving transformation from the Fibonacci to the Galois NLFSRs | |
| dc.type | text |