One-way permutations in NC 0

DOI10.1016/0020-0190(87)90053-6zbMath0654.68037OpenAlexW2008718608WikidataQ56959263 ScholiaQ56959263MaRDI QIDQ1108786

Johan T. Håstad

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90053-6

zbMATH Keywords

parallel computationNCP-completenessone-way permutation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Discrete mathematics in relation to computer science (68R99)

Related Items (max. 100)

Functional inversion and communication complexity ⋮ Fine-grained secure computation ⋮ One-way functions and circuit complexity ⋮ Unconditionally secure NIZK in the fine-grained setting ⋮ Reductions in circuit complexity: An isomorphism theorem and a gap theorem ⋮ Fine-Grained Cryptography ⋮ Hardness and optimality in QBF proof systems modulo NP

Cites Work

• Probabilistic encryption
• One way functions and pseudorandom generators
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Unnamed Item
• Unnamed Item

This page was built for publication: One-way permutations in NC 0