HomeIssuesConstructing transitive polynomials over the ring Z p2

Constructing transitive polynomials over the ring Z p2 | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 7 (Приложение).

Recurrent sequences are used in cryptography as key sequences. Due to this application, it is necessary to construct polynomials with maximal period. The method for constructing all such polynomials over the ring Z p2 is proposed.
Download file
Counter downloads: 175
  • Title Constructing transitive polynomials over the ring Z p2
  • Headline Constructing transitive polynomials over the ring Z p2
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 7 (Приложение)
  • Date:
  • DOI
Keywords
transitive polynomials, recurrent sequences, polynomial function over the ring, транзитивные полиномы, рекуррентные последовательности, полиномиальная функция над кольцом
Authors
References
Ермилов Д.М., Козлитин О. А. Цикловая структура полиномиального генератора над кольцом Галуа // Математические вопросы криптографии. 2013. №4(1). C. 27-57.
Frisch S. and Krenn D. Sylow p-groups of polynomial permutations on the integers mod pn // J. Number Th. 2013. No. 133. P. 4188-4199.
Ларин М. В. Транзитивные полиномиальные преобразования колец вычетов // Дискретная математика. 2002. №14(2). С. 20-32.
Constructing transitive polynomials over the ring Z <sub>p</sub>2 | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 7 (Приложение).
Constructing transitive polynomials over the ring Z p2 | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 7 (Приложение).
Download full-text version
Counter downloads: 1927