Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Fast exponentiation method by folding exponent in half

Fast exponentiation method by folding exponent in half

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

On average, the square-and-multiply method requires 1.5k multiplications to evaluate xE, where k is the bit length of E. Recently, Wu and Chang proposed an efficient method for computing xE, which needs 156k/128 multiplications. By folding the exponent E in half and combining Wu and Chang's method, we present a more efficient method for evaluating xE. On average, our new method needs only 149k/128 + 3 multiplications.

Inspec keywords: digital arithmetic; cryptography; parallel algorithms

Other keywords: parallel processing; fast exponentiation method; multiplications

Subjects: Digital arithmetic methods; Codes; Data security

References

    1. 1)
      • D.E. Knuth . (1969) The art of computer programining, vol.II: seminumerical algorithms.
    2. 2)
      • T.C. Wu , Y.S. Chang . Improved generalisation common-multiplicand multiplicationsalgorithm of Yen and Laih. Electron. Lett. , 20 , 1738 - 1739
    3. 3)
      • C.-W. Chiou . Parallel implementation of the RSA public-key cryptosystem. Int. J. Comput. Math. , 153 - 155
    4. 4)
      • R.L. Rivest , A. Shamir , L. Adleman . A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM , 2 , 120 - 126
    5. 5)
      • W. Diffie , M.E. Hellman . New directions in cryptography. IEEE Trans. Inf. Theory , 6 , 644 - 654
    6. 6)
      • S.M. Yen , C.S. Laih . Common-multiplicand multiplication and its applications to public keycryptography. Electron. Lett. , 17 , 1583 - 1584
    7. 7)
      • C.-Y. Chen , C.-C. Chang , W.-P. Yang . Hybrid method for modularexponentiation with precomputation. Electron. Lett. , 16 , 540 - 541
    8. 8)
      • Y.-J. Chen , C.-C. Chang , W.-P. Yang . Parallel computation of the modularcascade exponentiation. J. Parallel Algorithms Appl. , 29 - 42
    9. 9)
      • Y.-J. Chen , C.-C. Chang , W.-P. Yang . Some properties of vectorial additionchains. Int. J. Comput. Math. , 185 - 196
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19960662
Loading

Related content

content/journals/10.1049/el_19960662
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address