English

Solving Modular Linear Systems with a Constraint by parallel decomposition of the Smith form and extended Euclidean division modulo powers of primes divisors

Number Theory 2025-09-09 v4 Discrete Mathematics Data Structures and Algorithms

Abstract

Integral linear systems Ax=bAx=b with matrices AA, bb and solutions xx are also required to be in integers, can be solved using invariant factors of AA (by computing the Smith Canonical Form of AA). This paper explores a new problem which arises in applications, that of obtaining conditions for solving the Modular Linear System Ax=b\remnAx=b\rem n given A,bA,b in \zzn\zz_n for xx in \zzn\zz_n along with the constraint that the value of the linear function ϕ(x)=\law,x\ra\phi(x)=\la w,x\ra is coprime to nn for some solution xx. In this paper we develop decomposition of the system to coprime moduli pr(p)p^{r(p)} which are divisors of nn and show how such a decomposition simplifies the computation of Smith form. This extends the well known index calculus method of computing the discrete logarithm where the moduli over which the linear system is reduced were assumed to be prime (to solve the reduced systems over prime fields) to the case when the factors of the modulus are prime powers pr(p)p^{r(p)}. It is shown how this problem can be addressed effciently using the invariant factors and Smith form of the augmented matrix [A,pr(p)I][A,-p^{r(p)}I] and conditions modulo pp satisfied by ww, where pr(p)p^{r(p)} vary over all divisors of nn with pp prime.

Keywords

Cite

@article{arxiv.2503.10158,
  title  = {Solving Modular Linear Systems with a Constraint by parallel decomposition of the Smith form and extended Euclidean division modulo powers of primes divisors},
  author = {Virendra Sule},
  journal= {arXiv preprint arXiv:2503.10158},
  year   = {2025}
}

Comments

17 pages