Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika. Supplement, 2014, Issue 7, Pages 69–70 (Mi pdma159)  
Pseudorandom Generators

Constructing transitive polynomials over the ring $\mathbb Z_{p^2}$

A. O. Kovalevskaya

Tomsk State University, Tomsk
Full-text PDF (530 kB)
References:
PDF
HTML
Abstract: 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 $\mathbb Z_{p^2}$ is proposed.
Keywords: polynomial function over the ring, recurrent sequences, transitive polynomials.
Document Type: Article
UDC: 519.113.6
Language: Russian
Citation: A. O. Kovalevskaya, “Constructing transitive polynomials over the ring $\mathbb Z_{p^2}$”, Prikl. Diskr. Mat. Suppl., 2014, no. 7, 69–70
Citation in format AMSBIB
\Bibitem{Kov14}
\by A.~O.~Kovalevskaya
\paper Constructing transitive polynomials over the ring~$\mathbb Z_{p^2}$
\jour Prikl. Diskr. Mat. Suppl.
\yr 2014
\issue 7
\pages 69--70
\mathnet{http://mi.mathnet.ru/pdma159}
Linking options:
  • https://www.mathnet.ru/eng/pdma159
  • https://www.mathnet.ru/eng/pdma/y2014/i7/p69
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:155
    Full-text PDF :92
    References:37
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024