Pages that link to "Item:Q3582782"
From MaRDI portal
The following pages link to Time Space Tradeoffs for Attacks against One-Way Functions and PRGs (Q3582782):
Displaying 29 items.
- New proofs for NMAC and HMAC: security without collision resistance (Q901373) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Password hashing and preprocessing (Q2056723) (← links)
- Cryptographic pseudorandom generators can make cryptosystems problematic (Q2061967) (← links)
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions (Q2096481) (← links)
- On the memory-tightness of hashed ElGamal (Q2119004) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q2692335) (← links)
- Unifying presampling via concentration bounds (Q2695631) (← links)
- Time–Memory Trade-Off Attack on the GSM A5/1 Stream Cipher Using Commodity GPGPU (Q2794508) (← links)
- On the Complexity of Breaking Pseudoentropy (Q2988853) (← links)
- Simulating Auxiliary Inputs, Revisited (Q3179356) (← links)
- Analysis of Rainbow Tables with Fingerprints (Q3194613) (← links)
- Proofs of Catalytic Space (Q5090438) (← links)
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited (Q5267415) (← links)
- (Q6062142) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
- Bit security as computational cost for winning games with high probability (Q6157548) (← links)
- Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions (Q6192059) (← links)
- On time-space lower bounds for finding short collisions in sponge hash functions (Q6582219) (← links)
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q6617635) (← links)
- Trapdoor memory-hard functions (Q6637334) (← links)
- Tight characterizations for preprocessing against cryptographic salting (Q6652927) (← links)
- Unconditionally secure quantum commitments with preprocessing (Q6653000) (← links)
- Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method (Q6663524) (← links)