Advertisement

Cybernetics and Systems Analysis

, Volume 55, Issue 5, pp 714–730 | Cite as

Numerical Methods to Solve Problems on a Mathematical Safe

  • S. L. KryvyiEmail author
Article
  • 3 Downloads

Abstract

Numerical methods to solve problems on a mathematical safe with an arbitrary finite number of positions of locks are given. The methods are based on TSS-algorithms for constructing sets of basic solutions to systems of linear Diophantine equations in finite fields and rings.

Keywords

Diophantine equation finite field finite ring system of linear equations basis of solutions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. A. Donets, “Solution of the safe problem on (0,1)-matrices,” Cybernetics and Systems Analysis, Vol. 38, No. 1, 83–88 (2002).MathSciNetCrossRefGoogle Scholar
  2. 2.
    I. V. Sergienko, S. L. Kryvyi, and O. I. Provotar, Algebraic Aspects of Information Technology [in Ukrainian], Part 1, Interservice, Kyiv (2018).Google Scholar
  3. 3.
    S. L. Kryvyi, “Algorithms for solution of systems of linear Diophantine equations in residue fields,” Cybernetics and Systems Analysis, Vol. 43, No. 2, 171–178 (2007).MathSciNetCrossRefGoogle Scholar
  4. 4.
    S. L. Kryvyi, “Algorithms for solving systems of linear Diophantine equations in residue rings,” Cybernetics and Systems Analysis, Vol. 43, No. 6, 787–798 (2007).MathSciNetCrossRefGoogle Scholar
  5. 5.
    S. L. Kryvyi, Linear Diophantine Constraints and Their Applications [in Ukrainian], Chernivtsi–Kyiv, Bukrek (2015).Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Taras Shevchenko National University of KyivKyivUkraine

Personalised recommendations