Investigating results and performance of search and construction algorithms for word-based LFSRs, sigma-LFSRs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F18%3A00100955" target="_blank" >RIV/00216224:14330/18:00100955 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.dam.2018.01.010" target="_blank" >http://dx.doi.org/10.1016/j.dam.2018.01.010</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2018.01.010" target="_blank" >10.1016/j.dam.2018.01.010</a>
Alternative languages
Result language
angličtina
Original language name
Investigating results and performance of search and construction algorithms for word-based LFSRs, sigma-LFSRs
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10200 - Computer and information sciences
Result continuities
Project
<a href="/en/project/GA16-08565S" target="_blank" >GA16-08565S: Advancing cryptanalytic methods through evolutionary computing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Applied Mathematics
ISSN
0166-218X
e-ISSN
—
Volume of the periodical
243
Issue of the periodical within the volume
July
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
9
Pages from-to
90-98
UT code for WoS article
000435046600008
EID of the result in the Scopus database
—