Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
Randomness properties of some vector sequences generated by multivariate polynomial iterations
Download
index.pdf
Date
2016
Author
Gürkan Balıkçıoğlu, Pınar
Metadata
Show full item record
Item Usage Stats
8
views
2
downloads
Cite This
We examine the randomness properties of the sequences generated by the multivariate polynomial iterations method proposed by Ostafe and Shparlinski, by using the six different choices of polynomials given by the same authors. Our analysis is based on two approaches: distributions of the periods and linear complexities of the produced vector sequences. We deﬁne the efﬁciency parameters, PE for “period efﬁciency” and LCE for “linear complexity efﬁciency”, so that the actual values of the period and linear complexity of a sequence can be easily compared with those of the ideal cases. For each polynomial choice, in order to obtain the period distribution of the generated vector sequences, we perform an exhaustive search for prime ﬁeld sizes up to 13; and observe that the probability of attaining a maximum-period sequence is extremely low. Linear complexities of the sequences are also computed exhaustively for prime ﬁeld sizes up to 13 and the multivariate polynomial iterations with the proposed polynomial choices are observed to generate sequences with having high linear complexities quite seldomly. We then concentrate on the largest period sequences produced by each choice, and investigate the linear complexity of those sequences for a given polynomial choice, at a speciﬁc ﬁeld size p and number of polynomials m. We observe that an increase of p or m does not bring any improvement on the randomness of the generated sequences. Finally, we analyze the linear complexity of Ostafe’s sequences by ﬁxing the period but leaving the choice of m and other initial values random,as in real life. Although computational constraints limit our exhaustive search results in the ﬁrst part to relatively small values of p and m; the last part of our study lets us use higher values of p and m, to justify the projection that Ostafe’s method with the proposed polynomial choices is not a promising way of implementing pseudo-random number generators.
Subject Keywords
Polynomials.
,
Mathematical statistics.
,
Iterative methods (Mathematics).
URI
http://etd.lib.metu.edu.tr/upload/12619823/index.pdf
https://hdl.handle.net/11511/25512
Collections
Graduate School of Applied Mathematics, Thesis
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
P. Gürkan Balıkçıoğlu, “Randomness properties of some vector sequences generated by multivariate polynomial iterations,” Ph.D. - Doctoral Program, 2016.