Pages that link to "Item:Q3569744"

The following pages link to Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms (Q3569744):

Displaying 8 items.

• A dichotomy for local small-bias generators (Q315550) (← links)
• Cryptographic hardness of random local functions. Survey (Q332271) (← links)
• Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms (Q1678752) (← links)
• The complexity of inverting explicit Goldreich's function by DPLL algorithms (Q1946844) (← links)
• Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
• On the one-way function candidate proposed by Goldreich (Q2828220) (← links)
• The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms (Q3007623) (← links)
• The Complexity of Public-Key Cryptography (Q5021130) (← links)