Mathematical Ideas in Lattice Based Cryptography - Jill Pipher

2018 Program for Women and Mathematics
Topic: Mathematical Ideas in Lattice Based Cryptography
Speaker: Jill Pipher
Affiliation: Brown University
Date: May 21, 2018
For more videos, please visit video.ias.edu

[@ndmath]

Really great presentation!

[@paulwang8784]

great intro！

[@digitalconsciousness]

9:35 What can the lattice point closest to t represent in a real world example (in encryption software)? It seems obvious that the lattice point could not be an entire document that you want encrypted. I could only imagine it being enough to maybe represent a single byte of information. If this is the case, given that a single basis must be represented by two integers (one to define each vector), and that the lattice would in practice be hundreds of dimensions in size, would you not require each point to have x,y,z...[to 500th dimension] coordinates for each byte/point? That would be hundreds of coordinates per point that would have to be saved to the encrypted file, no? Or do you pick a single 499 long coordinate to act as a static position so that your bytes only have to be represented by the 500th dimension, thereby reducing the number of coordinates to represent points down to 1? That would make it be a reasonable file size for the encrypted file, but does that jeopardize the security of such encryption? I would have imagined each byte/point having a unique position somewhere in the vast 500 dimension lattice. I would love to have someone shed some light on this. I'm sure it's because I just don't know enough about it. Loved the talk, Mrs Pipher! Awesome!