A FASTER MODULAR MULTIPLICATION ALGORITHM

被引：14

作者：

ELDRIDGE, SE

机构：

[1] Computation Dept, UMIST, Manchester M60 1QD

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1991年 / 40卷 / 1-2期

关键词：

MODULAR MULTIPLICATION; FAST COMPUTER ARITHMETIC; DIGITAL ARITHMETIC; INTEGER DIVISION; PARALLEL BIT OPERATIONS; REDUNDANT NUMBER SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; RSA ALGORITHM;

D O I：

10.1080/00207169108804001

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper describes a method for quickly computing AB mod N where N is odd. It is shown to have significant advantages over other algorithms which make it suitable for use in hardware for public key encryption. Such hardware could run at approximately twice the speed of the best currently available. © 1991, Taylor & Francis Group, LLC. All rights reserved.

引用

页码：63 / 68

页数：6