Cache-timing template attacks

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

Volumn 5912 LNCS, Issue , 2009, Pages 667-684

  Brumley, Billy Bob ^a   Hakala, Risto M ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Cache timing attacks; Elliptic curve cryptography; Side channel attacks

Indexed keywords

AUTOMATED ANALYSIS; CRITICAL SOFTWARE; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHY; KEY MATERIALS; KEY RECOVERY; OPEN SSL; SIDE CHANNEL ATTACK; SIDE-CHANNEL; TEMPLATE ATTACKS; TIMING ATTACKS;

GEOMETRY; HIDDEN MARKOV MODELS; NETWORK SECURITY; TIME MEASUREMENT; VECTOR QUANTIZATION;

CRYPTOGRAPHY;

EID: 72449122383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10366-7_39     Document Type: Conference Paper

References (31)

1. Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104-113. Springer, Heidelberg (1996)
2. Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388-397. Springer, Heidelberg (1999)
3. Page, D.: Defending against cache based side-channel attacks. Information Security Technical Report 8(1), 30-44 (2003)
4. Oswald, E.: Enhancing simple power-analysis attacks on elliptic curve cryptosystems. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 82-97. Springer, Heidelberg (2003)
5. Karlof, C., Wagner, D.: HiddenMarkov model cryptanalysis. In:Walter, C.D., Koç, Ç.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 17-34. Springer, Heidelberg (2003)
6. Green, P.J., Noad, R., Smart, N.P.: Further hidden Markov model cryptanalysis. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 61-74. Springer, Heidelberg (2005)
7. Chari, S., Rao, J.R., Rohatgi, P.: Template attacks. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 13-28. Springer, Heidelberg (2003)
8. Medwed, M., Oswald, E.: Template attacks on ECDSA. In: Chung, K.-I., Sohn, K., Yung, M. (eds.) WISA 2008. LNCS, vol. 5379, pp. 14-27. Springer, Heidelberg (2009)
9. Percival, C.: Cache missing for fun and profit (2005), http://www.daemonology.net/papers/cachemissing.pdf
10. Hlavác, M., Rosa, T.: Extended hidden number problem and its cryptanalytic applications. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol. 4356, pp. 114-133. Springer, Heidelberg (2007)
11. Bernstein, D.J.: Cache-timing attacks on AES (2004), http://cr.yp.to/ papers.html#cachetiming
12. Osvik, D.A., Shamir, A., Tromer, E.: Cache attacks and countermeasures: The case of AES. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 1-20. Springer, Heidelberg (2006)
13. Möller, B.: Algorithms for multi-exponentiation. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 165-180. Springer, Heidelberg (2001)
14. Möller, B.: Improved techniques for fast exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 298-312. Springer, Heidelberg (2003)
15. Bosma, W.: Signed bits and fast exponentiation. Journal de Théorie des Nombres de Bordeaux 13(1), 27-41 (2001)
16. Kohonen, T.: Self-Organizing Maps. Springer, Heidelberg (1995)
17. Lloyd, S.: Least squares quantization in PCM. IEEE Transactions on Information Theory 28(2), 129-137 (1982)
18. Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 77(2), 257-286 (1989)
19. Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 13(2), 260-269 (1967)
20. Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. The Annals of Mathematical Statistics 41(1), 164-171 (1970)
21. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, 5th edn. CRC Press, Boca Raton (2001)
22. Howgrave-Graham, N., Smart, N.P.: Lattice attacks on digital signature schemes. Designs, Codes and Cryptography 23(3), 283-290 (2001)
23. Nguyen, P.Q., Shparlinski, I.: The insecurity of the elliptic curve digital signature algorithm with partially known nonces. Designs, Codes and Cryptography 30(2), 201-217 (2003)
24. Leadbitter, P.J., Page, D., Smart, N.P.: Attacking DSA under a repeated bits assumption. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 428-440. Springer, Heidelberg (2004)
25. Coron, J.S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 292-302. Springer, Heidelberg (1999)
26. Clavier, C., Joye, M.: Universal exponentiation algorithm: a first step towards provable SPA-resistance. In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 300-308. Springer, Heidelberg (2001)
27. Möller, B.: Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 402-413. Springer, Heidelberg (2002)
28. Oswald, E., Aigner, M.: Randomized addition-subtraction chains as a countermeasure against power attacks. In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 39-50. Springer, Heidelberg (2001)
29. Walter, C.D.: Randomized exponentiation algorithms. In: Koç, Ç.K. (ed.) Cryptographic Engineering. Springer, Heidelberg (2009)
30. Viega, J., Messier, M., Chandra, P.: Network Security with OpenSSL. O'Reilly Media, Inc., Sebastopol (2002)
31. Chevallier-Mames, B., Ciet, M., Joye, M.: Low-cost solutions for preventing simple side-channel analysis: Side-channel atomicity. IEEE Transactions on Computers 53(6), 760-768 (2004)