2000 character limit reached
New modular multiplication and division algorithms based on continued fraction expansion (1303.3445v1)
Published 14 Mar 2013 in cs.DS and cs.SC
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.