Scholarlink

<p>Two algorithms for solving systems of linear congruences over residue rings are analyzed. The first algorithm is based on factorizing the modulus and solving the resulting subsystems in the primary rings or fields. The second algorithm introduces certain redundancies during computations. Both algorithms determine the generating vectors of the set of all solutions of the initial system of linear congruences. The article presents the dependences of both algorithms on the modulus size, the number of congruences, and the number of variables in the systems, as obtained in experiments.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On Algorithms for Solving Linear Equations Over Residue Rings

  • 期刊论文

  • 发表日期：

    2026年3月1日

查看全文
  • S. Kryvyi,
  • O. Chugaenko

摘要

Two algorithms for solving systems of linear congruences over residue rings are analyzed. The first algorithm is based on factorizing the modulus and solving the resulting subsystems in the primary rings or fields. The second algorithm introduces certain redundancies during computations. Both algorithms determine the generating vectors of the set of all solutions of the initial system of linear congruences. The article presents the dependences of both algorithms on the modulus size, the number of congruences, and the number of variables in the systems, as obtained in experiments.