Sciweavers

Share
ARITH
2015
IEEE

Modular Multiplication and Division Algorithms Based on Continued Fraction Expansion

4 years 10 months ago
Modular Multiplication and Division Algorithms Based on Continued Fraction Expansion
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.
Mourad Gouicem
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where ARITH
Authors Mourad Gouicem
Comments (0)
books