2013/08/29 by W.H. Ko, Ko, W. H.
Computer Science · #11A05 #11A25 #11D04 #Coding theory and cryptography #Cryptography and Data Security #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.1308.6411
openalex publication_date 2013/08/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper introduces two forms of modular inverses and proves their reciprocity formulas respectively. These formulas are then applied to formulate new and generalized algorithm for computing these modular inverses. The same algorithm is also shown to be applicable for the Chinese Remainder problem, i.e., simultaneous linear congruence equations, for co-prime moduli as well as non-co-prime moduli.