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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Prikladnaya Diskretnaya Matematika, 2011, supplement № 4, Pages 24–25 (Mi pdm280)  
Mathematical Methods of Cryptography

Polynomials over primary residue rings with a small unique distance

A. V. Abornev, D. N. Bylkov

Moscow State Institute of Radio-Engineering, Electronics and Automation (Technical University), Moscow
Full-text PDF (430 kB)
References:
PDF
HTML
Abstract: We consider polynomials over small residue rings. For polynomials with the unique distance equaled to twice the degree of the polynomial, we show how to use them for constructing cryptographic primitives.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. V. Abornev, D. N. Bylkov, “Polynomials over primary residue rings with a small unique distance”, Prikl. Diskr. Mat., 2011, supplement № 4, 24–25
Citation in format AMSBIB
\Bibitem{AboByl11}
\by A.~V.~Abornev, D.~N.~Bylkov
\paper Polynomials over primary residue rings with a~small unique distance
\jour Prikl. Diskr. Mat.
\yr 2011
\pages 24--25
\issueinfo supplement № 4
\mathnet{http://mi.mathnet.ru/pdm280}
Linking options:
  • https://www.mathnet.ru/eng/pdm280
  • https://www.mathnet.ru/eng/pdm/y2011/i13/p24
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:149
    Full-text PDF :67
    References:26
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024