Pages that link to "Item:Q2795995"
From MaRDI portal
The following pages link to Refinements of the k-tree Algorithm for the Generalized Birthday Problem (Q2795995):
Displaying 12 items.
- The extended \(k\)-tree algorithm (Q431783) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- An algorithmic framework for the generalized birthday problem (Q1999907) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← 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)
- On the security of ECDSA with additive key derivation and presignatures (Q2170006) (← links)
- Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2 (Q2170080) (← links)
- Efficient and extensive search for precise linear approximations with high correlations of full SNOW-V (Q2673990) (← links)
- A New Algorithm for the Unbalanced Meet-in-the-Middle Problem (Q2958141) (← links)
- Improved quantum algorithms for the k-XOR problem (Q6618596) (← links)
- \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)
