Enhancing Simple Power-Analysis Attacks on Elliptic Curve Cryptosystems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2523, Issue , 2003, Pages 82-97

  Oswald, Elisabeth ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; EMBEDDED SYSTEMS; GEOMETRY; HARDWARE; MARKOV PROCESSES;

ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEMS; ELLIPTIC CURVE POINT MULTIPLICATIONS; MARKOV MODEL; SIMPLE POWER ANALYSIS; SUBTRACTION ALGORITHMS; SUBTRACTION METHOD;

SIDE CHANNEL ATTACK;

EID: 35248821853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36400-5_8     Document Type: Article

References (23)

1. [ANS99] ANSI. ANSI X9.62 Public Key Cryptography for the Financal Services Industry:The Elliptic Curve Digital Signatur Algorithm (ECDSA), 1999.
2. [BHLM01] Michael Brown, Darrel Hankerson, Julio Lopez, and Alfred Menezes. Software Implementation of the NIST Elliptic Curves Over Prime Fields. In Progress in Cryptology - CT-RSA, volume 2020 of Lecture Notes in Computer Science, pages 250-265. Springer, 2001.
3. [BJ02] E. Brier and M. Joye. Weierstrass Elliptic Curves and Side-Channel Attacks. In Public Key Cryptography, volume 2274 of Lecture Notes in Computer Science, page 335 ff. Springer, 2002.
4. [Cer00] Certicom Research. Standards For Efficient Cryptography - SECG 2: Recommended Elliptic Curve Cryptography Domain Parameters. Version 1.0, 2000. Available from http://www.secg.org/.
5. [Cor99] J.-S. Coron. Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems. In Workshop on Cryptographic Hardware and Embedded Systems - CHES 1999, volume 1717 of Lecture Notes in Computer Science, pages 292-302. Springer, 1999.
6. [Gor98] D. M. Gordon. A survey of fast exponentiation methods. Journal of Algorithms, (27): pp. 129-146, 1998.
7. [GS92] Geoffrey Grimmett and David Stirzaker. Probability and Random Processes. Oxford University Press, 2nd edition, 1992. ISBN: 0198536658.
8. [Has00] M. A. Hasan. Power Analysis Attacks and Algorithmic Approaches to Their Countermeasures for Koblitz Cryptosystems. In Cryptographic Hardware and Embedded Systems - CHES 2000, volume 1965 of Lecture Notes in Computer Science, pages 93-108. Springer, 2000.
9. [HGS01] N. Howgrave-Graham and N. Smart. Lattice attacks on digital signature schemes. Designs, Codes and Cryptography, (23):283-290, August 2001.
10. [IEE99] IEEE. Standard Specifications for Public Key Cryptography, Annex A, D13, 1999.
11. [IT02] T. Izu and T. Takagi. Fast Parallel Elliptic Curve Multiplications Resistant to Side Channel Attacks. In to appear in International Workshop on the Practice and Theory of Public Key Cryptography (PKC2002), Lecture Notes in Computer Science (LNCS). Springer, 2002.
12. [JQ01] M. Joye and J.-J. Quisquater. Hessian Elliptic Curves and Side-Channel Attacks. In Cryptographic Hardware and Embedded Systems - CHES 2001, volume 2162 of Lecture Notes in Computer Science, pages 402-410, 2001.
13. [KJJ99] P. C. Kocher, J. Jaffe, and B. Jun. Differential Power Analysis. In Advances in Cryptology-CRYPTO 1999, volume 1666 of Lecture Notes in Computer Science, pages 388-397. Springer, 1999.
14. [Knu98] D. E. Knuth. The Art of Computer Programming. Seminumerical Algorithms, volume 2. Addison-Wesley, 3rd edition, 1998.
15. [LS01] P.-Y. Liardet and N.P. Smart. Preventing SPA/DPA in ECC Systems Using the Jacobi Form. In Cryptographic Hardware and Embedded Systems - CHES 2001, volume 2162 of Lecture Notes in Computer Science, pages 391-401, 2001.
16. [MO90] F. Morain and J. Olivos. Speeding up the computation on an elliptic curve using addition-subtraction chains. Inform. Theory Appl., (24):531-543, 1990.
17. [Möl01] B. Möller. Securing Elliptic Curve Point Multiplication against Side-Channel Attacks. In Information Security - 4th International Conference, ISO 2001, volume 2200 of Lecture Notes in Computer Science (LNCS), page 324 ff. Springer, 2001.
18. [NIS99] NIST. Recommended Elliptic Curves For Federal Government Use, 1999.
19. [OA01] E. Oswald and M. Aigner. Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks. In Cryptographic Hardware and Embedded Systems - CHES S001, volume 2162 of Lecture Notes in Computer Science (LNCS), pages 39-50. Springer, 2001.
20. m). In Cryptographic Hardware and Embedded Systems - CHES 2000, volume 1965 of Lecture Notes in Computer Science, pages 41-56. Springer, 2000.
21. [OS00] K. Okeya and K. Sakurai. Power Analysis Breaks Elliptic Curve Cryptosystems even Secure against the Timing Attack. In Progress in Cryptology - INDOCRYPT 2000, volume 1977 of Lecture Notes in Computer Science (LNCS), pages 178-190. Springer, 2000.
22. [QS01] Jean-Jacques Quisquater and David Samyde. ElectroMagnetic Analysis (EMA): Measures and Counter-Measures for Smart Cards. In Smart Card Programming and Security, E-smart 2001, volume 2140 of Lecture Notes in Computer Science, pages 200-210. Springer, 2001.
23. [RS01] T. Römer and J.-P. Seifert. Information leakage attacks against Smart Card implementations of the Elliptic Curve Digital Signature Algorithm. In Smart Card Programming and Security (E-Smart 2001), volume 2104 of Lecture Notes in Computer Science (LNCS), page 211 ff. Springer, 2001.