Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
From MaRDI portal
Publication:2055649
DOI10.1007/978-3-030-45727-3_4zbMath1479.94165OpenAlexW2919452334MaRDI QIDQ2055649
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_4
Related Items (6)
A new approach for finding low-weight polynomial multiples ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ Algebraic algorithms for variants of subset sum ⋮ Finding low-weight polynomial multiples using the rho method ⋮ Efficient reductions and algorithms for subset product ⋮ Parallel isogeny path finding with limited memory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent progress on the elliptic curve discrete logarithm problem
- Parallel collision search with cryptanalytic applications
- LPN decoded
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
- Cycle detection using a stack
- Efficient cryptographic schemes provably as secure as subset sum
- Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
- A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
- Chosen-Ciphertext Security from Subset Sum
- Memory-Efficient Algorithms for Finding Needles in Haystacks
- Mathematics of Public Key Cryptography
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Improved Generic Algorithms for Hard Knapsacks
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
- Solving low-density subset sum problems
- A monte carlo method for factorization
- Quantum Algorithms for the Subset-Sum Problem
- Faster space-efficient algorithms for subset sum and k-sum
- SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
- LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
- Hiding information and signatures in trapdoor knapsacks
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
