암호해독을 위한 양자 계산 알고리즘의 최근 연구동향

키워드

참고문헌 (31)

1. A research on the technique of cryptosystem security analysis using quantum computational algorithms, "J. Kim", National Security Research Institute, ~, pp.Grant No. 2017-013 (2017)
2. P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring", Proc. 35th Annual IEEE Symposium on the Foundations of Computer Science, SIAM J. Comput, 26, pp.1484~1509 (1994)
3. L. K. Grover, "A fast quantum mechanical algorithm for database search", Proc. 28th Annual ACM Symposium on Theory of Computing, Phys. Rev. Lett., 79, pp.325~328 (1996), ACM
4. D. Boneh, "Quantum cryptanalysis of hidden linear functions", Proc. Crypto'95, 963, pp.427~437 (1995)
5. A. Y. Kitaev, "Quantum measurements and the abelian stabilizer problem", arXiv:quant-ph, 1995
6. M. Ettinger, "A quantum observable for the graph isomorphism problem", arXiv:quant-ph, 1999
7. S. Hallgren, "The hidden subgroup problem and quantum computing using group representations", SIAM J. Comput., 32, pp.916~934 (2003)[DOI]
8. M. Grigni, "Quantum mechanical algorithms for the non-abelian hidden subgroup problem", Proc. 33rd Annual ACM Symposium on Theory of Computing (2001), Combinatorica, 24, pp.137~154 (2004)
9. K. Friedl, "Hidden translation and translating coset in quantum computing", Proc. 35th Annual ACM Symposium on Theory of Computing (2003), SIAM J. Comput., 43, pp.1~24 (2014)
10. G. Kuperberg, "A subexponential-time quantum algorithm for the dihedral hidden subgroup problem", SIAM J. Comput., 35, pp.170~188 (2005)[DOI]
11. M. Ettinger, "The quantum query complexity of the hidden subgroup problem is polynomial", Inf. Process. Lett., 91, pp.43~48 (2004)[DOI]
12. D. Gavinsky, "Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups", Quantum Inf. Comput., 4, pp.229~235 (2004)
13. Y. Inui, "Efficient quantum algorithm for the hidden subgroup problem over a class of semi-direct product groups", Quantum Inf. Comput., 7, pp.559~570 (2007)
14. C. Moore, "The power of strong Fourier sampling: Quantum algorithms for affine groups and hidden shifts", Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, Philadelphia, USA, 2004), SIAM J. Comput., 37, pp.938~958 (2007)
15. O. Regev, "A subexponential-time algorithm for the dihedral hidden subgroup problem with polynomial space", arXiv: quant-ph, 2004
16. D. Bacon, "From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups", Proc. 46th Annual IEEE Symposium on the Foundations of Computer Science, pp.469~478 (2005)
17. O. Regev, "Quantum computation and lattice problems", Proc. 43rd Annual IEEE Symposium on the Foundations of Computer Science, pp.520~529 (2002)
18. S. Hallgren, "Limitations of quantum coset states for graph isomorphism", Proc. 38th Annual ACM Symposium on Theory of Computing, pp.604~617 (2006)
19. W. van Dam, "Quantum algorithms for some hidden shift problems", SIAM J. Comput., 36, pp.763~778 (2006)[DOI]
20. I. B. Damgard, "On the randomness of Legendre and Jacobi sequences", Proc. Advances in Cryptology-CRYPTO 1988, 403, pp.163~172 (1990)
21. M. Ozols, "Quantum rejection sampling", Proc. 3rd Innovations in Theoretical Computer Science Conference, pp.290~308 (2012)
22. O. Regev, "Quantum computation and lattice problems", SIAM J. Comput., 33, pp.738~760 (2004)[DOI]
23. S. Hallgren, "Polynomial-time quantum algorithm for Pell's equation and the principal ideal problem", Proc. 34th Annual ACM Symposium on Theory of Computing (2002), J. ACM, 54, pp.1~19 (2007)
24. S. Hallgren, "Fast quantum algorithms for computing the unit group and class group of a number field", Proc. 37th Annual ACM Symposium on Theory of Computing, pp.468~474 (2005)
25. A. Schmidt, "Polynomial-time quantum algorithm for the computation of the unit group of a number field", Proc. 37th Annual ACM Symposium on Theory of Computing, pp.475~480 (2005)
26. K. Eisentrager, "A quanum algorithm for computing the unit group of an arbitrary degree number field", Proc. 46th Annual ACM Symposium on Theory of Computing, pp.293~302 (2014)
27. J. F. Biasse, "Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields", Proc. 27th Annual ACM-SIAM Symposium on Discrete Algorithms (2016)
28. E. Bae, "Quantum algorithm for continuous hidden shift problems"
29. C. Gentry, "Implementing gentry's fullyhomomorphic encryption scheme", Proc. Eurocrypt 2011, pp.132~150 (2011)
30. V. Lyubashevsky, "On ideal lattices and learning with errors over rings", Proc. Advances in cryptology-CRYPTO 2010, 6110, pp.1~23 (2010)
31. Z. Brakerski, "Fully homomorphic encryption from ring-LWE and security for key dependent messages", Proc. Advances in cryptology-Eurocrypt 2011, 6841, pp.505~524 (2011)

관련 논문AI추천