Analyzing and comparing Montgomery multiplication algorithms

被引：336

作者：

Koc, CK

Acar, T

Kaliski, BS

机构：

[1] University of California, Santa Barbara, CA

[2] Dept. of Elec. and Comp. Engineering, Oregon State University, ECE 220, Corvallis

来源：

IEEE MICRO | 1996年 / 16卷 / 03期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1109/40.502403

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Montgomery multiplication methods constitute the core of modular exponentiation, the most popular operation for encrypting and signing digital data in public-key cryptography.

引用

页码：26 / 33

页数：8

共 8 条

[1] NEW DIRECTIONS IN CRYPTOGRAPHY [J].

DIFFIE, W ;

HELLMAN, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654

[2]

DUSSE SR, 1991, LECT NOTES COMPUT SC, V473, P230

[3]

EVEN S, 1991, LECT NOTES COMPUT SC, V537, P619

[4]

KALISKI BS, 1993, DR DOBBS J SEP, P50

[5]

Knuth Donald, 1981, ART COMPUTER PROGRAM, V2

[6]

MONTGOMERY PL, 1985, MATH COMPUT, V44, P519, DOI 10.1090/S0025-5718-1985-0777282-X

[7]

Naccache D., 1995, Designs, Codes and Cryptography, V5, P73, DOI 10.1007/BF01388505

[8]

RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI [10.1145/359340.359342, 10.1145/357980.358017]

← 1 →