Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find






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


Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2012, Volume 3, Issue 4, Pages 91–125
DOI: https://doi.org/10.4213/mvk69
(Mi mvk69)
 

Certainly solvable equations on algebraic systems

S. V. Polin

Academy of Cryptography of the Russian Federation, Moscow
References:
Abstract: The applicability of successive grouping methods for solution of certainly solvable equations is studied.
Key words: certainly solvable equations, certainly compatible systems of equations, grouping method.
Received 20.V.2011
Document Type: Article
UDC: 519.212.2+510.52
Language: Russian
Citation: S. V. Polin, “Certainly solvable equations on algebraic systems”, Mat. Vopr. Kriptogr., 3:4 (2012), 91–125
Citation in format AMSBIB
\Bibitem{Pol12}
\by S.~V.~Polin
\paper Certainly solvable equations on algebraic systems
\jour Mat. Vopr. Kriptogr.
\yr 2012
\vol 3
\issue 4
\pages 91--125
\mathnet{http://mi.mathnet.ru/mvk69}
\crossref{https://doi.org/10.4213/mvk69}
Linking options:
  • https://www.mathnet.ru/eng/mvk69
  • https://doi.org/10.4213/mvk69
  • https://www.mathnet.ru/eng/mvk/v3/i4/p91
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:434
    Full-text PDF :231
    References:79
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024