👉 Coppersmith's algorithm is a method for solving linear equations that uses modular arithmetic. It was developed by J.J. Coppersmith in 1983 to solve a system of linear equations with 20 or less variables. The basic idea behind coppersmith's algorithm is that it can be used to efficiently find the inverse of a matrix (which is essentially what we are trying to solve for) modulo an unknown prime number. This method works by repeatedly multiplying the matrix by its
