A. Hauteville and J. P. Tillich, New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem, 2015 IEEE International Symposium on Information Theory (ISIT), pp.2747-2751, 2015.
DOI : 10.1109/ISIT.2015.7282956
URL : https://hal.archives-ouvertes.fr/hal-01244619

P. Gaborit, A. Hauteville, and J. P. Tillich, RankSynd a PRNG Based on Rank Metric, International Workshop on Post-Quantum Cryptography, pp.18-28, 2016.
DOI : 10.1007/978-3-319-29360-8_2
URL : https://hal.archives-ouvertes.fr/hal-01289338

P. Gaborit, A. Hauteville, D. H. Phan, and J. P. Tillich, Identity-Based Encryption from Codes with Rank Metric, Annual International Cryptology Conference, pp.194-224, 2017.
DOI : 10.1007/11426639_7
URL : https://hal.archives-ouvertes.fr/hal-01589463

P. En-cours-de-rédaction-nicolas-aragon, A. Gaborit, J. Hauteville, and . Tillich, Improvement of Generic Attacks on the Rank Syndrome Decoding Problem, pp.2017-01618463

S. Bibliographie1, D. Agrawal, X. Boneh, and . Boyen, EEcient lattice (H)IBE in the standard model, LNCS, vol.6110, pp.553-572, 2010.

C. Aguilar-melchor, O. Blazy, J. Deneuville, P. Gaborit, and G. Zémor, EEcient encryption from random quasi-cyclic codes, 1612.

A. Banerjee, C. Peikert, and A. Rosen, Pseudorandom Functions and Lattices, Advances in Cryptology?EUROCRYPT 2012, pp.719-737, 2012.
DOI : 10.1007/978-3-642-29011-4_42
URL : http://www.eecs.harvard.edu/%7Ealon/PAPERS/prf-lattice/prf-lattice.pdf

R. Barbulescu, P. Gaudry, A. Joux, and E. Thomé, A heuristic quasi-polynomial algorithm for discrete logarithm in nite elds of small characteristic, Advances in Cryptology -EUROCRYPT 2014, pp.1-16, 2014.

S. L. Paulo, R. Barreto, M. A. Misoczki, . Jr, and . Simplicio, One-time signature scheme from syndrome decoding over generic error-correcting codes, Journal of Systems and Software, vol.84, issue.2, pp.198-204, 2011.

C. Berbain, H. Gilbert, and J. Patarin, QUAD: A Practical Stream Cipher with Provable Security, Advances in Cryptology-EUROCRYPT 2006, pp.109-128, 2006.
DOI : 10.1109/SFCS.1982.45

P. Thierry, P. Berger, and . Loidreau, Security of the Niederreiter form of the GPT public-key cryptosystem, Proc. IEEE Int. Symposium Inf. Theory -ISIT 2002, p.267, 2002.

E. Berlekamp, R. Mceliece, and H. Van-tilborg, On the inherent intractability of certain coding problems (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.3, pp.384-386, 1978.
DOI : 10.1109/TIT.1978.1055873

J. Daniel and . Bernstein, Grover vs. McEliece, LNCS, vol.6061, pp.73-80, 2010.

L. Bettale, Cryptanalyse algébrique : outils et applications, 2012.

L. Blum, M. Blum, and M. Shub, A Simple Unpredictable Pseudo-Random Number Generator, SIAM Journal on Computing, vol.15, issue.2, pp.364-383, 1986.
DOI : 10.1137/0215025

M. Blum and S. Micali, How to Generate Cryptographically Strong Sequences of Pseudorandom Bits, SIAM Journal on Computing, vol.13, issue.4, pp.850-864, 1984.
DOI : 10.1137/0213053

D. Boneh, The decision Diie-Hellman problem, International Algorithmic Number Theory Symposium, pp.48-63, 1998.

D. Boneh and X. Boyen, EEcient selective-ID secure identity based encryption without random oracles, LNCS, vol.3027, pp.223-238, 2004.
DOI : 10.1007/978-3-540-24676-3_14
URL : http://robotics.stanford.edu/~xb/eurocrypt04b/bbibe.ps

D. Boneh and X. Boyen, Secure Identity Based Encryption Without Random Oracles, LNCS, vol.3152, pp.443-459, 2004.
DOI : 10.1007/978-3-540-28628-8_27
URL : http://theory.stanford.edu/~dabo/abstracts/../papers/sibewro.pdf

D. Boneh and M. K. Franklin, Identity-based encryption from the Weil pairing, LNCS, vol.2139, pp.213-229, 2001.

X. Boyen, Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More, PKC 2010, pp.499-517, 2010.
DOI : 10.1007/978-3-642-13013-7_29

M. Boyer, G. Brassard, P. Høyer, and A. Tapp, Tight Bounds on Quantum Searching, Fortschritte der Physik, vol.46, issue.4-5, p.493, 1998.
DOI : 10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P
URL : http://arxiv.org/pdf/quant-ph/9605034

J. F. Buss, G. S. Frandsen, and J. O. Shallit, The Computational Complexity of Some Problems of Linear Algebra, Journal of Computer and System Sciences, vol.58, issue.3, pp.572-596, 1999.
DOI : 10.1006/jcss.1998.1608

R. Canetti, S. Halevi, and J. Katz, A Forward-Secure Public-Key Encryption Scheme, Journal of Cryptology, vol.20, issue.3, pp.265-294, 2007.
DOI : 10.1007/s00145-006-0442-5

D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, Bonsai trees, or how to delegate a lattice basis, LNCS, vol.6110, pp.523-552, 2010.

P. Cayrel, A. Otmani, and D. Vergnaud, On Kabatianskii-Krouk-Smeets Signatures, Arithmetic of Finite Fields -WAIFI 2007, pp.237-251, 2007.
DOI : 10.1007/978-3-540-73074-3_18
URL : https://hal.archives-ouvertes.fr/hal-00259021

C. Cocks, An Identity Based Encryption Scheme Based on Quadratic Residues, 8th IMA International Conference on Cryptography and Coding, pp.360-363, 2001.
DOI : 10.1007/3-540-45325-3_32

N. Courtois, M. Finiasz, and N. Sendrier, How to Achieve a McEliece-Based Digital Signature Scheme, LNCS, vol.2248, pp.157-174, 2001.
DOI : 10.1007/3-540-45682-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072511

R. Cramer, L. Ducas, C. Peikert, and O. Regev, Recovering Short Generators of Principal Ideals in Cyclotomic Rings, Advances in Cryptology -EU- ROCRYPT 2016, pp.559-585, 2016.
DOI : 10.1007/978-3-662-49896-5_20

P. Delsarte, Bilinear forms over a finite field, with applications to coding theory, Journal of Combinatorial Theory, Series A, vol.25, issue.3, pp.226-241, 1978.
DOI : 10.1016/0097-3165(78)90015-8

J. Deneuville, P. Gaborit, and G. Zémor, Ouroboros: A Simple, Secure and Efficient Key Exchange Protocol Based on Coding Theory, International Workshop on Post-Quantum Cryptography, pp.18-34, 2017.
DOI : 10.1007/978-3-642-25405-5_4

W. Diie and M. Hellman, New directions in cryptography, IEEE transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.

T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, LNCS, vol.84, issue.196, pp.10-18, 1984.

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, Computing loci of rank defects of linear matrices using gröbner bases and applications to cryptology, ISSAC, 2010, Proceedings, pp.257-264, 2010.

J. Faugère, F. Levy-dit, L. Vehel, and . Perret, Cryptanalysis of Minrank Advances in Cryptology -CRYPTO, LNCS, vol.5157, pp.280-296, 2008.

J. Faugère, A. Otmani, L. Perret, J. Frédéric-de-portzamparc, and . Tillich, Structural weakness of compact variants of the McEliece cryptosystem, 2014 IEEE International Symposium on Information Theory, pp.1717-1721, 2014.
DOI : 10.1109/ISIT.2014.6875127

J. Faugère, A. Otmani, L. Perret, J. Frédéric-de-portzamparc, and . Tillich, Structural cryptanalysis of McEliece schemes with compact keys, Designs, Codes and Cryptography, vol.79, issue.1, pp.87-112, 2016.
DOI : 10.1007/BFb0019850

J. Fischer and J. Stern, An eecient pseudo-random generator provably as secure as syndrome decoding, Advances in Cryptology -EUROCRYPT'96, pp.245-255, 1996.
DOI : 10.1007/3-540-68339-9_22
URL : https://link.springer.com/content/pdf/10.1007%2F3-540-68339-9_22.pdf

E. Mukhamedovich-gabidulin, Theory of codes with maximum rank distance, Problemy Peredachi Informatsii, vol.21, issue.1, pp.3-16, 1985.

M. Ernst, A. V. Gabidulin, B. Ourivski, B. Honary, and . Ammar, Reducible rank codes and their applications to cryptography, IEEE Trans. Inform. Theory, issue.12, pp.493289-3293, 2003.

M. Ernst, A. V. Gabidulin, O. V. Paramonov, and . Tretjakov, Ideals over a noncommutative ring and their applications to cryptography, Advances in Cryptology -EUROCRYPT'91, number 547 in LNCS, pp.482-489, 1991.

P. Gaborit, A. Hauteville, J. Duong-hieu-phan, and . Tillich, Identity-Based Encryption from Codes with Rank Metric, Advances in Cryptology - CRYPTO2017, volume 10403 of LNCS, pp.194-226, 2017.
DOI : 10.1007/11426639_7
URL : https://hal.archives-ouvertes.fr/hal-01589463

P. Gaborit, C. Lauradoux, and N. Sendrier, SYND: a Fast Code-Based Stream Cipher with a Security Reduction, 2007 IEEE International Symposium on Information Theory, pp.186-190, 2007.
DOI : 10.1109/ISIT.2007.4557224

P. Gaborit, G. Murat, O. Ruatta, and G. Zémor, Low rank parity check codes and their application to cryptography, Proceedings of the Workshop on Coding and Cryptography WCC'2013, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00913719

P. Gaborit, A. Duong-hieu-phan, J. Hauteville, and . Tillich, Identity-based encryption from codes with rank metric, full version, IACR Cryptology ePrint Archive, 2017.
DOI : 10.1007/978-3-319-63697-9_7
URL : https://hal.inria.fr/hal-01589463/document

P. Gaborit, O. Ruatta, and J. Schrek, On the Complexity of the Rank Syndrome Decoding Problem, IEEE Transactions on Information Theory, vol.62, issue.2, 1026.
DOI : 10.1109/TIT.2015.2511786
URL : https://hal.archives-ouvertes.fr/hal-01280904

P. Gaborit, O. Ruatta, and J. Schrek, On the Complexity of the Rank Syndrome Decoding Problem, IEEE Transactions on Information Theory, vol.62, issue.2, pp.1006-1019, 2016.
DOI : 10.1109/TIT.2015.2511786
URL : https://hal.archives-ouvertes.fr/hal-01280904

P. Gaborit, O. Ruatta, J. Schrek, and G. Zémor, New Results for Rank-Based Cryptography, Progress in Cryptology -AFRICACRYPT 2014, pp.1-12, 2014.
DOI : 10.1007/978-3-319-06734-6_1
URL : https://hal.archives-ouvertes.fr/hal-01261421

P. Gaborit, O. Ruatta, J. Schrek, and G. Zémor, RankSign: An Efficient Signature Algorithm Based on the Rank Metric, Post-Quantum Cryptography 2014, pp.88-107, 2014.
DOI : 10.1007/978-3-319-11659-4_6
URL : https://hal.archives-ouvertes.fr/hal-01261425

P. Gaborit, O. Ruatta, J. Schrek, and G. Zémor, RankSign: An Efficient Signature Algorithm Based on the Rank Metric
DOI : 10.1007/978-3-319-11659-4_6
URL : https://hal.archives-ouvertes.fr/hal-01261425

P. Gaborit and G. Zémor, On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes, IEEE Transactions on Information Theory, vol.62, issue.12, pp.7245-7252, 2016.
DOI : 10.1109/TIT.2016.2616127
URL : https://hal.archives-ouvertes.fr/hal-01443111

C. Gentry, Practical Identity-Based Encryption Without Random Oracles, LNCS, vol.32, issue.3, pp.445-464, 2006.
DOI : 10.1007/11426639_7
URL : http://www.iacr.org/cryptodb/archive/2006/EUROCRYPT/2330/2330.pdf

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.197-206, 2008.
DOI : 10.1145/1374376.1374407
URL : http://eprint.iacr.org/2007/432.pdf

K. Gibson, Severely denting the Gabidulin version of the McEliece Public Key Cryptosystem, Designs, Codes and Cryptography, vol.6, issue.1, pp.37-45, 1995.
DOI : 10.1007/BF01390769

K. Gibson, The Security of the Gabidulin Public Key Cryptosystem, Advances in Cryptology -EUROCRYPT '96, pp.212-223, 1996.
DOI : 10.1007/3-540-68339-9_19

S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences, vol.28, issue.2, pp.270-299, 1984.
DOI : 10.1016/0022-0000(84)90070-9
URL : https://doi.org/10.1016/0022-0000(84)90070-9

L. K. Grover, Quantum Mechanics Helps in Searching for a Needle in a Haystack, Physical Review Letters, vol.54, issue.2, p.325, 1997.
DOI : 10.1103/PhysRevA.54.1034

J. Håstad, R. Impagliazzo, A. Leonid, M. Levin, and . Luby, A Pseudorandom Generator from any One-way Function, SIAM Journal on Computing, vol.28, issue.4, pp.1364-1396, 1999.
DOI : 10.1137/S0097539793244708

A. Hauteville and J. Tillich, New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem, 2015 IEEE International Symposium on Information Theory (ISIT), 2015.
DOI : 10.1109/ISIT.2015.7282956
URL : https://hal.archives-ouvertes.fr/hal-01244619

J. Hoostein, J. Pipher, and J. H. Silverman, NTRU : A ring-based public key cryptosystem, Algorithmic Number Theory, Third International Symposium, ANTS-III Proceedings, volume 1423 of LNCS, pp.267-288, 1998.

G. Kabatianskii, E. Krouk, and S. Semenov, Error Correcting Coding and Security for Data Networks : Analysis of the Superchannel Concept, 2005.
DOI : 10.1002/0470867574

G. Kabatianskii, E. Krouk, and B. J. Smeets, A digital signature scheme based on random error-correcting codes, IMA Int. Conf., volume 1355 of LNCS, pp.161-167, 1997.
DOI : 10.1007/BFb0024461

K. Lally and P. Fitzpatrick, Algebraic structure of quasicyclic codes, Discrete Applied Mathematics, vol.111, issue.1-2, pp.157-175, 2001.
DOI : 10.1016/S0166-218X(00)00350-4

A. Leonid and . Levin, One way functions and pseudorandom generators, Combinatorica, vol.7, issue.4, pp.357-363, 1987.

F. Lévy, -. Vehel, and L. Perret, Algebraic decoding of codes in rank metric, proceedings of YACC06, 2006.

S. Ling and P. Solé, On the algebraic structure of quasi-cyclic codes .I. Finite fields, IEEE Transactions on Information Theory, vol.47, issue.7, pp.2751-2760, 2001.
DOI : 10.1109/18.959257

P. Loidreau, Asymptotic behaviour of codes in rank metric over finite fields, Designs, Codes and Cryptography, vol.44, issue.2, pp.105-118, 2014.
DOI : 10.1007/978-3-662-07998-0
URL : https://hal.archives-ouvertes.fr/hal-01097293

P. Loidreau, On cellular code and their cryptographic applications, Proceedings of ACCT14 (algebraic and combinatorial coding theory), pp.234-239, 2014.

P. Loidreau, A New Rank Metric Codes Based Encryption Scheme, International Workshop on Post-Quantum Cryptography, pp.3-17, 2017.
DOI : 10.1109/ISIT.2010.5513549
URL : https://hal.archives-ouvertes.fr/hal-01673462

R. J. Mceliece, A Public-Key System Based on Algebraic Coding Theory, pp.114-116, 1978.

M. Meziani, G. Hoomann, and P. Cayrel, Improving the Performance of the SYND Stream Cipher, Progress in Cryptology -AFRICA- CRYPT 2012, pp.99-116, 2012.
DOI : 10.1007/978-3-642-31410-0_7
URL : https://hal.archives-ouvertes.fr/ujm-00865533

R. Misoczki, J. Tillich, N. Sendrier, and P. S. Barreto, MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes, 2013 IEEE International Symposium on Information Theory, 2012.
DOI : 10.1109/ISIT.2013.6620590
URL : https://hal.archives-ouvertes.fr/hal-00870929

O. Ore, On a special class of polynomials. Transactions of the, pp.559-584, 1933.

A. Otmani and J. Tillich, An eecient attack on all concrete KKS proposals, Post-Quantum Cryptography 2011, pp.98-116, 2011.
DOI : 10.1007/978-3-642-25405-5_7

A. V. Ourivski and T. Johansson, New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission, pp.237-246, 2002.

R. Overbeck, Extending Gibson???s Attacks on the GPT Cryptosystem, LNCS, vol.38, issue.3, pp.178-188, 2005.
DOI : 10.1007/11554868_5

R. Overbeck, A New Structural Attack for GPT and Variants, Mycrypt, pp.50-63, 2005.
DOI : 10.1007/11554868_5

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, 37th ACM STOC, pp.84-93, 2005.

R. Sakai, K. Ohgishi, and M. Kasahara, Cryptosystems based on pairing, SCIS 2000, 2000.

A. Shamir, Identity-Based Cryptosystems and Signature Schemes, LNCS, vol.84, issue.196, pp.47-53, 1984.
DOI : 10.1007/3-540-39568-7_5
URL : https://link.springer.com/content/pdf/10.1007%2F3-540-39568-7_5.pdf

D. Silva, F. R. Kschischang, and R. Kötter, Communication Over Finite-Field Matrix Channels, IEEE Transactions on Information Theory, vol.56, issue.3, pp.1296-1305, 2010.
DOI : 10.1109/TIT.2009.2039167
URL : http://arxiv.org/pdf/0807.1372

A. Vardy, The intractability of computing the minimum distance of a code, IEEE Transactions on Information Theory, vol.43, issue.6, pp.1757-1766, 1997.
DOI : 10.1109/18.641542

J. Von, Z. Gathen, and J. Gerhard, Modern computer algebra, 2003.

B. Waters, Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions, LNCS, vol.5677, pp.619-636, 2009.
DOI : 10.1007/978-3-642-03356-8_36
URL : http://eprint.iacr.org/2009/385.pdf

R. Brent and . Waters, EEcient identity-based encryption without random oracles, LNCS, vol.3494, pp.114-127, 2005.

C. Andrew and . Yao, Theory and application of trapdoor functions, Foundations of Computer Science SFCS'08. 23rd Annual Symposium on, pp.80-91, 1982.