E. Alkim, L. Ducas, T. Pöppelmann, and P. Schwabe, Postquantum key exchange -a new hope, Cryptology ePrint Archive, 1092.

M. Baldi, M. Bodrato, and F. Chiaraluce, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Proceedings of the 6th international conference on Security and Cryptography for Networks, pp.246-262, 2008.
DOI : 10.1007/978-3-540-85855-3_17

M. Baldi and F. Chiaraluce, Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes, 2007 IEEE International Symposium on Information Theory, pp.2591-2595, 2007.
DOI : 10.1109/ISIT.2007.4557609

M. Baldi, F. Chiaraluce, and R. Garello, On the Usage of Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem, 2006 First International Conference on Communications and Electronics, pp.305-310, 2006.
DOI : 10.1109/CCE.2006.350824

M. Baldi, F. Chiaraluce, R. Garello, and F. Mininni, Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem, IEEE International Conference on Communications, pp.951-956, 2007.

A. Becker, A. Joux, A. May, and A. Meurer, Decoding Random Binary Linear Codes in 2 n/20: How 1???+???1???=???0 Improves Information Set Decoding, Advances in Cryptology - EUROCRYPT 2012, pp.520-536, 2012.
DOI : 10.1007/978-3-642-29011-4_31

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

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

D. J. Bernstein, T. Chou, and P. Schwabe, McBits: Fast Constant-Time Code-Based Cryptography, In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics LNCS of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol.8086, issue.12, pp.250-272
DOI : 10.1007/978-3-642-40349-1_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.6027

J. Bos, C. Costello, L. Ducas, I. Mironov, M. Naehrig et al., Frodo, Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS'16, 2016.
DOI : 10.1007/978-3-662-46803-6_24

W. Joppe, C. Bos, M. Costello, D. Naehrig, and . Stebila, Post-quantum key exchange for the tls protocol from the ring learning with errors problem, Security and Privacy (SP), 2015 IEEE Symposium on, pp.553-570, 2015.

R. Canetti and H. Krawczyk, Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels, International Conference on the Theory and Applications of Cryptographic Techniques, pp.453-474, 2001.
DOI : 10.1007/3-540-44987-6_28

R. Canetti and H. Krawczyk, Security analysis of ike's signature-based keyexchange protocol, Annual International Cryptology Conference, pp.143-161, 2002.

P. Cayrel, G. Hoffmann, and E. Persichetti, Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes, Proceedings of PKC 2012, pp.138-155, 2012.
DOI : 10.1007/978-3-642-30057-8_9
URL : https://hal.archives-ouvertes.fr/ujm-00712875

J. Chaulet and N. Sendrier, Worst case QC-MDPC decoder for McEliece cryptosystem, 2016 IEEE International Symposium on Information Theory (ISIT), pp.1366-1370, 2016.
DOI : 10.1109/ISIT.2016.7541522
URL : https://hal.archives-ouvertes.fr/hal-01408633

C. Costello, P. Longa, and M. Naehrig, Efficient Algorithms for Supersingular Isogeny Diffie-Hellman, pp.572-601, 2016.
DOI : 10.1049/el:19991230

R. Cramer and V. Shoup, Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack, SIAM Journal on Computing, vol.33, issue.1, pp.167-226, 2004.
DOI : 10.1137/S0097539702403773

J. Faugere, V. Gauthier-umana, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high-rate McEliece cryptosystems, IEEE Transactions on Information Theory, issue.10, pp.596830-6844, 2013.
DOI : 10.1109/tit.2013.2272036
URL : https://hal.archives-ouvertes.fr/hal-01108602

S. Fluhrer, Cryptanalysis of ring-lwe based key exchange with key share reuse, Cryptology ePrint Archive, 2016.

P. Gaborit, Shorter keys for code based cryptography, International Workshop on Coding and Cryptography (WCC 2005), pp.81-91, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00078726

R. G. Gallager, Low-density parity-check codes, IEEE Transactions on Information Theory, vol.8, issue.1, 1963.
DOI : 10.1109/TIT.1962.1057683

Q. Guo, T. Johansson, and P. Stankovski, A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors, pp.789-815, 2016.
DOI : 10.1109/SFCS.1994.365700

Y. Hamdaoui and N. Sendrier, A non asymptotic analysis of information set decoding. Cryptology ePrint Archive, 2013.

D. Harkins and D. Carrel, Rfc 2409: The internet key exchange (ike) Status: Proposed Standard, 1998.
DOI : 10.17487/rfc2409

S. Heyse, I. V. Maurich, and T. Güneysu, Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices, International Workshop on Cryptographic Hardware and Embedded Systems, pp.273-292, 2013.
DOI : 10.1007/978-3-642-40349-1_16

D. Jao and L. De-feo, Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies, International Workshop on Post-Quantum Cryptography, pp.19-34, 2011.
DOI : 10.1007/11533719_44
URL : https://hal.archives-ouvertes.fr/hal-00652846

G. Kachigar and J. Tillich, Quantum Information Set Decoding Algorithms, PQCrypto 2017, pp.69-89, 2017.
DOI : 10.1109/FOCS.2004.53
URL : https://hal.archives-ouvertes.fr/hal-01661905

A. Kiayias, A. Russell, B. David, and R. Oliynykov, Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol, pp.357-388, 2017.
DOI : 10.1007/3-540-48405-1_10

H. Krawczyk, SIGMA: The ???SIGn-and-MAc??? Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols, Annual International Cryptology Conference, pp.400-425, 2003.
DOI : 10.1007/978-3-540-45146-4_24

T. Lange, Initial recommendations of long-term secure post-quantum systems, PQCRYPTO. EU. Horizon, 2015.

V. Lyubashevsky, C. Peikert, and O. Regev, On Ideal Lattices and Learning with Errors over Rings, pp.1-23, 2010.
DOI : 10.1007/978-3-642-13190-5_1
URL : https://hal.archives-ouvertes.fr/hal-00921792

C. Lndahl, T. Johansson, M. Koochak-shooshtari, M. Ahmadian-attari, and M. R. Aref, Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension. Designs, Codes and Cryptography, pp.359-377, 2016.

T. Ingo-von-maurich, T. Oder, and . Güneysu, Implementing qc-mdpc mceliece encryption, ACM Trans. Embed. Comput. Syst, vol.1444, issue.3, pp.1-4427, 2015.

A. May and I. Ozerov, On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes, Advances in Cryptology ? EUROCRYPT 2015, Part I, pp.203-228, 2015.
DOI : 10.1007/978-3-662-46800-5_9

R. J. Mceliece, A public-key cryptosystem based on algebraic coding theory, Deep Space Network Progress Report, vol.44, pp.114-116, 1978.

D. Micciancio, Improving lattice based cryptosystems using the hermite normal form. Cryptography and lattices, pp.126-145, 2001.

V. S. Miller, Use of Elliptic Curves in Cryptography, Advances in cryptology (CRYPTO 85), pp.417-426, 1986.
DOI : 10.1007/3-540-39799-X_31

R. Misoczki and P. S. Barreto, Compact McEliece Keys from Goppa Codes, Selected Areas in Cryptography, pp.376-392, 2009.
DOI : 10.1007/978-3-642-05445-7_24
URL : https://hal.archives-ouvertes.fr/hal-00870932

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

C. Monico, J. Rosenthal, and A. Shokrollahi, Using low density parity check codes in the McEliece cryptosystem, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), p.215, 2000.
DOI : 10.1109/ISIT.2000.866513

C. Peikert, Lattice Cryptography for the Internet, International Workshop on Post-Quantum Cryptography, pp.197-219, 2014.
DOI : 10.1007/978-3-319-11659-4_12

C. Peikert, A Decade of Lattice Cryptography, Foundations and Trends?? in Theoretical Computer Science, vol.10, issue.4, pp.283-424, 2016.
DOI : 10.1561/0400000074

E. Persichetti, Compact McEliece keys based on quasi-dyadic Srivastava codes, Journal of Mathematical Cryptology, vol.6, issue.2, pp.149-169, 2012.
DOI : 10.1515/jmc-2011-0099
URL : https://eprint.iacr.org/2011/179.pdf

E. Persichetti, Secure and anonymous hybrid encryption from coding theory Post-Quantum Cryptography: 5th International Workshop, Proceedings, pp.174-187, 2013.
DOI : 10.1007/978-3-642-38616-9_12

E. Prange, The use of information sets in decoding cyclic codes, IEEE Transactions on Information Theory, vol.8, issue.5, pp.5-9, 1962.
DOI : 10.1109/TIT.1962.1057777

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, Journal of the ACM (JACM), vol.56, issue.6, p.34, 2009.
DOI : 10.1145/1060590.1060603

R. L. Rivest, A. Shamir, and L. M. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.
DOI : 10.1145/359340.359342

N. Sendrier, Decoding One Out of Many, LNCS, vol.8, issue.1, pp.51-67, 2011.
DOI : 10.1007/3-540-45708-9_19

K. Seo and S. Kent, Security architecture for the internet protocol. Status: Proposed Standard, 2005.

P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, vol.26, issue.5, pp.1484-1509, 1997.
DOI : 10.1137/S0097539795293172

R. Canto, T. , and N. Sendrier, Analysis of information set decoding for a sub-linear error weight, LNCS, vol.9606, pp.144-161, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01244886

I. Von, M. , and T. Güneysu, Lightweight code-based cryptography: QC- MDPC McEliece encryption on reconfigurable devices, Proceedings of the conference on Design European Design and Automation Association, p.38, 2014.

I. Von, M. , and T. Güneysu, Towards side-channel resistant implementations of QC-MDPC McEliece encryption on constrained devices, pp.266-282, 2014.