Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Susil Kumar Bishoi"'
The word-oriented multiple-recursive matrix methods (MRMMs), introduced by Niederreiter, posses very attractive properties as they take advantage of the modern word-based processors and thus increase the throughput. Secondly, the bitstream produced b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52d5e4bde301ab7f80f1a12bc5db8954
https://doi.org/10.21203/rs.3.rs-2105578/v1
https://doi.org/10.21203/rs.3.rs-2105578/v1
Publikováno v:
Discrete Applied Mathematics. 285:493-500
The word-based LFSRs called σ -LFSRs are very attractive as they take advantage of the modern word-based processor and thus increase the throughput. Secondly, the bitstream produced by σ -LFSR has excellent statistical properties with a high period
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::771727a679992b8aeaeaff5d4bd14222
https://doi.org/10.1016/j.dam.2020.06.010
https://doi.org/10.1016/j.dam.2020.06.010
Publikováno v:
Discrete Applied Mathematics. 267:64-72
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-contr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c6b7f6096246c1ae2de26fa4b94f455
https://doi.org/10.1016/j.dam.2019.06.022
https://doi.org/10.1016/j.dam.2019.06.022
Autor:
Susil Kumar Bishoi, Vashek Matyas
Publikováno v:
Discrete Applied Mathematics. 243:90-98
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 σ -LFSRs. Both the search algorithm and the construction algorithm generate efficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15aab56e417e608356906d93f8797aa8
https://doi.org/10.1016/j.dam.2018.01.010
https://doi.org/10.1016/j.dam.2018.01.010
A class of xorshift random number generators (RNGs) are introduced by Marsaglia. We have proposed an algorithm which constructs a full period xorshift RNG from a given primitive polynomial. It is shown there is a weakness present in those RNGs and is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7571b6274b6f53c0ff8cd5bf75897dff
The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiple-recursive matrix method. Moreover,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b93d416a1ee1bdf03dc4143bcb7f815b