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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call