我们的网站为什么显示成这样?

可能因为您的浏览器不支持样式,您可以更新您的浏览器到最新版本,以获取对此功能的支持,访问下面的网站,获取关于浏览器的信息:

|Table of Contents|

多精度整数高效模幂运算算法的研究(PDF)

《南京林业大学学报(自然科学版)》[ISSN:1000-2006/CN:32-1161/S]

Issue:
2004年06期
Page:
27-30
Column:
研究论文
publishdate:
1900-01-01

Article Info:/Info

Title:
A Study on Multiple-precision Integer Efficient Modular Exponentiation Algorithm
Article ID:
1000-2006(2004)06-0027-04
Author(s):
L Zhi-ying
Nanjing Forestry University,Nanjing 210037,China
Keywords:
Sliding-windowMultiple-precision integerModular exponentiationCryptography
Classification number :
TP332
DOI:
10.3969/j.jssn.1000-2006.2004.06.007
Document Code:
A
Abstract:
This paper introduced a method called "sliding-window" used in multiple-precision integer exponentiation arithmetic,and studied its application combined with Montgomery reduction,and how to calculate the "window size" related to the bits of the multiple-precision integer.The result indicates that the combined algorithm carries out an efficient calculation,the elapsed time of 4 096 bits multiple-precision integers modular exponentiation is about 1.5 s,and it will be the base of applied RSA public-key cryptography used in information security.

References

-

Last Update: 1900-01-01