A polynomial-time algorithm for solving the hidden subset sum problem
type: Item
instance of: scholarly article
title: A polynomial-time algorithm for solving the hidden subset sum problem
zbMATH Open document ID: 1504.94126
DOI: 10.1007/978-3-030-56880-1_1
author: Jean-Sébastien Coron
author: Agnese Gini
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614561
zbMATH Keywords: Nguyen-Stern algorithm
zbMATH Keywords: lattice based algorithm
describes a project that uses: fpLLL
describes a project that uses: SageMath
describes a project that uses: BKZ
describes a project that uses: NTL
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 1
OpenAlex ID: W3021630508
cites work: On Lovász' lattice reduction and the nearest lattice point problem
cites work: Q4249640
cites work: Improved low-density subset sum algorithms
cites work: Q3374924
cites work: Using Algebraic Geometry
cites work: Practical Multilinear Maps over the Integers
cites work: BKZ 2.0: Better Lattice Security Estimates
cites work: Cryptanalysis of CLT13 multilinear maps with independent slots
cites work: Fault Attacks Against emv Signatures
cites work: On Kilian's randomization of multilinear map encodings
cites work: Cryptanalysis of the Co-ACD Assumption
cites work: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
cites work: Factoring polynomials with rational coefficients
cites work: Solving low-density subset sum problems
cites work: Q4364552
cites work: Q4249280
cites work: Q4249332
cites work: Q4941845
cites work: An LLL Algorithm with Quadratic Complexity
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: A hierarchy of polynomial time lattice basis reduction algorithms
cites work: Fully Homomorphic Encryption over the Integers
description: scientific article; zbMATH DE number 7614561