Title: Fast lattice point enumeration with minimal overhead
| Speaker: | Luis Ruiz |
| Affililation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
This is a reminder for our next meeting that will take place on Monday in MC6486.
Door will open at 4:15pm. As usual we will have 15 mins for socializing and for eating pizza before the talk starts (at 4:30pm sharp).
"The
geometry
of
numbers
has
been
a
very
important
tool
for
number
theory
and
other
areas
of
mathematics,
and
more
recently
has
also
found
a
place
for
industrial
applications.
Some
cryptographic
constructions
base
their
security
on
the
assumption
that
solving
certain
lattice
problems
is
hard.
To
better
understand
their
security
it
is
necessary
to
understand
the
existing
algorithms
to
solve
them.
In
this
talk
we
will
review
some
of
the
best
currently
known
algorithms
to
solve
lattice
problems."
The
presentation
will
be
based
on
the
following
manuscript:
https://eprint.iacr.org/2014/569.pdf
For
more
information
about
our
reading
group,
please
visit
our
webpage
http://www.math.uwaterloo.ca/~k2georgi/reading.htm