求乘逆的快速分数阶方法
Fast Fraction-Integer Method for Computing Multiplicative Inverse
摘要:
乘逆运算是公钥密码学中的一种重要运算,在密码学中有着广泛的应用。公钥密码学产生了这样一种需求,在这种需求中,我们需要生成一对相关的公钥和私钥,每一个都是另一个的逆。求乘法逆的基本方法是推广的欧几里德方法。本文提出了一种新的求逆算法,该算法基于连续的整数减分数和除以分数得到的整数,该整数用于求逆d。作者声称,所提出的方法比现有的方法更有效和更快。
英文摘要:
Multiplicative inverse is a crucial operation in public key cryptography, and been widely used in cryptography. Public key cryptography has given rise to such a need, in which we need to generate a related public and private pair of numbers, each of which is the inverse of the other. The basic method to find multiplicative inverses is Extended-Euclidean method. In this paper we will propose a new algorithm for computing the inverse, based on continues subtract fraction from integer and divide by fraction to obtain integer that will be used to compute the inverse d. The authors claim that the proposed method more efficient and faster than the existed methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。