A note on quadratic residuosity and UP

DOI10.1016/j.ipl.2004.06.015zbMath1173.68518OpenAlexW2128936775MaRDI QIDQ834917

Robert A. Threlfall, Jin-Yi Cai

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

zbMATH Keywords

computational complexityone-way functionsUPhigher power residuosityquadratic residuosity

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A note on quadratic residuosity and UP