Browse > Article

격자문제 관련 최신 양자계산 알고리즘  

Kim, Jeong San (경희대학교 응용수학과, 자연과학종합연구원)
Publication Information
Review of KIISC / v.30, no.3, 2020 , pp. 5-10 More about this Journal
Keywords
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 G. Kuperberg, "A subexponential-time quantum algorithm for the dihedral hidden subgroup problem", SIAM Journal on Computing, 35(1) pp. 170-188, 2005.   DOI
2 M. Ettinger, P. Hoyer, E. Knill, "The quantum query complexity of the hidden subgroup problem is polynomial", Inform. Process. Lett., 91 pp. 43-48, 2004.   DOI
3 O. Regev, Quantum Computation and Lattice Problems, SIAM Journal on Computing, 33(3), pp.738-760, 2004.   DOI
4 J. Radhakrishnan, M. Rotteler and P. Sen, "On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group", Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, pp. 1399-1412, 2005.
5 D. Bacon, A. Childs, W. van Dam, "From Optimal Measurement to Efficient Quantum Algorithms for the Hidden Subgroup Problem over Semidirect Product Groups", Proceedings of the 46th Annual Symposium on Foundations of Computer Science, pp. 469-478, 2005.
6 Y Inui, F Le Gall, "Efficient quantum algorithms for the hidden subgroup problem over a class of semi-direct product groups", Quantum Information and Computation 7(5&6), pp. 559-570, 2007.   DOI
7 D. P. Chi, J. S. Kim, S. Lee, "Notes on the hidden subgroup problem on some semi-direct product groups", Phys. Lett. A, 359, 114, 2006.   DOI
8 S. Hallgren, "Polynomial-time quantum algorithm for Pell's equation and the principal ideal problem," in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002.
9 S. Hallgren, "Fast quantum algorithms for computing the unit group and class group of a number field," in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 468-474, 2005.
10 A. Schmidt, U. Vollmer, "Polynomial-time quantum algorithm for the computation of the unit group of a number field," in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 475-480, 2005.
11 J. A. Buchmann, H. C. Williams, "A key exchange system based on real quadratic fields Extended abstract", in Advances in Cryptology -CRYPTO' 89 Proceedings. CRYPTO, 1989; Lecture Notes in Computer Science, 435. Springer, New York, NY, 1989.
12 K. Eisentrager, S. Hallgren, A. Kitaev, F. Song, "A quanum algorithm for computing the unit group of an arbitrary degree number field," in Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 293-302, 2014.
13 J. F. Biasse, F. Song, "Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields," in Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, 2016.
14 J. Buchmann, H. C. Williams, "A key exchange system based on imaginary quadratic fields", J. Cryptology 1, 107-118, 1988.   DOI
15 C. Gentry, S. Halevi, "Implementing gentry's fully-homomorphic encryption scheme," in Eurocrypt 2011, pp. 132-150, 2011.
16 P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring," SIAM J. Comput, 26, 1484-1509, 1997.   DOI
17 V. Lyubashevsky, C. Peikert, O. Regev, "On ideal lattices and learning with errors over rings," in Advances in cryptology-CRYPTO 2010, 6110, pp. 1-23, 2010.
18 Z. Brakerski, V. Vaikuntanathan, "Fully homomorphic encryption from ring-LWE and security for key dependent messages," in Advances in cryptology-Eurocrypt 2011, 6841, pp. 505-524, 2011.
19 E. Bernstein, U. Vazirani, "Quantum complexity theory", SIAM Journal on Computing, Vol. 26, pp. 1411-1473, 1997.   DOI
20 L. K. Grover, "A fast quantum mechanical algorithm for database search", Phys. Rev. Lett, 79, 325-328, 1997.   DOI
21 S. Hallgren, "Polynomial-time quantum algorithm for Pell's equation and the principal ideal problem," J. ACM 54, pp. 1-19, 2007.   DOI
22 E. Bernstein, U. Vazirani, "Quantum complexity theory", Proceeding of the 25th ACM Symposium on Theory of Computation, San Diego, CA, 1993, pp.11-20
23 A. Berthiaume, G. Brassard, "The quantum challenge to structural complexity theory", Proceedings of the 7th Annual IEEE Conference on Complexity Theory (Piscataway, NJ), IEEE Computer Society Press, pp. 132-137, 1992.
24 A. Berthiaume, G. Brassard, "Oracle Quantum Computing", Journal of Modern Optics, Vol. 41, pp. 2521-2535, 1994.   DOI
25 C. H. Bennett, E. Bernstein, G. Brassard, U. Vazirani, "Strengths and Weaknesses of Quantum Computing", SIAM Journal on Computing, Vol. 26, pp. 1510-1523, 1997.   DOI
26 M. Nielson and I. Chuang, Quantum computation and quantum information, Cambridge University Express, 2000.
27 V. Lyubashevsky, C. Peikert, O. Regev, "On ideal lattices and learning with errors over rings", In Advances in cryptology- EUROCRYPT 2010, volume 6110 of LNCS, pp. 1-23, Springer, 2010.
28 P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring," in Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, (IEEE Computer Society Press, Piscataway, NJ, USA, 1994)
29 L. K. Grover, "A fast quantum mechanical algorithm for database search", in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (ACM, NY, USA, 1996)
30 O. Regev, "On lattices, learning with errors, random linear codes, and cryptography", STOC 2005, ACM pp. 84-93, 2005.
31 E. Bae, J. S. Kim, S. Lee, "Research trends in quantum computational algorithms for cryptoanalysis", Korean Journal of Optics and Photonics, 29(2) pp. 53-57, 2018.   DOI
32 D. Boneh, R. Lipton, "Quantum cryptanalysis of hidden linear functions", in Proceedings of Crypto'95, LNCS, 963, pp. 427-437, 1995.
33 A. Y. Kitaev, "Quantum measurements and the abelian stabilizer problem," arXiv:quant-ph/9511026v1, 1995.
34 S. Hallgren, "The Hidden Subgroup Problem and Quantum Computing using Group Representations", SIAM Journal on Computing, Vol. 32, No. 4, pp. 916-934, 2003.   DOI
35 K. Friedl, G. Ivanyos, F. Magniez, M. Santha, P. Sen, "Hidden Translation and Orbit Coset in Quantum Computing", Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 1-9, 2003.
36 M. Ettinger, P. Hoyer, "A Quantum Observable for the Graph Isomorphism Problem", quant-ph/9901029, 1999.
37 C. Moore, D. N. Rockmore, A. Russell, L. J. Schulman, "The Power of Basis Selection in Fourier Sampling: Hidden Subgroup Problems in Affine Groups", Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1106-1115, 2004