We give an upper bound on the period length for vector sequences defined recursively by systems of multivariate polynomials with coefficients in the ring of integers modulo a prime power.
Download file
Counter downloads: 244
- Title On the period length of vector sequences generated by polynomials modulo prime powers
- Headline On the period length of vector sequences generated by polynomials modulo prime powers
- Publesher
Tomsk State University - Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 1(31)
- Date:
- DOI
Keywords
finite rings, polynomial permutations, polynomial functions, period length, vector sequences, recurrence sequences, конечное кольцо, полиномиальная подстановка, полиномиальная функция, длина периода, рекуррентная последовательностьAuthors
References
Niven I. Fermat's theorem for matrices. Duke Math. J., 1948, vol. 15, pp. 823-826.
Eichenauer-Herrmann J., Grothe H., and Lehn J. On the period length of pseudo random vector sequences generated by matrix generators. Matematics of Computation, 1989, vol. 52, no. 185, pp.145-148.
Marshall I. B. On the extension of Fermat's theorem to matrices of order n. Proc. Edinburgh Math. Soc., 1939-1941, vol.5, pp. 85-91.
Larin M. V. Transitive polynomial transformations of residue class rings. Discrete Math. Appl., 2002, vol. 12, no. 2, pp. 127-140.
Ermilov D. M. and Kozlitin O. A. Cyclic structure of a polynomial generator over the Galois ring. Mathematical Aspects of Cryptography, 2013, vol.4, no. 1, pp.27-57. (in Russian)
Anashin V. S. Uniformly distributed sequences of p-adic integers. Discrete Math. Appl., 2002, vol.12, no. 6, pp. 527-590.
On the period length of vector sequences generated by polynomials modulo prime powers | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2016. № 1(31).