Improved broadcast attacks against subset sum problems via lattice oracle

DOI10.1016/J.INS.2018.04.021MaRDI QIDQ2195373zbMATH OpenOpenAlexFDO

Authors Yang Yu, Dianyan Xiao

Publication date 8 September 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/28309

zbMATH Keywords

broadcast attacklattice-based cryptographysubset sum problem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Low-density attack revisited
• Solving low-density subset sum problems
• Solving low-density multiple subset sum problems with SVP oracle
• Improved low-density subset sum algorithms
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum

Cites work

• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
• Adapting Density Attacks to Low-Weight Knapsacks
• BKZ 2.0: Better lattice security estimates
• Efficient cryptographic schemes provably as secure as subset sum
• Hiding information and signatures in trapdoor knapsacks
• scientific article; zbMATH DE number 3910295 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1346512 (Why is no real title available?)
• scientific article; zbMATH DE number 1088235 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• scientific article; zbMATH DE number 1759776 (Why is no real title available?)
• scientific article; zbMATH DE number 1775383 (Why is no real title available?)
• scientific article; zbMATH DE number 6820265 (Why is no real title available?)
• scientific article; zbMATH DE number 7426016 (Why is no real title available?)
• Improved low-density subset sum algorithms
• Lattice enumeration using extreme pruning
• Lattice points in high-dimensional spheres
• New lattice based cryptographic constructions
• On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
• On lattices, learning with errors, random linear codes, and cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Predicting Lattice Reduction
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• Public-key cryptosystems from the worst-case shortest vector problem
• Solving dense subset-sum problems by using analytical number theory
• Solving low density knapsacks
• Trapdoors for hard lattices and new cryptographic constructions

Cited in

(1)

• Low-density attack revisited

Describes a project that uses

Uses Software

• BKZ

This page was built for publication: Improved broadcast attacks against subset sum problems via lattice oracle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195373)