The Inria's Research Teams produce an annual Activity Report presenting their activities and their results of the year. These reports include the team members, the scientific program, the software developed by the team and the new results of the year. The report also describes the grants, contracts and the activities of dissemination and teaching. Finally, the report gives the list of publications of the year.
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. https://hal.inria.fr/hal-01044597
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 ] https://hal.archives-ouvertes.fr/hal-00937476
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 ] https://hal.inria.fr/hal-00825287
10A. Couvreur, A. Otmani, J.-P. Tillich. Polynomial Time Attack on Wild McEliece Over Quadratic Extensions, in: IEEE Transactions on Information Theory, January 2017, vol. 63, no 1, pp. 404–427. [
DOI : 10.1109/TIT.2016.2574841 ] https://hal.inria.fr/hal-01661935
13D. Augot, H. Chabanne, O. Clémot, W. George. Transforming face-to-face identity proofing into anonymous digital identity using the Bitcoin blockchain, in: PST2017 - International Conference on Privacy, Security and Trust, Calgary, Canada, August 2017, 10 p, https://arxiv.org/abs/1710.02951. https://hal.inria.fr/hal-01611297
14L. Grémy, A. Guillevic, F. Morain, E. Thomé. Computing discrete logarithms in , in: 24th Annual Conference on Selected Areas in Cryptography, Ottawa, Canada, August 2017. https://hal.inria.fr/hal-01624662
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. https://hal.inria.fr/hal-01674546
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. https://hal.inria.fr/hal-01633469
19M. Bardet, E. Barelli, O. Blazy, R. Canto Torres, A. Couvreur, P. Gaborit, A. Otmani, N. Sendrier, J.-P. Tillich. BIG QUAKE BInary Goppa QUAsi–cyclic Key Encapsulation, December 2017, submission to the NIST post quantum cryptography standardization process. https://hal.archives-ouvertes.fr/hal-01671866
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). https://hal.inria.fr/hal-01320496