How to achieve a McEliece-based digital signature scheme NT Courtois, M Finiasz, N Sendrier International Conference on the Theory and Application of Cryptology and …, 2001 | 468 | 2001 |

MDPC-McEliece: New McEliece variants from moderate density parity-check codes R Misoczki, JP Tillich, N Sendrier, PSLM Barreto 2013 IEEE international symposium on information theory, 2069-2073, 2013 | 343 | 2013 |

On correlation-immune functions P Camion, C Carlet, P Charpin, N Sendrier Annual International Cryptology Conference, 86-100, 1991 | 318 | 1991 |

Security bounds for the design of code-based cryptosystems M Finiasz, N Sendrier International Conference on the Theory and Application of Cryptology and …, 2009 | 239 | 2009 |

Finding the permutation between equivalent linear codes: The support splitting algorithm N Sendrier IEEE Transactions on Information Theory 46 (4), 1193-1203, 2000 | 174 | 2000 |

Code-based cryptography R Overbeck, N Sendrier Post-quantum cryptography, 95-145, 2009 | 160 | 2009 |

Cryptanalysis of the original McEliece cryptosystem A Canteaut, N Sendrier International Conference on the Theory and Application of Cryptology and …, 1998 | 141 | 1998 |

McEliece cryptosystem implementation: Theory and practice B Biswas, N Sendrier International Workshop on Post-Quantum Cryptography, 47-62, 2008 | 108 | 2008 |

Decoding one out of many N Sendrier International Workshop on Post-Quantum Cryptography, 51-67, 2011 | 98 | 2011 |

Linear codes with complementary duals meet the Gilbert–Varshamov bound N Sendrier Discrete mathematics 285 (1-3), 345-347, 2004 | 98 | 2004 |

Linear codes with complementary duals meet the Gilbert–Varshamov bound N Sendrier Discrete mathematics 285 (1-3), 345-347, 2004 | 98 | 2004 |

A family of fast syndrome based cryptographic hash functions D Augot, M Finiasz, N Sendrier International Conference on Cryptology in Malaysia, 64-83, 2005 | 94 | 2005 |

Weak keys in the McEliece public-key cryptosystem P Loidreau, N Sendrier IEEE Transactions on Information Theory 47 (3), 1207-1211, 2001 | 92 | 2001 |

Studying the locator polynomials of minimum weight codewords of BCH codes D Augot, P Charpin, N Sendrier IEEE Transactions on Information Theory 38 (3), 960-973, 1992 | 74 | 1992 |

Studying the locator polynomials of minimum weight codewords of BCH codes D Augot, P Charpin, N Sendrier IEEE Transactions on Information Theory 38 (3), 960-973, 1992 | 74 | 1992 |

HAVEGE: A user-level software heuristic for generating empirically strong random numbers A Seznec, N Sendrier ACM Transactions on Modeling and Computer Simulation (TOMACS) 13 (4), 334-346, 2003 | 67 | 2003 |

On the dimension of the hull N Sendrier SIAM Journal on Discrete Mathematics 10 (2), 282-293, 1997 | 66 | 1997 |

Analysis of information set decoding for a sub-linear error weight RC Torres, N Sendrier Post-Quantum Cryptography, 144-161, 2016 | 56 | 2016 |

Encoding information into constant weight words N Sendrier Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005 | 51 | 2005 |

On the security of the McEliece public-key cryptosystem N Sendrier Information, coding and mathematics, 141-163, 2002 | 51 | 2002 |