DOI
10.34229/KCA2522-9664.24.6.2
UDC 5.681.3
ALGORITHMS FOR SOLVING LINEAR CONSTRAINTS OVER RESIDUE RING
Abstract. Algorithms for checking the problem of satisfying the constraints in the form of linear equalities over residue
rings Zm are proposed. The proposed algorithms are shown to belong to the class of polynomial time complexity.
Keywords: linear equalities, residue ring, algorithms, complexity.
full text
REFERENCES
- 1. Kryvyi S.L. Algorithms for solving systems of linear Diophantine equations in residue rings. Cybernetics and Systems Analysis. 2007. Vol. 43. N 6. P. 787–798. URL: https://doi.org/10.1007/s10559-007-0103-1 .
- 2. Kryvyi S.L. Algorithms for solution of systems of linear diophantine equations in residue fields. Cybernetics and Systems Analysis. 2007. Vol. 43, N 2. P. 171–178. URL: https://doi.org/10.1007/s10559-007-0036-8 .
- 3. Menezes A., van Oorschot P., Vanstons S. Handbook of applied cryptography. CRC Press, 1996. 661 p.
- 4. Lenstra A.K., Lenstra M.S., Menasse M.S., Pollard J.M. The number field sieve. Proc. of the 22nd ACM Symposium on the Theory of Computing. May 13–17. 1990. P. 564–572.
- 5. Kaluzhnin L.A. Introduction to General Algebra. Moscow: Nauka, 1973. 447 p.
