Quantum computation of zeta functions of curves
Computational Complexity
Quantum implicit computational complexity
Theoretical Computer Science
Quantum circuit oracles for Abstract Machine computations
Theoretical Computer Science
High order linearization equation (HOLE) attack on multivariate public key cryptosystems
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Non-classical computing: feasible versus infeasible
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
Quantum computing algorithm for electromagnetic field simulation
Quantum Information Processing
A lattice-based threshold ring signature scheme
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Inverting HFE systems is quasi-polynomial for all fields
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
An arbitrated quantum message signature scheme
CIS'04 Proceedings of the First international conference on Computational and Information Science
High-Speed hardware implementation of rainbow signature on FPGAs
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Communications of the ACM
Commuting quantum circuits: efficient classical simulations versus hardness results
Quantum Information & Computation
Multiparty controlled quantum secure direct communication based on quantum search algorithm
Quantum Information Processing
Differential phase shift quantum private comparison
Quantum Information Processing
| Hi-index | 0.02 |
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, for example, the number of digits of the integer to be factored.