Short review of lattice basis reduction types and his applications (Russian)
classification
💻 cs.DM
math.GR
keywords
latticetheorybasisreductiontypesapplicationsarticlecryptanalysis
read the original abstract
This article presets a review of lattice lattice basis reduction types. Paper contains the main five types of lattice basis reduction: size reduced (weak Hermit), c-reduced, Lovasz condition, Hermit-Korkin-Zolotarev, Minkowski reduced. The article provides references to applications in: information theory (decoding of coding group in MIMO), calculus (minimize of the positive quadratic form), complexity theory and cryptanalysis of Merkle-Hellman cryptography (solving subset sum problems), algebra and control theory(solving system of linear diophantine equation), compiler theory (lattice based memory allocation), synthesize cryptographic and cryptanalysis in lattice based cryptography.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.