New modular multiplication and division algorithms based on continued fraction expansion
Data Structures and Algorithms
2013-03-15 v1 Symbolic Computation
Abstract
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.
Cite
@article{arxiv.1303.3445,
title = {New modular multiplication and division algorithms based on continued fraction expansion},
author = {Mourad Gouicem},
journal= {arXiv preprint arXiv:1303.3445},
year = {2013}
}