Paper 2013/209 Original: eprint.iacr.org/2013/209 ↗
New modular multiplication and division algorithms based on continued fraction expansion
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2013-04-14: last updated
- 2013-04-14: published
- Short URL
- https://ia.cr/2013/209
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/209,
author = {Mourad Gouicem},
title = {New modular multiplication and division algorithms based on continued fraction expansion},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/209},
year = {2013},
url = {https://eprint.iacr.org/2013/209}
}