Rational Reconstruction

A family of algorithms to recover a rational number p/q from its image modulo an integer N or from an approximate modular residue, under size bounds on numerator and denominator, typically using continued fractions or the extended Euclidean algorithm.

A technique to recover an unknown rational number p/q from its modular image r modulo an integer M, typically by finding small numerator and denominator consistent with r via continued fractions or lattice-based methods.