Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
type: Item
instance of: scholarly article
title: Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
zbMATH Open document ID: 1479.94165
DOI: 10.1007/978-3-030-45727-3_4
author: Andre Esser
author: Alexander May
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436942
zbMATH Keywords: low weight dlog
zbMATH Keywords: subset sum
zbMATH Keywords: representations
zbMATH Keywords: nested rho
MaRDI profile type: Publication
full work available at URL: 978-3-030-45727-3 4
OpenAlex ID: W2919452334
cites work: SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
cites work: Faster space-efficient algorithms for subset sum and k-sum
cites work: Improved Generic Algorithms for Hard Knapsacks
cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
cites work: Quantum Algorithms for the Subset-Sum Problem
cites work: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
cites work: A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
cites work: Memory-Efficient Algorithms for Finding Needles in Haystacks
cites work: LPN decoded
cites work: Chosen-Ciphertext Security from Subset Sum
cites work: Mathematics of public key cryptography.
cites work: Recent progress on the elliptic curve discrete logarithm problem
cites work: LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
cites work: Efficient cryptographic schemes provably as secure as subset sum
cites work: Q4344097
cites work: Solving low-density subset sum problems
cites work: Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
cites work: A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
cites work: Hiding information and signatures in trapdoor knapsacks
cites work: Cycle detection using a stack
cites work: Q3360789
cites work: A monte carlo method for factorization
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Q4063214
cites work: Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
cites work: Parallel collision search with cryptanalytic applications
Recommended article: A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2)
Recommended article: A subexponential-time algorithm for computing discrete logarithms over&lt;tex&gt;GF(p^2)&lt;/tex&gt;
Recommended article: A general framework for subexponential discrete logarithm algorithms
Recommended article: A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
Recommended article: Computing low-weight discrete logarithms
Recommended article: A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
Recommended article: Q4341740
Recommended article: Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
Recommended article: Improved low-memory subset sum and LPN algorithms via multiple collisions
Recommended article: Lower bounds on the linear complexity of the discrete logarithm in finite fields
description: scientific article; zbMATH DE number 7436942