Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Rai L"'
For a given hyperelliptic curve $C$ over a finite field with Jacobian $J_C$, we consider the hyperelliptic analogue of the congruential generator defined by $W_n=W_{n-1}+D$ for $n\geq 1$ and $D,W_0\in J_C$. We show that curves of genus 2 produce sequ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa99335723b4a6a9a8746bd7f88e5120
Autor:
M��rai, L��szl��, Winterhof, Arne
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some disastrous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a332ff3631ddee6e95ae9dc799076ea6
Autor:
M��rai, L��szl��, Shparlinski, Igor E.
We study the distribution of the sequence of elements of the discrete dynamical system generated by iterations of the M��bius map $x \mapsto (ax + b)/(cx+d)$ over a finite field of $p$ elements at the moments of time that correspond to prime numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bf73410b9dcfb70a38cf789c07f92b2
Autor:
M��rai, L��szl��, Shparlinski, Igor E.
We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$ elements
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::244f00d846d02213d41d4c672d77f755
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. Recently, a series of paper has been published for analysis of expansion complexity and for testing sequences in terms of this new measure of rand
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9611ef7c1110d35fced8e29e10c92d51
Autor:
M��rai, L��szl��, Shparlinski, Igor E.
For a prime $p$ and a polynomial $F(X,Y)$ over a finite field $\mathbb{F}_p$ of $p$ elements, we give upper bounds on the number of solutions $$ F(x,y)=0, \quad x\in\mathcal{A}, \ y\in \mathcal{B}, $$ where $\mathcal{A}$ and $\mathcal{B}$ are very sm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22c4c36cee5d3528c1ea8f665d281b12
A few years ago new quantitative measures of pseudorandomness of binary sequences have been introduced. Since that these measures have been studied in many papers and many constructions have been given along these lines. In this paper the connection
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e70d849c2776ae14ff56e29ca4f6673e
Autor:
M��rai, L��szl��
For an elliptic curve $E$ over a finite field we define the point sequence $(P_n)$ recursively by $P_n=\vartheta (P_{n-1})=\vartheta ^n(P_0)$ with an endomorphism $\vartheta \in\mathrm{End}(E)$ and with some initial point $P_0$ on $E$. We study the d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaa8eaa7e9c0c368e92f751f42c5ccc3
Autor:
M��rai, L��szl��, Winterhof, Arne
The $N$th linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large $N$th linear complexity. However, in this paper we show that for $q$-automatic sequences over $\mathbb{F}_q$ the converse is not true
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::568a513847beca6770901e229e946563
Autor:
M��rai, L��szl��, Winterhof, Arne
We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating functions or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17f8dff43c997948ba06f67fc908af82