On characterizing the existence of partial one-way permutations

DOI10.1016/S0020-0190(01)00269-1zbMath1013.68082OpenAlexW2007477522MaRDI QIDQ1603545

Jörg Rothe, Hemaspaandra, Lane A.

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00269-1

zbMATH Keywords

computational complexityone-way functionsone-way permutationsworst-case cryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (3)

One-way permutations and self-witnessing languages ⋮ ON THE CIRCUIT-SIZE OF INVERSES ⋮ Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions

Cites Work

• Unnamed Item
• Unnamed Item
• On hardness of one-way functions
• Complexity classes without machines: on complete languages for UP
• On polynomial time one-truth-table reducibility to a sparse set
• Relative complexity of checking and evaluating
• Sperner's lemma and robust machines
• Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
• Quasi-injective reductions
• Easy sets and hard certificate schemes
• Characterizing the existence of one-way permutations
• Complexity Measures for Public-Key Cryptosystems
• A survey of one-way functions in complexity theory
• P-Printable Sets

This page was built for publication: On characterizing the existence of partial one-way permutations