An infinitely-often one-way function based on an average-case assumption

DOI10.1090/S1061-0022-10-01103-9zbMath1205.68164MaRDI QIDQ3586759

Edward A. Hirsch, Dmitry Itsykson

Publication date: 1 September 2010

Published in: St. Petersburg Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

one-way functionaverage-case complexity

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic randomness and dimension (03D32)

Related Items (1)

On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography

Cites Work

• On the theory of average case complexity
• The tale of one-way functions
• Average-Case Complexity
• Average Case Complete Problems
• Foundations of Cryptography

This page was built for publication: An infinitely-often one-way function based on an average-case assumption