On characterizing the existence of partial one-way permutations

DOI10.1016/S0020-0190(01)00269-1zbMATH Open1013.68082OpenAlexW2007477522MaRDI QIDQ1603545FDOQ1603545

Jörg Rothe, Lane A. Hemaspaandra

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

Recommendations

• Characterizing the existence of one-way permutations
• One-way permutations and self-witnessing languages
• One-way functions and circuit complexity
• scientific article; zbMATH DE number 3990863
• Absolute results concerning one-way functions and their applications

zbMATH Keywords

computational complexityone-way functionsone-way permutationsworst-case cryptography

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• One-way permutations and self-witnessing languages
• Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions
• ON THE CIRCUIT-SIZE OF INVERSES
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603545)