~/talk

Lattices with Symmetry

links:none on file
slides:none on file

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

  1. 0:00Introduction and logistics
  2. 0:33Conference announcement
  3. 1:40Motivation for the research
  4. 2:44Overview of lattice schemes
  5. 5:40Decryption processes
  6. 8:24Addressing decryption failures
  7. 11:51Gentry-Szydlo algorithm
  8. 14:28Understanding the algorithm
  9. 18:14Mathematical innovations
  10. 21:53Lattice symmetry definitions
  11. 24:52Examples of G-lattices
  12. 28:51Main algorithm statement
  13. 32:19Connecting to Gentry-Szydlo
  14. 34:48Algorithmic steps and theory
  15. 38:09Future work and conclusion
  16. 43:25Q&A session
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.