A. Ambainis and A. Backurs, Grover???s Algorithm with Errors, MEMICS, pp.180-189, 2012.
DOI : 10.1007/978-3-642-36046-6_17

E. Mayuresh-vivekanand-anand, G. Ebrahimi-targhi, D. Noel-tabia, and . Unruh, Post-Quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation, Lecture Notes in Computer Science, vol.9606, pp.44-63, 2016.
DOI : 10.1007/978-3-319-29360-8_4

D. Bacon, A. M. Childs, and W. Van-dam, Optimal measurements for the dihedral hidden subgroup problem, Chicago Journal of Theoretical Computer Science, issue.2, 2005.

J. Daniel and . Bernstein, Post-Quantum Cryptography, Encyclopedia of Cryptography and Security, pp.949-950, 2011.

A. Biryukov and D. Wagner, Slide Attacks, Lecture Notes in Computer Science, vol.1636, pp.245-259, 1999.
DOI : 10.1007/3-540-48519-8_18

A. Biryukov and D. Wagner, Advanced Slide Attacks, Lecture Notes in Computer Science, vol.1807, pp.589-606, 2000.
DOI : 10.1007/3-540-45539-6_41

D. Pyo, C. , and J. Kim, Quantum Database Searching by a Single QueryQuantum Database Search with Certainty by a Single Query, First NASA International Conference, pp.148-151, 1997.

M. Ettinger and P. Høyer, On Quantum Algorithms for Noncommutative Hidden Subgroups, pp.478-487, 1999.

S. Even and Y. Mansour, A construction of a cipher from a single pseudorandom permutation, Journal of Cryptology, vol.28, issue.No. 2, pp.151-162, 1997.
DOI : 10.1007/s001459900025

K. Friedl and G. Ivanyos, Frédéric Magniez, Miklos Santha, and Pranab Sen. Hidden translation and orbit coset in quantum computing, STOC, pp.1-9, 2003.

M. Gharibi, Reduction from non-injective hidden shift problem to injective hidden shift problem, Quantum Information & Computation, vol.13, issue.3-4, pp.221-230, 2013.

K. Lov and . Grover, A Fast Quantum Mechanical Algorithm for Database Search, STOC, pp.212-219, 1996.

Y. Inui and F. L. Gall, Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups, Quantum Information & Computation, vol.7, issue.5, pp.559-570, 2007.

M. Kaplan and G. Leurent, Anthony Leverrier, and María Naya-Plasencia. Breaking Symmetric Cryptosystems using Quantum Period Finding Lecture notes in computer science, CRYPTO 2016, 2016.

G. Kuperberg, A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem, SIAM Journal on Computing, vol.35, issue.1, pp.170-188, 2005.
DOI : 10.1137/S0097539703436345

G. Kuperberg, Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.20-34, 2013.
DOI : 10.1137/s0097539703436345

URL : http://arxiv.org/abs/quant-ph/0302112

H. Kuwakado and M. Morii, Security on the quantum-type Even-Mansour cipher, ISITA, pp.312-316, 2012.

O. Regev, Quantum Computation and Lattice Problems, FOCS, pp.520-529, 2002.
DOI : 10.1137/s0097539703440678

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

O. Regev and L. Schiff, Impossibility of a Quantum Speed-Up with a Faulty Oracle, Lecture Notes in Computer Science, vol.5125, issue.1, pp.773-781, 2008.
DOI : 10.1007/978-3-540-70575-8_63

W. Peter and . Shor, Algorithms for Quantum Computation : Discrete Logarithms and Factoring, FOCS [1], pp.124-134

R. Daniel and . Simon, On the Power of Quantum Cryptography, FOCS [1], pp.116-123

C. Zalka, Grover???s quantum searching algorithm is optimal, Physical Review A, vol.60, issue.4, pp.2746-2751, 1999.
DOI : 10.1103/PhysRevA.60.2746

URL : http://arxiv.org/abs/quant-ph/9711070