Abstract
Polynomial algorithms are proposed for constructing the basis of the solution set of a system of linear homogeneous equations or a system of inhomogeneous linear Diophantine equations in the ring of residues modulo some number provided that the prime factorization of the number is known.
Similar content being viewed by others
References
S. L. Kryvyi, “Algorithms for solving systems of linear Diophantine equations in residue rings,” Cybernetics and Systems Analysis, 43, No. 6, 787–798 (2007).
S. L. Kryvyi, “Algorithms for solving systems of linear Diophantine equations in integer domains,” Cybernetics and Systems Analysis, 42, No. 2, 163–176 (2006).
S. L. Kryvyi, “Algorithms for solution of systems of linear Diophantine equations in residue fields,” Cybernetics and Systems Analysis, 43, No. 2, 171–178 (2007).
G. A. Donets, “Solution of the safe problem on (0,1)-matrices,” Cybernetics and Systems Analysis, 38, No. 1, 83–88 (2002).
G. A. Donets and Aghaei Agh Ghamish Yaghoub, “The mathematical safe problem on matrices,” in: Prepr. V. M. Glushkov Institute of Cybernetics of NANU (2013), pp. 124–131.
A. V. Cheremushkin, Lectures on Arithmetic Algorithms in Cryptography [in Russian], MTsNMO, Moscow (2002).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, September–October, 2016, pp. 149–160.
Rights and permissions
About this article
Cite this article
Kryvyi, S.L. Solution Algorithms for Systems of Linear Equations Over Residue Rings. Cybern Syst Anal 52, 791–801 (2016). https://doi.org/10.1007/s10559-016-9880-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-016-9880-8