Major publications by the team in recent years
  • 1D. Augot, M. Finiasz.

    Direct Construction of Recursive MDS Diffusion Layers using Shortened BCH Codes, in: 21st International Workshop on Fast Software Encryption, FSE 2014, London, United Kingdom, C. Cid, C. Rechberger (editors), springer, March 2014.

  • 2A. Couvreur, I. Márquez-Corbella, R. Pellikaan.

    A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems, in: Information Theory (ISIT), 2014 IEEE International Symposium on, Honolulu, United States, IEEE, June 2014, pp. 1446-1450. [ DOI : 10.1109/ISIT.2014.6875072 ]

  • 3A. Couvreur, A. Otmani, J.-P. Tillich.

    Polynomial Time Attack on Wild McEliece Over Quadratic Extensions, in: EUROCRYPT 2014, Copenhagen, Denmark, May 2014, pp. 17-39.

  • 4P. Lebacque, A. Zykin.

    On the Number of Rational Points of Jacobians over Finite Fields, in: Acta Arith., 2015, vol. 169, pp. 373–384.

  • 5F. Morain.

    Implementing the asymptotically fast version of the elliptic curve primality proving algorithm, in: Math. Comp., 2007, vol. 76, pp. 493–505.
  • 6B. Smith.

    Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves, in: J. of Cryptology, 2009, vol. 22, no 4, pp. 505-529.
  • 7B. Smith.

    Families of fast elliptic curves from Q-curves, in: Advances in Cryptology - ASIACRYPT 2013, Bangalore, India, K. Sako, P. Sarkar (editors), Lecture Notes in Computer Science, Springer, December 2013, vol. 8269, pp. 61-78. [ DOI : 10.1007/978-3-642-42033-7_4 ]

Publications of the year

Articles in International Peer-Reviewed Journals

International Conferences with Proceedings

Conferences without Proceedings

  • 16E. Barelli.

    On the security of Some Compact Keys for McEliece Scheme, in: WCC 2017 - The Tenth International Workshop on Coding and Cryptography, St Petersbourg, Russia, September 2017, pp. 1-9.

  • 17J. Lavauzelle.

    Constructions for efficient Private Information Retrieval protocols, in: WCC 2017 - The Tenth International Workshop on Coding and Cryptography, Saint-Petersbourg, Russia, Inria and SUAI and Skoltech, September 2017, pp. 1-12.


Other Publications

References in notes
  • 23A. Guillevic, F. Morain, E. Thomé.

    Solving discrete logarithms on a 170-bit MNT curve by pairing reduction, in: Selected Areas in Cryptography 2016, St. John's, Canada, R. Avanzi, H. Heys (editors), Selected Areas in Cryptography 2016, Springer, August 2016, to appear in the Lecture Notes in Computer Science (LNCS).