When Lagged Fibonacci Generators jump

J 2019

When Lagged Fibonacci Generators jump

CHETRY, Moon K.; Susil Kumar BISHOI a Václav MATYÁŠ

Základní údaje

Originální název

When Lagged Fibonacci Generators jump

Autoři

CHETRY, Moon K.; Susil Kumar BISHOI a Václav MATYÁŠ

Vydání

Discrete Applied Mathematics, Elsevier B.V. 2019, 0166-218X

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Obor

10102 Applied mathematics

Stát vydavatele

Nizozemské království

Utajení

není předmětem státního či obchodního tajemství

Odkazy

URL

Impakt faktor

Impact factor: 1.041

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14330/19:00110516

Organizační jednotka

Fakulta informatiky

Klíčová slova anglicky

Stream cipher; Primitive polynomial; LFSR; LFG; Jump index

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 8. 5. 2020 12:40, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

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.

Citovat

CHETRY, Moon K.; Susil Kumar BISHOI a Václav MATYÁŠ. When Lagged Fibonacci Generators jump. Discrete Applied Mathematics. Elsevier B.V., 2019, roč. 267, č. 1, s. 64-72. ISSN 0166-218X. Dostupné z: https://doi.org/10.1016/j.dam.2019.06.022.

@article{1550878,
   author = {Chetry, Moon K. and Bishoi, Susil Kumar and Matyáš, Václav},
   article_number = {1},
   doi = {https://doi.org/10.1016/j.dam.2019.06.022},
   keywords = {Stream cipher; Primitive polynomial; LFSR; LFG; Jump index},
   language = {eng},
   issn = {0166-218X},
   journal = {Discrete Applied Mathematics},
   title = {When Lagged Fibonacci Generators jump},
   url = {http://dx.doi.org/10.1016/j.dam.2019.06.022},
   volume = {267},
   year = {2019}
}

TY  - JOUR
ID  - 1550878
AU  - Chetry, Moon K. - Bishoi, Susil Kumar - Matyáš, Václav
PY  - 2019
TI  - When Lagged Fibonacci Generators jump
JF  - Discrete Applied Mathematics
VL  - 267
IS  - 1
SP  - 64-72
EP  - 64-72
PB  - Elsevier B.V.
SN  - 0166218X
KW  - Stream cipher
KW  - Primitive polynomial
KW  - LFSR
KW  - LFG
KW  - Jump index
UR  - http://dx.doi.org/10.1016/j.dam.2019.06.022
L2  - http://dx.doi.org/10.1016/j.dam.2019.06.022
N2  - 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.
ER  -

CHETRY, Moon K.; Susil Kumar BISHOI a Václav MATYÁŠ. When Lagged Fibonacci Generators jump. \textit{Discrete Applied Mathematics}. Elsevier B.V., 2019, roč.~267, č.~1, s.~64-72. ISSN~0166-218X. Dostupné z: https://doi.org/10.1016/j.dam.2019.06.022.

Přehled o publikaci