Balanced Integer Solutions of Linear Equations

DOI10.1007/978-3-319-04720-1_11zbMath1362.11039OpenAlexW2119249902MaRDI QIDQ2926145

Konstantinos A. Draziotis

Publication date: 30 October 2014

Published in: Applications of Mathematics and Informatics in Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04720-1_11

zbMATH Keywords

latticelinear Diophantine equationLLLclosest vector problem (CVP)

Mathematics Subject Classification ID

Integer programming (90C10) Computer solution of Diophantine equations (11Y50) Linear Diophantine equations (11D04)

Related Items (1)

Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved low-density subset sum algorithms
• The Magma algebra system. I: The user language
• On the Chor-Rivest knapsack cryptosystem
• Algorithms for the Shortest and Closest Lattice Vector Problems
• Solving low-density subset sum problems
• Predicting Lattice Reduction
• A Note on the Linear Diophantine Equation
• Hiding information and signatures in trapdoor knapsacks

This page was built for publication: Balanced Integer Solutions of Linear Equations