Pages that link to "Item:Q1999907"
From MaRDI portal
The following pages link to An algorithmic framework for the generalized birthday problem (Q1999907):
Displaying 12 items.
- The extended \(k\)-tree algorithm (Q431783) (← links)
- Efficient dissection of bicomposite problems with cryptanalytic applications (Q2010595) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions (Q2161418) (← links)
- Refinements of the k-tree Algorithm for the Generalized Birthday Problem (Q2795995) (← links)
- (Q4004968) (← links)
- Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes (Q5087252) (← links)
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW (Q6135457) (← links)
- Birth, death, coincidences and occupancies: solutions and applications of generalized birthday and occupancy problems (Q6170564) (← links)
- Extended attacks on ECDSA with noisy multiple bit nonce leakages (Q6547864) (← links)
- Improved quantum algorithms for the k-XOR problem (Q6618596) (← links)
- \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)
