基于连分式展开的模乘除新算法
New 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
