Algorithms for solving systems of linear Diophantine equations in residue rings

DOI10.1007/s10559-007-0103-1zbMath1149.11058OpenAlexW2000355168MaRDI QIDQ941190

S. L. Kryvyi

Publication date: 4 September 2008

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-007-0103-1

zbMATH Keywords

residue ringlinear Diophantine equationbasis of a solution set

Mathematics Subject Classification ID

Related Items (6)

Solution algorithms for systems of linear equations over residue rings ⋮ Algorithms for solving linear equations over associative rings with unit element ⋮ Combinatorial method for solving systems of linear constraints ⋮ Numerical methods to solve problems on a mathematical safe ⋮ Application of commutative rings with unity for construction of symmetric encryption system ⋮ Symmetric information exchange system based on ring isomorphism

Cites Work

• An efficient incremental algorithm for solving systems of linear diophantine equations
• Solution of the safe problem on (0,1)-matrices
• Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers
• Algorithms for solving systems of linear Diophantine equations in integer domains
• Algorithms for solution of systems of linear Diophantine equations in residue fields
• Automatic translation of FORTRAN programs to vector form

This page was built for publication: Algorithms for solving systems of linear Diophantine equations in residue rings