Welcome to the resource topic for 2013/209
Title:
New modular multiplication and division algorithms based on continued fraction expansion
Authors: Mourad Gouicem
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.
ePrint: https://eprint.iacr.org/2013/209
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .