New generic algorithms for hard knapsacks
From MaRDI portal
Recommendations
Cited in
(58)- scientific article; zbMATH DE number 2059840 (Why is no real title available?)
- Improved Generic Algorithms for Hard Knapsacks
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Extension of Brickell’S Algorithm for Breaking High Density Knapsacks
- Reducing the number of qubits in solving LWE
- Classical and quantum algorithms for variants of subset-sum via dynamic programming
- Bias from uniform nonce: revised Fourier analysis-based attack on ECDSA
- An algorithmic framework for the generalized birthday problem
- Constructing Carmichael numbers through improved subset-product algorithms
- A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
- Quantum key search for ternary LWE
- Efficient dissection of bicomposite problems with cryptanalytic applications
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
- Generalization of the ball-collision algorithm
- How to meet ternary LWE keys
- Improved classical and quantum algorithms for subset-sum
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Fine-grained cryptanalysis: tight conditional bounds for dense \(k\)-SUM and \(k\)-XOR
- Cryptanalysis of the knapsack generator
- Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
- Subset Sum Quantumly in 1.17 n .
- How to find ternary LWE keys using locality sensitive hashing
- A hybrid of lattice-reduction and Meet-LWE via near-collision on Babai's plane
- TinyKeys: a new approach to efficient multi-party computation
- Quantum collision search for ternary LWE keys
- SoK: on the security of cryptographic problems from linear algebra
- Memory-efficient attacks on small LWE keys
- Improved quantum algorithms for the k-XOR problem
- On Wagner's k-tree algorithm over integers
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
- Lattice-based algorithms for number partitioning in the hard phase
- The Modular Subset-Sum Problem and the size of deletion correcting codes
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2
- Improved space bounds for subset sum
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- scientific article; zbMATH DE number 7525510 (Why is no real title available?)
- Information set decoding for Lee-metric codes using restricted balls
- A faster algorithm for pigeonhole equal sums
- scientific article; zbMATH DE number 7378707 (Why is no real title available?)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- From multiple encryption to knapsacks -- efficient dissection of composite problems
- Improved information set decoding for code-based cryptosystems with constrained memory
- CryptAttackTester: high-assurance attack analysis
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- Improved alternating-moduli PRFs and post-quantum signatures
- Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
- A low-memory algorithm for finding short product representations in finite groups.
- Smooth subsum search a heuristic for practical integer factorization
- A novel algorithm for the k-XOR problem
- Memory-efficient attacks on small LWE keys
- Integer factorization as subset-sum problem
- Faster algorithm for solving hard knapsacks for moderate message length
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
This page was built for publication: New generic algorithms for hard knapsacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563838)
