Winter School on Cryptography: Introduction to Lattices - Oded Regev

[@sayanc2011]

In the fundamental parallelepiped slide at 1:05:00 you define the operation for mapping any point wrt the basis as constituting of taking the modulo 1 of the coefficients. I think the operation would be modulo 2.

[@idonahshon1118]

it's a little bit of notation abuse, but mod 1 means mod R/Z (real number x such that 0

[@epsilondelta_873]

Why?

[@vajagicjovana]

In some books it says for any two bases B1 and B2 is: B1=UB1, where U is unimodular matrix. (B1 is defined as matrix where rows are coordinates of vectors in bases). Is it true? I supposed it is, because of this "translation" . Also, rank and dimension are reversed. For example, if L is subset of R^m, and basis is v1,...,vn, than n is dimension, and m is rank.

[@nicholasheltzel7439]

Has anybody utilized lattice based cryptography, that is in movement? If we can utilize lattices in cryptography, wouldn't it add another layer of security, to use typical factoring in these examples, in order to move the dimensions and thus the "type" of lattice from character to character, that we want to encrypt?

[@tinglu3753]

Where are other topics?

[@waynr]

why do you bother recording in stereo if you aren't going to balance left and right channels?

[@SphereofTime]

1:33:33