Pages that link to "Item:Q2867160"
From MaRDI portal
The following pages link to Non-uniform Cracks in the Concrete: The Power of Free Precomputation (Q2867160):
Displayed 16 items.
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound (Q1631324) (← links)
- Short variable length domain extenders with beyond birthday bound security (Q1633453) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- State separation for code-based game-playing proofs (Q1710673) (← links)
- On the security of the WOTS-PRF signature scheme (Q1726024) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Cryptographic pseudorandom generators can make cryptosystems problematic (Q2061967) (← links)
- Solving discrete logarithm problems faster with the aid of pre-computation (Q2322875) (← links)
- Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited (Q5267415) (← links)
- The query-complexity of preprocessing attacks (Q6145923) (← links)
- Bit security as computational cost for winning games with high probability (Q6157548) (← links)
- Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions (Q6163945) (← links)