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

Logo poskytovatele

Varování

Publikace nespadá pod Pedagogickou fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

BISHOI Susil Kumar MATYÁŠ Václav

Rok publikování 2018
Druh Článek v odborném periodiku
Časopis / Zdroj Discrete Applied Mathematics
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www https://www.sciencedirect.com/science/article/pii/S0166218X18300660
Doi http://dx.doi.org/10.1016/j.dam.2018.01.010
Klíčová slova Primitive polynomial; LFSR; \sigma-LFSR; Xorshift random number generator
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.