Pages that link to "Item:Q1096587"
From MaRDI portal
The following pages link to One-way functions and circuit complexity (Q1096587):
Displaying 20 items.
- Inverse monoids associated with the complexity class NP (Q666698) (← links)
- On complete one-way functions (Q734307) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- On some natural complete operators (Q1064780) (← links)
- On hardness of one-way functions (Q1097693) (← links)
- One-way permutations in NC 0 (Q1108786) (← links)
- Normal numbers and sources for BPP (Q1391532) (← links)
- Characterizing the existence of one-way permutations (Q1575721) (← links)
- On characterizing the existence of partial one-way permutations (Q1603545) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- On continuous one-way functions (Q2220825) (← links)
- Monotone circuits: one-way functions versus pseudorandom generators (Q2913810) (← links)
- Generic Case Complexity and One-Way Functions (Q3617414) (← links)
- New combinatorial complete one-way functions (Q4910741) (← links)
- Fast Software Encryption (Q5713908) (← links)
- Fine-grained cryptography revisited (Q5918348) (← links)
- A lower bound for primality (Q5943093) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
