Lattices with Symmetry
summary
Gives a concrete deterministic polynomial-time algorithm that decides whether a lattice with a fixed finite abelian symmetry group G is G-isomorphic to the standard G-lattice and, when so, constructs the isomorphism (equivalently finds an orthonormal basis). Method translates Gentry–Zidlow into graded tensor algebras, replaces heuristic primes by provable auxiliary prime powers via analytic number theory, and extracts short vectors using LLL plus commutative-algebra routines; algorithm is proven correct and polynomial-time, not yet implemented.
AI-written summary · about
chapters (16)
- 0:00Introduction and logistics
- 0:33Conference announcement
- 1:40Motivation for the research
- 2:44Overview of lattice schemes
- 5:40Decryption processes
- 8:24Addressing decryption failures
- 11:51Gentry-Szydlo algorithm
- 14:28Understanding the algorithm
- 18:14Mathematical innovations
- 21:53Lattice symmetry definitions
- 24:52Examples of G-lattices
- 28:51Main algorithm statement
- 32:19Connecting to Gentry-Szydlo
- 34:48Algorithmic steps and theory
- 38:09Future work and conclusion
- 43:25Q&A session
related talks
01h 42mMathematics of Lattices
01h 08mThe Mathematics of Lattices I
01h 04mThe Mathematics of Lattices II
57mAlgorithms for Lattice Problems, in Practice
57mTutorial: Encrypted Computation from Lattices
01h 36mAlgorithms for Algebraic Lattices: Classical and Quantum
01h 02mLattice Trapdoors
01h 00mMultilinear Maps and Attacks I
