Quantum computing

Sean Hallgren and Ulrich Vollmer ()

A chapter in Post-Quantum Cryptography, 2009, pp 15-34 from Springer

Abstract: In this chapter we will explain how quantum algorithms work and how they can be used to attack crypto systems. We will outline the current state of the art of quantum algorithmic techniques that are, or might become relevant for cryptanalysis. And give an outlook onto possible future developments.

Keywords: Boolean Function; Quantum Computer; Quantum Algorithm; Elliptic Curve Cryptography; Graph Isomorphism (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-88702-7_2

Ordering information: This item can be ordered from
http://www.springer.com/9783540887027

DOI: 10.1007/978-3-540-88702-7_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().