On the regularity of the generalized birthday problem
From MaRDI portal
Cites work
- \(k\)-SUM in the sparse regime: complexity and applications
- A generalized birthday problem
- A monte carlo method for factorization
- An algorithmic framework for the generalized birthday problem
- An Improved LPN Algorithm
- An improved Monte Carlo factorization algorithm
- Computing Partitions with Applications to the Knapsack Problem
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Exact weight subgraphs and the k-sum conjecture
- Fast correlation attacks through reconstruction of linear polynomials
- Fine-grained cryptanalysis: tight conditional bounds for dense \(k\)-SUM and \(k\)-XOR
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- Incremental cryptography: The case of hashing and signing
- Incremental hash function based on pair chaining \& modular arithmetic combining
- Incremental multiset hash functions and their application to memory integrity checking
- Keying hash functions for message authentication
- Linearization Attacks Against Syndrome Based Hashes
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- On a class of \(O(n^ 2)\) problems in computational geometry
- On computing nearest neighbors with applications to decoding of binary linear codes
- On iterative collision search for LPN and subset sum
- On the (in)security of ROS
- Progress in Cryptology – Mycrypt 2005
- Proofs of Work from worst-case assumptions
- Public-key cryptography in the fine-grained setting
- Security bounds for the design of code-based cryptosystems
- Security of blind discrete log signatures against interactive attacks
- Short signatures from regular syndrome decoding in the head
- The extended \(k\)-tree algorithm
- Wagner's algorithm provably runs in subexponential time for \(\mathrm{SIS}^\infty \)
This page was built for publication: On the regularity of the generalized birthday problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443553)