Practical power analysis attacks on software implementations of McEliece. The McEliece public-key cryptosystem is based on the fact that decoding unknown linear binary codes is an NP-complete problem. The interest on implementing post-quantum cryptographic algorithms, e.g. McEliece, on microprocessor-based platforms has been extremely raised due to the increasing storage space of these platforms. Therefore, their vulnerability and robustness against physical attacks, e.g., state-of-the-art power analysis attacks, must be investigated. In this work, we address mainly two power analysis attacks on various implementations of McEliece on an 8-bit AVR microprocessor. To the best of our knowledge, this is the first time that such side-channel attacks are practically evaluated.

References in zbMATH (referenced in 197 articles , 1 standard article )

Showing results 1 to 20 of 197.
Sorted by year (citations)

1 2 3 ... 8 9 10 next

  1. Aragon, Nicolas; Blazy, Olivier; Deneuville, Jean-Christophe; Gaborit, Philippe; Lau, Terry Shue Chien; Tan, Chik How; Xagawa, Keita: Cryptanalysis of a rank-based signature with short public keys (2020)
  2. Cascudo, Ignacio; Gundersen, Jaron Skovsted; Ruano, Diego: Squares of matrix-product codes (2020)
  3. Yardi, Arti D.; Vijayakumaran, Saravanan: Properties of syndrome distribution for blind reconstruction of cyclic codes (2020)
  4. Aydin, Nuh; Lambrinos, Jonathan; VandenBerg, Oliver: On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes (2019)
  5. Deundyak, Vladimir Mikhaĭlovich; Kosolapov, Yuriĭ Vladimirovich: The use of the direct sum decomposition algorithm for analyzing the strength of some McEliece-type cryptosystems (2019)
  6. Liu, Xiangxin; Yang, Xiaoyuan; Han, Yiliang; Wang, Xu An: A secure and efficient code-based signature scheme (2019)
  7. Li, Zhe; Xing, Chaoping; Yeo, Sze Ling: Reducing the key size of McEliece cryptosystem from automorphism-induced Goppa codes via permutations (2019)
  8. Magamba, Kondwani; Ryan, John A.: Counting extended irreducible Goppa codes (2019)
  9. Martínez-Peñas, Umberto: Theory of supports for linear codes endowed with the sum-rank metric (2019)
  10. Micheli, Giacomo; Weger, Violetta: Cryptanalysis of the CLR-cryptosystem (2019)
  11. Rzaev, Kh. N.: Mathematical models of modified crypto-code means of information protection based on coding theory schemes (2019)
  12. Zajac, Pavol: Hybrid encryption from McEliece cryptosystem with pseudo-random error vector (2019)
  13. Banegas, Gustavo; Barreto, Paulo S. L. M.; Boidje, Brice Odilon; Cayrel, Pierre-Louis; Dione, Gilbert Ndollane; Gaj, Kris; Gueye, Cheikh Thiécoumba; Haeussler, Richard; Klamti, Jean Belo; N’diaye, Ousmane; Nguyen, Duc Tri; Persichetti, Edoardo; Ricardini, Jefferson E.: DAGS: key encapsulation using dyadic GS codes (2018)
  14. Deundyak, Vladimir Mikhaĭlovich; Kosolapov, Yuriĭ Vladimirovich: On the Berger-Loidreau cryptosystem on the tensor product of codes (2018)
  15. Fabšič, Tomáš; Grošek, Otokar; Nemoga, Karol; Zajac, Pavol: On generating invertible circulant binary matrices with a prescribed number of ones (2018)
  16. Gaborit, Philippe; Otmani, Ayoub; Kalachi, Hervé Talé: Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes (2018)
  17. Horlemann-Trautmann, Anna-Lena; Marshall, Kyle; Rosenthal, Joachim: Extension of Overbeck’s attack for Gabidulin-based cryptosystems (2018)
  18. Leont’ev, V. K.; Gordeev, E. N.: On the number of roots of Boolean polynomials (2018)
  19. Morozov, Kirill; Roy, Partha Sarathi; Steinwandt, Rainer; Xu, Rui: On the security of the Courtois-Finiasz-Sendrier signature (2018)
  20. Otmani, Ayoub; Kalachi, Hervé Talé; Ndjeya, Sélestin: Improved cryptanalysis of rank metric schemes based on Gabidulin codes (2018)

1 2 3 ... 8 9 10 next