Pages that link to "Item:Q4174761"
From MaRDI portal
The following pages link to A note on the complexity of cryptography (Corresp.) (Q4174761):
Displaying 7 items.
- An observation on associative one-way functions in complexity theory (Q293135) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- On hardness of one-way functions (Q1097693) (← links)
- A time-luck tradeoff in relativized cryptography (Q1171879) (← links)
- Knottedness is in NP, modulo GRH (Q2445896) (← links)
- Crypto Galore! (Q2908530) (← links)
