An important construction for (the information theoretic version of) semantic security is a “Biregular Irreducible Function” (BRI). These can be constructed from a complete biregular graph on $2^k d \times 2^k d$ by by coloring it with $2^k$ colors in such a way that each vertex has degree $d$ in each color. Good BRI’s are ones in which each color class forms an expander graph on the underlying vertex set. I will show a result of Wiese and Boche that shows the existence of colorings in which each color class has (spectrally) optimal expansion, which we call a “Ramanujan coloring”. The proof is a clever modification of an earlier result that uses the “method of interlacing polynomials” to understand the expansion of graph lifts, which I will discuss as well.