G. Alagic and A. Russell, Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts, LNCS, vol.10212, issue.3, pp.65-93, 2017.

A. Becker, J. Coron, and A. Joux, Improved generic algorithms for hard knapsacks, Advances in Cryptology -EUROCRYPT 2011 -30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol.6632, pp.364-385, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00664332

D. J. Bernstein, S. Jeffery, T. Lange, and A. Meurer, Quantum algorithms for the subset-sum problem, Post-Quantum Cryptography -5th International Workshop, vol.7932, pp.16-33, 2013.

X. Bonnetain and M. Naya-plasencia, Hidden shift quantum cryptanalysis and implications, Advances in Cryptology -ASI-ACRYPT 2018 -24th International Conference on the Theory and Application of Cryptology and Information Security, vol.11272, pp.560-592, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01953914

X. Bonnetain and A. Schrottenloher, Quantum security analysis of CSIDH and ordinary isogeny-based schemes, IACR Cryptology ePrint, p.537, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01896046

W. Castryck, T. Lange, C. Martindale, L. Panny, and J. Renes, Csidh: An efficient post-quantum commutative group action. Cryptology ePrint Archive, vol.383, 2018.

A. M. Childs, D. Jao, and V. Soukharev, Constructing elliptic curve isogenies in quantum subexponential time, J. Mathematical Cryptology, vol.8, issue.1, pp.1-29, 2014.

M. Ettinger and P. Høyer, On Quantum Algorithms for Noncommutative Hidden Subgroups, STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, vol.1563, pp.478-487, 1999.

L. D. Feo and S. D. Galbraith, Seasign: Compact isogeny signatures from class group actions, IACR Cryptology ePrint, vol.824, 2018.

L. D. Feo, J. Kieffer, and B. Smith, Towards practical key exchange from ordinary isogeny graphs, Advances in Cryptology -ASIACRYPT 2018 -24th International Conference on the Theory and Application of Cryptology and Information Security, vol.11274, pp.365-394, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01872817

A. Helm and A. May, 13th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2018, vol.111, 2018.

G. Kuperberg, A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem, SIAM J. Comput, vol.35, issue.1, pp.170-188, 2005.

G. Kuperberg, 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013, vol.22, pp.20-34, 2013.

O. Regev, A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space, 2004.

R. Schroeppel and A. Shamir, A t=o(2 n/2 ), s=o(2 n/4 ) algorithm for certain npcomplete problems, SIAM J. Comput, vol.10, issue.3, pp.456-464, 1981.

P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput, vol.26, issue.5, pp.1484-1509, 1997.