Efficient Modular Multiplication Algorithms for Public Key Cryptography

被引：0

作者：

Vollala, Satyanarayana ^{[1
]}

Varadhan, V. V. ^{[1
]}

Geetha, K. ^{[1
]}

Ramasubramanian, N. ^{[1
]}

机构：

[1] Natl Inst Technol, Dept Comp Sci & Engn, Tiruchirappalli, Tamil Nadu, India

来源：

SOUVENIR OF THE 2014 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC) | 2014年

关键词：

Modular Multiplication; Public key; cryptography( PKC); RSA; binary exponentaition; EXPONENTIATION;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：74 / 78

页数：5

共 13 条

[1]

Agnew Gordon B., 1988, ADV CRYPTOLOGY, P225

Alia, G ;

Martinelli, E .

[3]

Alkar AZ, 2004, INTEGRATION, V38, P299, DOI 10.1016/j.vlsi.2004.07.018

[4]

Bernstein DJ, 2006, LECT NOTES COMPUT SC, V3958, P207

[5] Securing the commercial Internet [J].

Bhimani, A .

[6]

Desmedt Yvo, 2005, ENCY CRYPTOGRAPHY SE, P183

[7]

Fischer Michael J., 1998, SUPER EXPONENTIAL CO, P122

[8] A survey of fast exponentiation methods [J].

Gordon, DM .

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1998, 27 (01) :129-146

[9]

Möller B, 2002, LECT NOTES COMPUT SC, V2587, P298

[10]

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