Keywords
Lattice reductionComputer scienceReduction (mathematics)AlgorithmBasis (linear algebra)Lattice (music)Theoretical computer scienceMathematicsTelecommunications
Affiliated Institutions
Related Publications
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the 'learning...
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár and Körner's book is widely regarded as a classic in the field of information theory, providing deep insights and expert treatment of the key theoretical issues. It incl...
Handbook of Discrete and Combinatorial Mathematics
Foundations. Counting Methods. Sequences. Number Theory. Algebraic Structures. Linear Algebra. Discrete Probability. Graph Theory. Trees. Networks and Flows. Partially Ordered S...
Bootstrap Methods and their Application
Bootstrap methods are computer-intensive methods of statistical analysis, which use simulation to calculate standard errors, confidence intervals, and significance tests. The me...
Multilevel diversity coding with distortion
In a Diversity Coding System, an information source is encoded by a number of encoders. There are a number of decoders, each of which can access a certain subset of the encoders...
Publication Info
- Year
- 1991
- Type
- book-chapter
- Pages
- 68-85
- Citations
- 162
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
162
OpenAlex
Cite This
C. P. Schnorr,
M. Euchner
(1991).
Lattice basis reduction: Improved practical algorithms and solving subset sum problems.
Lecture notes in computer science
, 68-85.
https://doi.org/10.1007/3-540-54458-5_51
Identifiers
- DOI
- 10.1007/3-540-54458-5_51