Efficient countermeasures against RPA, DPA, and SPA

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

Volumn 3156, Issue , 2004, Pages 343-356

  Mamiya, Hideyo ^a   Miyaji, Atsuko ^a   Morimoto, Hiroaki ^a  

^a HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; ELECTRIC POWER UTILIZATION; EMBEDDED SYSTEMS; GEOMETRY; PUBLIC KEY CRYPTOGRAPHY; SMART CARDS; TRANSPORTATION; UNMANNED AERIAL VEHICLES (UAV);

DIFFERENTIAL POWER ANALYSIS; ELLIPTIC CURVE CRYPTOSYSTEMS; EXPONENTIATION ALGORITHMS; EXPONENTIATIONS; PUBLIC KEY CRYPTOSYSTEMS; REFINED POWER ANALYSIS; SIMPLE POWER ANALYSIS; ZERO-VALUE POINT ATTACK;

SIDE CHANNEL ATTACK;

EID: 35048860937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28632-5_25     Document Type: Article

References (32)

1. K. Araki and T. Satoh "Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves", Commentarii Math. Univ. St. Pauli., vol. 47 (1998), 81-92.
2. T. Akishita and T. Takagi, "Zero-value Point Attacks on Elliptic Curve Cryptosystem", ISC2003, Lecture Notes in Computer Science, 2851(2003), Springer-Verlag, 218-233.
3. C. Clavier and M. Joye, "Universal exponentiation algorithm - A first step towards provable SPA-resistance -", CHES2001, Lecture Notes in Computer Science, 2162(2001), Springer-Verlag, 300-308.
4. M. Ciet and M. Joye, "(Virtually) Free randomization technique for elliptic curve cryptography", ICICS2003, Lecture Notes in Computer Science, 2836(2003), Springer-Verlag, 348-359.
5. H. Cohen, A. Miyaji and T. Ono, "Efficient elliptic curve exponentiation using mixed coordinates", Advances in Cryptology-Proceedings of ASIACRYPT'98, Lecture Notes in Computer Science, 1514(1998), Springer-Verlag, 51-65.
6. J. Coron, "Resistance against differential power analysis for elliptic curve cryptosystem", CHES'99, Lecture Notes in Computer Science, 1717(1999), Springer-Verlag, 292-302.
7. G. Prey and H. G. Rück, "A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves", Mathematics of computation, 62(1994), 865-874.
8. "Proposed federal information processing standard for digital signature standard (DSS)", Federal Register, 56 No. 169, 30 Aug 1991, 42980-42982.
9. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms", IEEE Trans. Inform. Theory, IT-31 (1985), 469-472.
10. L. Goubin, "A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems", PKC2003, Lecture Notes in Computer Science, 2567(2003), Springer-Verlag, 199-210.
11. K. Itoh, M. Takenaka, N. Torii, S. Temma, and Y. Kurihara, "Fast implementation of public-key cryptography on DSP TMS320C6201", CHES'99, Lecture Notes in Computer Science, 1717(1999), Springer-Verlag, 61-72.
12. K. Itoh, T. Izu, and M. Takenaka, "Efficient countermeasures against power analysis for elliptic curve cryptosystems", SCIS2004, 2004 (previous version). The final version will be appeared in the proceedings of CARDIS 2004.
13. M. Joye and C. Tymen, "Protections against Differential Analysis for Elliptic Curve Cryptosystem", CHES2001, Lecture Notes in Computer Science, 2162(2001), Springer-Verlag, 377-390.
14. N. Koblitz, "Elliptic curve cryptosystems", Mathematics of Computation, 48 (1987), 203-209.
15. C. Kocher, "Timing attacks on Implementations of Diffie-Hellman, RSA, DSS, and other system", CRYPTO'96, Lecture Notes in Computer Science, 1109(1996), Springer-Verlag, 104-113.
16. C. Kocher, J. Jaffe, and B. Jun, "Differential power analysis", Crypto'99, Lecture Notes in Computer Science, 1666(1999), Springer-Verlag, 388-397.
17. D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, 1981.
18. K. Koyama and Y. Tsuruoka, "Speeding up elliptic cryptosystems by using a signed binary window method", Advances in Cryptology-Proceedings of Crypto'92, Lecture Notes in Computer Science, 740 (1993), Springer-Verlag, 345-357.
19. A. Menezes, T. Okamoto and S. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field", Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (1991), 80-89.
20. V. S. Miller, "Use of elliptic curves in cryptography", Advances in Cryptology-Proceedings of Crypto'85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417-426.
21. B. Möller, "Securing Elliptic Curve Point Multiplication against Side-Channel Attacks", ISC2001, Lecture Notes in Computer Science, 2200(2001), Springer-Verlag, 324-334.
22. B. Möller, "Parallelizable Elliptic Curve Point Multiplication Method with Resistance against Side-Channel Attacks", ISC2002, Lecture Notes in Computer Science, 2433(2002), Springer-Verlag, 402-413.
23. P. L. Montgomery, "Speeding the Pollard and elliptic curve methods for factorization", Mathematics of Computation, 48(1987), 243-264.
24. K. Okeya and T. Takagi, "The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks", CT-RSA2003, Lecture Notes in Computer Science, 2612(2003), Springer-Verlag, 328-342.
25. S. C. Pohlig and M. E. Hellman, "An improved algorithm for computing logarithms over GF(p) and its cryptographic significance", IEEE Trans. Inf. Theory, IT-24 (1978), 106-110.
26. J. Pollard, "Monte Carlo methods for index computation (mod p)", Mathematics of Computation, 32 (1978), 918-924.
27. R. Rivest, A. Shamir and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems", Communications of the ACM, 21 No. 2 (1978), 120-126.
28. Roberto M. Avanzi, "On multi-exponentiation in cryptography", Cryptology ePrint Archive, Report 2002/154, http://eprint.iacr.org/2002/154/ , 2002.
29. N. P. Smart "The discrete logarithm problem on elliptic curves of trace one", to appear in J. Cryptology.
30. N. P. Smart "An Analysys of Goubin's Refined Power Analysis Attack", CHES2003, Lecture Notes in Computer Science, 2779(2003), Springer-Verlag, 281-290.
31. I. A. Semaev "Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p", Mathematics of computation, 67 (1998), 353-356.
32. J. A. Solinas, "Low-Weight Binary Representation for Pairs of Integers", Centre for Applied Cryptographic Research, University of Waterloo, Combinatorics and Optimization Reseach Report CORR 2001-41, 2001.