Oracles for structural properties: The isomorphism problem and public-key cryptography
DOI10.1016/0022-0000(92)90023-CzbMath0757.68055OpenAlexW2174367614MaRDI QIDQ1190988
Selman, Alan L., Homer, Steven
Publication date: 27 September 1992
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(92)90023-c
relativizationisomorphism conjecturepublic-key cryptosystems\(p\)-isomorphismcryptographic complexity
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (13)
Cites Work
- Unnamed Item
- On some natural complete operators
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
- Relativizations of Unambiguous and Random Polynomial Time Classes
- Complexity Measures for Public-Key Cryptosystems
- Natural Self-Reducible Sets
- Relativized Questions Involving Probabilistic Algorithms
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- On Isomorphisms and Density of $NP$ and Other Complete Sets
- The isomorphism conjecture fails relative to a random oracle
- On the Computational Complexity of Algorithms
This page was built for publication: Oracles for structural properties: The isomorphism problem and public-key cryptography