Non-abelian analogs of lattice rounding

DOI10.1515/gcc-2015-0010zbMath1345.94037arXiv1501.03056OpenAlexW2963205446MaRDI QIDQ889981

Ramarathnam Venkatesan, Stephen D. Miller, Evgeni Begelfor

Publication date: 9 November 2015

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.03056

zbMATH Keywords

Lyapunov exponentsmatrix groupsinapproximabilitynorm concentrationword problemslattice rounding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Approximation algorithms (68W25)

Related Items (3)

Privacy preservation for machine learning training and classification based on homomorphic encryption schemes ⋮ An Average Case NP-complete Graph Colouring Problem ⋮ Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)

This page was built for publication: Non-abelian analogs of lattice rounding