McEliece

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 180 articles , 1 standard article )

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

1 2 3 ... 7 8 9 next

  1. 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)
  2. Fabšič, Tomáš; Grošek, Otokar; Nemoga, Karol; Zajac, Pavol: On generating invertible circulant binary matrices with a prescribed number of ones (2018)
  3. Gaborit, Philippe; Otmani, Ayoub; Kalachi, Hervé Talé: Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes (2018)
  4. Horlemann-Trautmann, Anna-Lena; Marshall, Kyle; Rosenthal, Joachim: Extension of Overbeck’s attack for Gabidulin-based cryptosystems (2018)
  5. Leont’ev, V. K.; Gordeev, E. N.: On the number of roots of Boolean polynomials (2018)
  6. Morozov, Kirill; Roy, Partha Sarathi; Steinwandt, Rainer; Xu, Rui: On the security of the Courtois-Finiasz-Sendrier signature (2018)
  7. Otmani, Ayoub; Kalachi, Hervé Talé; Ndjeya, Sélestin: Improved cryptanalysis of rank metric schemes based on Gabidulin codes (2018)
  8. Raviv, Netanel; Yaakobi, Eitan; Médard, Muriel: Coding for locality in reconstructing permutations (2018)
  9. Alamélou, Quentin; Blazy, Olivier; Cauchie, Stéphane; Gaborit, Philippe: A code-based group signature scheme (2017)
  10. Berger, Thierry P.; Gueye, Cheikh Thiécoumba; Klamti, Jean Belo: A NP-complete problem in coding theory with application to code based cryptography (2017)
  11. Bolkema, Jessalyn; Gluesing-Luerssen, Heide; Kelley, Christine A.; Lauter, Kristin E.; Malmskog, Beth; Rosenthal, Joachim: Variations of the McEliece cryptosystem (2017)
  12. Cayrel, Pierre-Louis; Gueye, Cheikh Thiecoumba; Mboup, El Hadji Modou; Ndiaye, Ousmane; Persichetti, Edoardo: Efficient implementation of hybrid encryption from coding theory (2017)
  13. Cayrel, Pierre-Louis; Meziani, Mohammed; Ndiaye, Ousmane; Lindner, Richard; Silva, Rosemberg: A pseudorandom number generator based on worst-case lattice problems (2017)
  14. Costello, Craig; Jao, David; Longa, Patrick; Naehrig, Michael; Renes, Joost; Urbanik, David: Efficient compression of SIDH public keys (2017)
  15. Couvreur, Alain; Márquez-Corbella, Irene; Pellikaan, Ruud: Cryptanalysis of McEliece cryptosystem based on algebraic geometry codes and their subcodes (2017)
  16. Fabšič, Tomáš; Hromada, Viliam; Stankovski, Paul; Zajac, Pavol; Guo, Qian; Johansson, Thomas: A reaction attack on the QC-LDPC McEliece cryptosystem (2017)
  17. García-Planas, María Isabel; Magret, Maria Dolors; Um, Laurence Emilie: Monomial codes seen as invariant subspaces (2017)
  18. Gueye, Cheikh Thiécoumba; Klamti, Jean Belo; Hirose, Shoichi: Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field (\mathbbF_q) (2017)
  19. Horlemann-Trautmann, Anna-Lena; Marshall, Kyle: New criteria for MRD and Gabidulin codes and some rank-metric code constructions (2017)
  20. Li, Shuxing: The minimum distance of some narrow-sense primitive BCH codes (2017)

1 2 3 ... 7 8 9 next