Name
Abstract | ||
|---|---|---|
Shor's algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on public-key cryptography. From the computational point of view, his algorithms illustrate that quantum computation could be more powerful. It is natural to consider that the power of quantum computation could be exploited to withstand even quantum adversaries. Over the last decade, quantum cryptography has been discussed and developed even from the computational complexity-theoretic point of view. In this paper, we will survey what has been studied in quantum computational cryptography. |
Year | Venue | Keywords |
|---|---|---|
2006 | JOURNAL OF UNIVERSAL COMPUTER SCIENCE | computational cryptography,quantum computing,quantum cryptography |
Field | DocType | Volume |
Post-quantum cryptography,Computer science,Quantum computer,Theoretical computer science,Quantum algorithm,Shor's algorithm,Quantum cryptography,Lattice-based cryptography,Quantum capacity,Quantum network | Journal | 12 |
Issue | ISSN | Citations |
6 | 0948-695X | 1 |
PageRank | References | Authors |
0.35 | 49 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akinori Kawachi | 1 | 185 | 20.66 |
| Takeshi Koshiba | 2 | 76 | 7.96 |