Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Complexity classes without machines: on complete languages for UP
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Algorithmic number theory
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Open problems in number theoretic complexity, II
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Polynomial reducibilities and complete sets.
Polynomial reducibilities and complete sets.
The cpa's responsibility for the prevention and detection of computer fraud.
The cpa's responsibility for the prevention and detection of computer fraud.
| Hi-index | 0.89 |
UP is the class of languages accepted by polynomial-time nondeterministic Turing machines that have at most one accepting path. We show that the quadratic residue problem belongs to UP@?coUP. This answers affirmatively an open problem, discussed in Theory of Computational Complexity (Du and Ko, 2000), of whether the quadratic nonresidue problem is in NP. We generalize to higher powers and show the higher power residue problem also belongs to UP@?coUP.