A note on quadratic residuosity and UP
From MaRDI portal
Publication:834917
DOI10.1016/j.ipl.2004.06.015zbMath1173.68518MaRDI QIDQ834917
Jin-Yi Cai, Robert A. Threlfall
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.015
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work
- On some natural complete operators
- Complexity classes without machines: on complete languages for UP
- Self-witnessing polynomial-time complexity and prime factorization
- Relative complexity of checking and evaluating
- NP-complete decision problems for binary quadratics
- Complexity Measures for Public-Key Cryptosystems
- A survey of one-way functions in complexity theory
- A method for obtaining digital signatures and public-key cryptosystems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item