Pages that link to "Item:Q3877553"
From MaRDI portal
The following pages link to A cryptanalytic time-memory trade-off (Q3877553):
Displaying 50 items.
- New second-preimage attacks on hash functions (Q321303) (← links)
- Key recovery attacks on iterated Even-Mansour encryption schemes (Q321305) (← links)
- A comparison of cryptanalytic tradeoff algorithms (Q380959) (← links)
- An analysis of chain characteristics in the cryptanalytic TMTO method (Q391319) (← links)
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- A practical attack on KeeLoq (Q421044) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Espresso: a stream cipher for 5G wireless communication systems (Q505077) (← links)
- Differential cryptanalysis of DES-like cryptosystems (Q807011) (← links)
- New proofs for NMAC and HMAC: security without collision resistance (Q901373) (← links)
- Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers (Q963420) (← links)
- Success probability of the Hellman trade-off (Q976114) (← links)
- Is the data encryption standard a group? (Results of cycling experiments on DES) (Q1112006) (← links)
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound (Q1631324) (← links)
- Ranks of ideals in inverse semigroups of difunctional binary relations (Q1639997) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- Flatness and structural analysis as a constructive framework for private communication (Q1730330) (← links)
- Estimates of the mean size of the subset image under composition of random mappings (Q1741464) (← links)
- Limit theorem for the size of an image of subset under compositions of random mappings (Q1744358) (← links)
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps. (Q1853119) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- The cost of false alarms in Hellman and rainbow tradeoffs (Q1960220) (← links)
- Efficient dissection of bicomposite problems with cryptanalytic applications (Q2010595) (← links)
- Internal state recovery of espresso stream cipher using conditional sampling resistance and TMDTO attack (Q2025386) (← links)
- Collisions and incidence of vertices and components in the graph of \(k\)-fold iteration of the uniform random mapping (Q2050235) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- The memory-tightness of authenticated encryption (Q2096479) (← links)
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions (Q2096481) (← links)
- A state bit recovery algorithm with TMDTO attack on Lizard and Grain-128a (Q2115734) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Generic attacks on hash combiners (Q2188959) (← links)
- Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem (Q2188960) (← links)
- Tight time-memory trade-offs for symmetric encryption (Q2292656) (← links)
- Solving discrete logarithm problems faster with the aid of pre-computation (Q2322875) (← links)
- Analysis of the perfect table fuzzy rainbow tradeoff (Q2336696) (← links)
- Optimizing a password hashing function with hardware-accelerated symmetric encryption (Q2337862) (← links)
- An approach for stream ciphers design based on joint computing over random and secret data (Q2390944) (← links)
- Generic cryptographic weakness of \(k\)-normal Boolean functions in certain stream ciphers and cryptanalysis of Grain-128 (Q2434149) (← links)
- The higher-order meet-in-the-middle attack and its application to the Camellia block cipher (Q2437779) (← links)
- Square reflection cryptanalysis of 5-round Feistel networks with permutations (Q2445261) (← links)
- Comparison of perfect table cryptanalytic tradeoff algorithms (Q2630712) (← links)
- A new decryption failure attack against HQC (Q2692347) (← 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)
- Tradeoff Cryptanalysis of Memory-Hard Functions (Q2795993) (← links)
- Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks (Q2807196) (← links)
- Memory-Efficient Algorithms for Finding Needles in Haystacks (Q2829215) (← links)
