Description
Speaker: Jingbo Liu, Texas A&M University - San Antonio
Abstract: A lattice L is an additive discrete subgroup of ℝn. A set of linearly independent vectors B = {b1, ..., bn} ⊆ ℝn is called a basis of L if L = ℤb1 + ⋯ + ℤbn. When n ≥ 2, L has infinitely many possible bases. Bases consisting of relatively short and nearly orthogonal vectors are considered good bases, while others are regarded as bad bases. The lattice reduction theory studies how to obtain a good basis from a given one. In this talk, we will explore several lattice basis reduction methods and algorithms, along with their applications in cryptography and number theory.
Algorithm Seminar Series - Lattice Basis Reduction and Their Algorithms
Location
NPB 3.108A
Category:
Campus Events Students
