scientific article; zbMATH DE number 1500548

zbMATH Open0991.94036MaRDI QIDQ4501567FDOQ4501567

Authors: Mikael Goldmann, Alexander Russell Edit this on Wikidata

Publication date: 1 September 2002

Title of this publication is not available (Why is that?)

Recommendations

• Complexity bounds on general hard-core predicates.
• scientific article; zbMATH DE number 1088223
• General hardness amplification of predicates and puzzles. (Extended abstract)
• scientific article; zbMATH DE number 4208066
• Hard-core theorems for complexity classes
• On the hardness of satisfiability with bounded occurrences in the polynomial-time hierarchy
• The Complexity of Somewhat Approximation Resistant Predicates
• Hard promise problems and nonuniform complexity
• scientific article; zbMATH DE number 18529
• Explicit optimal hardness via Gaussian stability results

zbMATH Keywords

Boolean functioncryptographyone-way functioncryptographic primitiveshard core predicate

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Cited In (3)

• Complexity bounds on general hard-core predicates.
• Hardness amplification within NP
• Title not available (Why is that?)

This page was built for publication:

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