Skip to main content
Springer Nature Link
Log in

Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding

  • Conference paper
Automata, Languages and Programming (ICALP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4052))

Included in the following conference series:

Abstract

We present three new quantum hardcore functions for any quantum one-way function. We also give a “quantum” solution to Damgård’s question (CRYPTO’88) on his pseudorandom generator by proving the quantum hardcore property of his generator, which has been unknown to have the classical hardcore property. Our technical tool is quantum list-decoding of “classical” error-correcting codes (rather than “quantum” error-correcting codes), which is defined on the platform of computational complexity theory and cryptography (rather than information theory). In particular, we give a simple but powerful criterion that makes a polynomial-time computable code (seen as a function) a quantum hardcore for any quantum one-way function. On their own interest, we also give quantum list-decoding algorithms for codes whose associated quantum states (called codeword states) are “nearly” orthogonal using the technique of pretty good measurement.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Adcock, M., Cleve, R.: A quantum Goldreich-Levin theorem with cryptographic applications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 323–334. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates using list decoding. In: Proc. FOCS 2003, pp. 146–157 (2003)

    Google Scholar 

  3. Ambainis, A., Iwama, K., Kawachi, A., Putra, R.H., Yamashita, S.: Robust quantum algorithms for oracle identification. In: Available at (2004), http://arxiv.org/abs/quant-ph/0411204

  4. Atici, A., Servedio, R.: Improved bounds on quantum learning algorithms. In: To appear in Quantum Information Processing, Available also at http://arxiv.org/abs/quant-ph/0411140

  5. Barg, A., Zhou, S.: A quantum decoding algorithm for the simplex code. In: Proc. Allerton Conference on Communication, Control and Computing (1998), http://citeseer.ist.psu.edu/barg98quantum.html

  6. Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411–1473 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Buhrman, H., Newman, I., Rohrig, H., Wolf, R.d.: Robust quantum algorithms and polynomials. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 593–604. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Damgård, I.B.: On the randomness of Legendre and Jacobi sequences. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 163–172. Springer, Heidelberg (1990)

    Google Scholar 

  9. D. Deutsch and R. Jozsa. Rapid solution of problems by quantum computation. In Proc. Roy. Soc. London, A, Vol.439, pp.553–558, 1992.

    MATH  MathSciNet  Google Scholar 

  10. Eldar, Y.C., Forney Jr., G.D.: On quantum detection and the square-root measurement. IEEE Trans. Inform. Theory 47(3), 858–872 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  12. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proc. STOC 1989, pp. 25–32 (1989)

    Google Scholar 

  13. González Vasco, M.I., Näslund, M.: A survey of hard core functions. In: Proc. Workshop on Cryptography and Computational Number Theory, pp. 227–256. Birkhauser, Basel (2001)

    Google Scholar 

  14. Grover, L.K.: Quantum Mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997)

    Article  Google Scholar 

  15. Guruswami, V., Sudan, M.: Extensions to the Johnson bound. In: Manuscript (2000), http://theory.csail.mit.edu/~madhu/

  16. Hausladen, P., Wootters, W.K.: A ‘ pretty good’ measurement for distinguishing quantum states. J. Mod. Opt. 41, 2385–2390 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  17. Holenstein, T., Maurer, U.M., Sjödin, J.: Complete classification of bilinear hard-core functions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 73–91. Springer, Heidelberg (2004)

    Google Scholar 

  18. Høyer, P., Mosca, M., de Wolf, R.: Quantum search on bounded-error inputs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 291–299. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  19. Sudan, M.: List decoding: Algorithms and applications. SIGACT News 31(1), 16–27 (2000)

    Article  Google Scholar 

  20. van Dam, W., Hallgren, S., Ip, L.: Quantum algorithms for some hidden shift problems. In: Proc. SODA 2003, pp. 489–498 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Engineering, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo, 152-8552, Japan

    Akinori Kawachi

  2. ERATO-SORST Quantum Computation and Information Project, Japan Science and Technology Agency, 5-28-3 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Tomoyuki Yamakami

Authors
  1. Akinori Kawachi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomoyuki Yamakami
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università Ca’ Foscari, Venice,  

    Michele Bugliesi

  2. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  3. ECS, University of Southampton, UK

    Vladimiro Sassone

  4. FB Informatik, LS2, Univ. Dortmund, 44221, Dortmund, Germany

    Ingo Wegener

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kawachi, A., Yamakami, T. (2006). Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787006_19

Download citation

  • DOI: https://doi.org/10.1007/11787006_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35907-4

  • Online ISBN: 978-3-540-35908-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics