Abstract
To search for a target n-product Boolean vector of fixed weight d, we propose an important method involving the notion of a fixed-weight “vector label” accompanied with a vector label restoration algorithm. Based on these, we present a new quantum algorithm designed to search for a fixed-weight target whose computation complexity, specifically \( O\left( {\sqrt {C_{n + 1}^d } } \right) \), is better than that for a classical algorithm. Finally, we use the procedure to search for the NTRU private key as an example to verify the efficiency of the new algorithm in searching for fixed-weight target solutions.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Paul B. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J Stat Phys, 1980, 22: 563–591
Feynman R. Simulating physics with computers. Int Theor Phys, 1982, 21: 467–488
Deutsch D, Jozsa R. Rapid solution of problems by quantum computation. Proc R Soc London, 1992, A439: 553–558
Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput, 1997, 26: 1484–1509
Grover L K. A fast quantum mechanics algorithm for database search. In: Proceeding of the 28th ACM Symposium on Theory of Computation. New York: ACM Press, 1996. 212–219
Chen W, Han Z F, Mo X F. Active phase compensation of quantum key distribution system (in Chinese). Chinese Sci Bull, 2007, 52: 2221–2225
Gao F, Guo F Z, Wen Q Y. Efficiency compare of different detection strategies in Ping-pong protocol (in Chinese). Sci China Ser G-Phys Mech Astron, 2009, 39: 161–166
Xu F X, Chen W, Wang S, et al. Field experiment on a robust hierarchical metropolitan quantum cryptography network. Chinese Sci Bull, 2009, 54: 2991–2997
Fu X Q, Bao W S, Zhou C. Speed-up implementation of Shor’s integer decomposition quantum algorithm. Chinese Sci Bull, 2010, 55: 322–327
Long G L. Grover’s algorithm with zero theoretical failure rate. Phys Rev A, 2001, 64: 022307
Long G L, Zhang W L, Li Y S, et al. Arbitrary phase rotation can not be used in Grover’s quantum search algorithm. Commun Theor Phys, 1999, 32: 335–338
Long G L, Li Y S, Zhang W L, et al. Phase matching in quantum searching. Phys Lett A, 1999, 262: 27–34
Long G L, Xiao L, Sun Y. Phase matching condition for quantum search with a generalized quantum database. Phys Lett A, 2002, 294: 143–152
Zhong P C, Bao W S. Quantum Mechanical Meet-in-the-middle Search Algorithm for Triple-DES. Chinese Sci Bull, 2009, 54: 3003–3007
Jeffstey H, Jill P, Joseph H S. NTRU: A ring based public key cryptosystem. ANTS III, 1998, 1423: 267–288
Ludwig C. A faster lattice reduction method using quantum search. Algor Comput, 2003, 2906: 199–208
Don C, Adi S. Lattice Attacks on NTRU. Konstanz: Springer-Verlage Press, 1997. 52–61
Author information
Authors and Affiliations
Corresponding author
Additional information
This article is published with open access at Springerlink.com
Rights and permissions
This article is published under an open access license. Please check the 'Copyright Information' section either on this page or in the PDF for details of this license and what re-use is permitted. If your intended use exceeds what is permitted by the license or if you are unable to locate the licence and re-use information, please contact the Rights and Permissions team.
About this article
Cite this article
Wang, X., Bao, W. & Fu, X. A quantum algorithm for searching a target solution of fixed weight. Chin. Sci. Bull. 56, 484–489 (2011). https://doi.org/10.1007/s11434-010-4113-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11434-010-4113-4