2013/03/14 by Mourad Gouicem, Gouicem, Mourad
Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.1.0 #Numerical Methods and Algorithms #Symbolic Computation (cs.SC) #cs.DS #cs.SC
paper · pdf · doi:10.48550/arxiv.1303.3445
arxiv created 2013/03/14 · openalex publication_date 2013/03/14 · arxiv updated 2013/03/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are based on the Euclidean algorithm and are of quadratic complexity.