When Lagged Fibonacci Generators jump

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00110516" target="_blank" >RIV/00216224:14330/19:00110516 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.dam.2019.06.022" target="_blank" >http://dx.doi.org/10.1016/j.dam.2019.06.022</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2019.06.022" target="_blank" >10.1016/j.dam.2019.06.022</a>

Result language
angličtina
Original language name
When Lagged Fibonacci Generators jump
Original language description
Jansen introduced a primitive called jumped Linear Feedback Shift Register (LFSR) for building LFSRs that can be clocked a large number of times with a single simple operation. This is useful in the construction of stream ciphers based on clock-controlled LFSRs. A concept of Lagged Fibonacci Generator (LFG) is also used as an important building block of key-stream generators in stream cipher cryptography. In this paper, we use the jumping concept of Jansen in case of LFG. We show that unlike LFSRs, LFGs need not jump always in the state space itself, even though the characteristic polynomial is primitive. Instead, it may have a hyper space jump depending on the characteristic primitive polynomial. We give a necessary and sufficient condition for an LFG to jump within the state space itself and when it exists, it is same as the degree of the characteristic polynomial.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)