Side channels in the McEliece PKC

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

Volumn 5299 LNCS, Issue , 2008, Pages 216-229

  Strenzke, Falko ^a   Tews, Erik ^b   Molter, H Gregor ^b   Overbeck, Raphael ^c   Shoufan, Abdulhadi ^b  

^a Flexsecure GmbH   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^c EPFL   (Switzerland)

Author keywords

Post quantum cryptography; Side channel attack; Timing attack

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY; QUANTUM THEORY;

CACHE ATTACK; CRITICAL SYSTEMS; IMPLEMENTATION ASPECTS; KEY GENERATION; MCELIECE PUBLIC-KEY CRYPTOSYSTEM; POST QUANTUM CRYPTOGRAPHY; QUANTUM ALGORITHMS; SOFTWARE IMPLEMENTATION;

SIDE CHANNEL ATTACK;

EID: 56749169082     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88403-3_15     Document Type: Conference Paper

References (24)

1. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory 22(6), 644-654 (1976)
2. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120-126 (1978)
3. Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417-426. Springer, Heidelberg (1986)
4. ElGamal, T.: A Public Key Cryptosystem and A Signature Based on Discrete Logarims. IEEE Transactions on Information Theory (1985)
5. Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings, 35-th Annual Symposium on Foundation of Computer Science (1994)
6. Shor, P.W.: Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26(5), 1484-1509 (1997)
7. Proos, J., Zalka, C.: Shor's discrete logarithm quantum algorithm for elliptic curves, Technical Report quant-ph/0301141, arXiv (2006)
8. Merkle, R.: A Certified Digital Signature. In: Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology, pp. 218-238 (1989)
9. Buchmann, J., Garcia, L., Dahmen, E., Doering, M., Klintsevich, E.: CMSS-An Improved Merkle Signature Scheme. In: 7th International Conference on Cryptology in India-Indocrypt, vol. 6, pp. 349-363 (2006)
10. McEliece, R.J.: A public key cryptosystem based on algebraic coding theory. DSN progress report 42-44, 114-116 (1978)
11. Korbara, K., Imai, H.: Semantically secure McEliece public-key cryptosystems -conversions for McEliece PKC In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992. Springer, Heidelberg (2001)
12. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
13. Kocher, P.: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In: Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, pp. 104-113 (1996)
14. Kocher, P.: Differential Power Analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS. vol. 1666. pp. 388-397. Springer, Heidelberg (1999)
15. Tsunoo, Y., Tsujihara, E., Minematsu, K., Miyauchi, H.: Cryptanalysis of Block Ciphers Implemented on Computers with Cache. In: International Symposium on Information Theory and Applications, pp. 803-806 (2002)
16. Schindler, W., Lemke, K., Paar, C.: A Stochastic Model for Differential Side Channel Cryptanalysis. In: Rao. J.R., Sunar. B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 30-46. Springer, Heidelberg (2005)
17. MacWilliams, F.J., Sloane, N.J.A.: The theory of error correcting codes. North-Holland, Amsterdam (1997)
18. Goppa, V.D.: A new class of linear correcting codes. Problems of Information Transmission 6, 207-212 (1970)
19. Engelbert, D., Overbeck, R., Schmidt, A.: A Summary of McEliece-Type Cryptosystems and their Security. Journal of Mathematical Cryptology (2006) (accepted for publication)
20. Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH-codes of length 511. IEEE Transactions on Information Theory 44(1), 367-378 (1998)
21. Pointcheval. D.: Chosen-chipertext security for anyone-way cryptosystem. In: Imai, H., Zheng. Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 129-146. Springer, Heidelberg (2000)
22. Percival, C.: Cache missing for fun and profit, http://www.daemonology. net/papers/htt.pdf
23. Schindler, W., Aciiçmez, O.: A Vulnerability in RSA Implementations due to Instruction Cache Analysis and its Demonstration on OpenSSL. In: Malkin, T. (ed.) CT-RSA 2008. LNCS. vol. 4964, Springer, Heidelberg (2008)
24. Aciiçmez, O., Seifert, J.P., Koç. Ç.: Predicting secret keys via branch prediction. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377. Springer, Heidelberg (2007)