| A Redundant Binary Algorithm for RSA |
| |
| 作者姓名： | 施荣华 |
| |
| 作者单位： | Changsha Railway University，Changsha 410075 |
| |
| 摘 要： | 1IntroductionModularexponentiationwithlargeilltegers,MEmodN,isoneoftheimportantcompu-tationalproblems.AtypicalexampleofitsapplicationsisimplementingtheRSAcryptosys-teml1].OnemethodofcomputingMEmodNistheaPproachofrepeatingmodularsquar-ingandmultiplication2].SinceitisbasedonthebinaryrepresentationofexponelltE,thealgorithmisreferredtoasbinaryalgorithm,whichcanbedescribedasfollows.LetE=en-1en-2...eobethebinaryrepresentationofexponentE,whereeiE{1,O},i=O,1,...3n-1.BinaryAlgorithm(forcomputi…
|
| 关 键 词： | 计算机网络 冗余 二进制算法 RSA |
A Redundant Binary Algorithm for RSA |
| |
| Shi Ronghua.A Redundant Binary Algorithm for RSA[J].Journal of Computer Science and Technology,1996,11(4):16-420. |
| |
| Authors: | Shi Ronghua |
| |
| Abstract: | The normal form and modilied normal form for binary redundant representation are defined. A redundant binary algorithm to compute modular exponentiation for very large integers is proposed. It is shown that the proposed algorithm requires the minimum number of basic operations (modular multiplications) among all possible binary redundant representations. |
| |
| Keywords: | Redundant binary representation redundant binary algorithm RSA |
| 本文献已被 CNKI 维普 等数据库收录！ |
