Investigating results and performance of search and construction algorithms for word-based LFSRs, sigma-LFSRs

Kód výsledku v IS VaVaI

RIV/00216224:14330/18:00100955 - isvavai.cz

Výsledek na webu

http://dx.doi.org/10.1016/j.dam.2018.01.010

DOI - Digital Object Identifier

10.1016/j.dam.2018.01.010

Jazyk výsledku

angličtina

Název v původním jazyce

Investigating results and performance of search and construction algorithms for word-based LFSRs, sigma-LFSRs

Popis výsledku v původním jazyce

Linear feedback shift registers (LFSRs) play a significant role in communications security and we investigate design of a selected class of word-based LFSRs known as sigma-LFSRs. Both the search algorithm and the construction algorithm generate efficient primitive sigma-LFSRs. The search algorithm first constructs the sigma-polynomial and then checks the primitiveness of the sigma-polynomial, whereas the construction algorithm for the sigma-LFSR, first finds a primitive polynomial f(x) and then constructs the primitive sigma-LFSR from f(x). In this paper, we present some novel results pertaining to the search algorithm for primitive sigma-LFSR along with the exhaustive search space complexity of the search algorithm for sigma-LFSRs. Then we investigate and compare the performance of the construction algorithm with the search algorithm for the primitive sigma-LFSR. Finally, the number of sigma-LFSRs similar to the sigma-LFSRs generated by the construction algorithm is provided.

Název v anglickém jazyce

Investigating results and performance of search and construction algorithms for word-based LFSRs, sigma-LFSRs

Popis výsledku anglicky

Linear feedback shift registers (LFSRs) play a significant role in communications security and we investigate design of a selected class of word-based LFSRs known as sigma-LFSRs. Both the search algorithm and the construction algorithm generate efficient primitive sigma-LFSRs. The search algorithm first constructs the sigma-polynomial and then checks the primitiveness of the sigma-polynomial, whereas the construction algorithm for the sigma-LFSR, first finds a primitive polynomial f(x) and then constructs the primitive sigma-LFSR from f(x). In this paper, we present some novel results pertaining to the search algorithm for primitive sigma-LFSR along with the exhaustive search space complexity of the search algorithm for sigma-LFSRs. Then we investigate and compare the performance of the construction algorithm with the search algorithm for the primitive sigma-LFSR. Finally, the number of sigma-LFSRs similar to the sigma-LFSRs generated by the construction algorithm is provided.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

GA16-08565S: Rozvoj kryptoanalytických metod prostřednictvím evolučních výpočtů

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název periodika

Discrete Applied Mathematics

ISSN

0166-218X

e-ISSN

—

Svazek periodika

243

Číslo periodika v rámci svazku

July

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

9

Strana od-do

90-98

Kód UT WoS článku

000435046600008

EID výsledku v databázi Scopus

—