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

Recovering lost efficiency of exponentiation algorithms on smart cards

Recovering lost efficiency of exponentiation algorithms on smart cards

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

At the RSA cryptosystem implementation stage, a major security concern is resistance against so-called side-channel attacks. Solutions are known but they increase the overall complexity by a non-negligible factor (typically, a protected RSA exponentiation is 133% slower). For the first time, protected solutions are proposed that do not penalise the running time of an exponentiation.

Inspec keywords: smart cards; public key cryptography; computational complexity

Other keywords: public-key encryption; exponentiation algorithms; smart cards; security; RSA cryptosystem implementation stage; side-channel attack resistance

Subjects: Cryptography theory; Cryptography; Data security

References

    1. 1)
      • F. Morain , J. Olivos . Speeding up the computations on an elliptic curve using addition–subtraction chains. Theor. Informat. Appl. , 531 - 543
    2. 2)
      • M. Joye , S.-M. Yen . Optimal left-to-right binary signed-digit recoding. IEEE Trans. Comput. , 740 - 748
    3. 3)
      • `PKCS 1 v2.0 RSA cryptography standard', , October 1998, Available at http://www.rsa.com/rsalabs/pubs/PKCS/html/pkcs-1.html.
    4. 4)
      • Kocher, P., Jaffe, J., Jun, B.: `Differential power analysis', Advances in Cryptology—CRYPTO'99, Lect. Notes Comput. Sci., 1666, p. 388–397.
    5. 5)
      • D.E. Knuth . (1981) The art of computer programming/seminumerical algorithms.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20020748
Loading

Related content

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