We will continue discussing the paper "Bivariate Polynomials Modulo Composites and their Applications" by Dan Boneh and Henry Corrigan-Gibbs  
https://eprint.iacr.org/2014/719.pdf

Discussion about the paper "Bivariate Polynomials Modulo Composites and their Applications" by Dan Boneh and Henry Corrigan-Gibbs  

In this talk, I describe the Function Field Sieve algorithm and its
application to solving the discrete log problem, highlighting Joux's
recent advancements that reduce the heuristic work factor to L(1/4 + o(1)).

Subspace codes were introduced by Koetter and Kschischang in 2007 as network error- correcting codes. Constant dimension codes is an important class of subspace codes. In this talk, we review and survey some bounds, constructions, decoding algorithm and application background for subspace codes and constant dimension codes.

A subset $X$ in $\{0,1\}^n$ is a called an $\epsilon$-biased set if for any nonempty subset $T\subseteq [n]$ the following condition holds. Randomly choosing an element $x\in X$, the parity of its T-coordinates sum has bias at most $\epsilon$. This concept is essentially equivalent or close to expanders, pseudorandom generators and linear codes of certain parameters. For instance, viewing $X$ as a generator matrix, an $\epsilon$-biased set is equivalent to an $[|X|, n]_2$-linear code of relative distance at least $1/2-\epsilon$. For fixed $n$ and $\epsilon$, it's a challenging problem to construct smallest $\epsilon$-biased sets. In this talk we will first introduce several known constructions of $\epsilon$-bias sets with the methods from number theory and geometrical coding theory. Then we will present a construction with a conjecture, which is closely related to the subset sum problem over prime fields.