首页>
外国专利>
Modulo N multiplication of two binary numbers and application to exponentiation for public key encryption
Modulo N multiplication of two binary numbers and application to exponentiation for public key encryption
展开▼
机译:两个二进制数的模N乘法及其在求幂运算中的公钥加密
展开▼
页面导航
摘要
著录项
相似文献
摘要
The computation procedure produces a number of sub-products using a recursive relationship. The modulo number is subtracted from each sub-product, leaving the sub-product unchanged if the result of the subtraction is negative or modifying the value of the sub-product if the result is positive. The result is added to the product of the first multiplier and a co-efficient from the second multiplier. The result has subtracted from it the number resulting from the previous subtraction and test, and again the result is retained if the subtraction proves negative, or modified if not.
展开▼