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



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






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


Diskretnaya Matematika, 2019, Volume 31, Issue 2, Pages 3–13
DOI: https://doi.org/10.4213/dm1565
(Mi dm1565)
 

Group polynomials over rings

A. V. Akishin

MIREA — Russian Technological University, Moscow
References:
Abstract: We consider polynomials over rings such that the polynomials represent Latin squares and define a group operation over the ring. We introduce the notion of a group polynomial, describe a number of properties of these polynomials and the groups generated. For the case of residue rings $\mathbb{Z}_{r^n}$, where $r$ is a prime number, we give a description of groups specified by polynomials and identify a class of group polynomials that can be used to construct controlled cryptographic transformations.
Keywords: cryptography, groups, residue rings, polynomial groups.
Received: 05.02.2019
English version:
Discrete Mathematics and Applications, 2020, Volume 30, Issue 6, Pages 357–364
DOI: https://doi.org/10.1515/dma-2020-0033
Bibliographic databases:
Document Type: Article
UDC: 512.55+512.543.7
Language: Russian
Citation: A. V. Akishin, “Group polynomials over rings”, Diskr. Mat., 31:2 (2019), 3–13; Discrete Math. Appl., 30:6 (2020), 357–364
Citation in format AMSBIB
\Bibitem{Aki19}
\by A.~V.~Akishin
\paper Group polynomials over rings
\jour Diskr. Mat.
\yr 2019
\vol 31
\issue 2
\pages 3--13
\mathnet{http://mi.mathnet.ru/dm1565}
\crossref{https://doi.org/10.4213/dm1565}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3962496}
\elib{https://elibrary.ru/item.asp?id=37652124}
\transl
\jour Discrete Math. Appl.
\yr 2020
\vol 30
\issue 6
\pages 357--364
\crossref{https://doi.org/10.1515/dma-2020-0033}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000599648900001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85099099221}
Linking options:
  • https://www.mathnet.ru/eng/dm1565
  • https://doi.org/10.4213/dm1565
  • https://www.mathnet.ru/eng/dm/v31/i2/p3
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:372
    Full-text PDF :58
    References:36
    First page:37
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024