Measures of Pseudorandomness.
K Gyarmati - 2013 - degruyter.com
In the second half of the 1990s Christian Mauduit and András Sárközy [86] introduced a new
quantitative theory of pseudorandomness of binary sequences. Since then numerous …
quantitative theory of pseudorandomness of binary sequences. Since then numerous …
[HTML][HTML] Exponential sums over points of elliptic curves
O Ahmadi, IE Shparlinski - Journal of Number Theory, 2014 - Elsevier
Exponential sums over points of elliptic curves - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …
Multidimensional linear complexity analysis of periodic arrays
R Arce-Nazario, F Castro, D Gomez-Perez… - Applicable Algebra in …, 2020 - Springer
The linear complexity of a sequence is an important parameter for many applications,
especially those related to information security, and hardware implementation. It is desirable …
especially those related to information security, and hardware implementation. It is desirable …
[HTML][HTML] On finite pseudorandom binary lattices
Pseudorandom binary sequences play a crucial role in cryptography. The classical
approach to pseudorandomness of binary sequences is based on computational complexity …
approach to pseudorandomness of binary sequences is based on computational complexity …
Chapter Measures of Pseudorandomness
K Gyarmati - Finite Fields and Their Applications: Character Sums …, 2013 - library.oapen.org
In the second half of the 1990s Christian Mauduit and András Sárközy [86] introduced a new
quantitative theory of pseudorandomness of binary sequences. Since then numerous …
quantitative theory of pseudorandomness of binary sequences. Since then numerous …
On lattice profile of the elliptic curve linear congruential generators
Lattice tests are quality measures for assessing the intrinsic structure of pseudorandom
number generators. Recently a new lattice test has been introduced by Niederreiter and …
number generators. Recently a new lattice test has been introduced by Niederreiter and …
More constructions of pseudorandom lattices of symbols
KH Mak - Monatshefte für Mathematik, 2015 - Springer
We define the pseudorandom lattice of kk symbols, and present some new constructions of
families of such lattices, which generalize several previous constructions for the …
families of such lattices, which generalize several previous constructions for the …
[PDF][PDF] Linear complexity analysis of multidimensional periodic arrays
R Arce-Nazario, F Castro, D Gomez-Perez, O Moreno… - 2020 - ccom.uprrp.edu
The linear complexity of a sequence is an important parameter for many applications,
especially those related to information security, and hardware implementation. It is desirable …
especially those related to information security, and hardware implementation. It is desirable …
[PDF][PDF] Zhixiong Chen, Domingo Gomez-Perez
G Pirsic - academia.edu
Lattice tests are quality measures for assessing the intrinsic structure of pseudorandom
number generators. Recently a new lattice test has been introduced by Niederreiter and …
number generators. Recently a new lattice test has been introduced by Niederreiter and …
[PDF][PDF] Pszeudovéletlen diszkrét struktúrákról
K Gyarmati - 2012 - real.mtak.hu
A számítógépek korában a véletlengenerálás fontos szerepet játszik életünkben. Azonban a
véletlengenerálás kapcsán felmerül néhány nehéz kérdés: Mi is az a véletlen generálás? Az …
véletlengenerálás kapcsán felmerül néhány nehéz kérdés: Mi is az a véletlen generálás? Az …