Introduction to Lattice Based Cryptography

preview_player
Показать описание

*One technical note: At 1:30 I claim that lattices are composed only of integers. This is not true. Some lattices only contain integers, but in general, any rational number will do.
Рекомендации по теме
Комментарии
Автор

About time I find a video that "dumbs" down this topic into information my brain can actually digest.

nataliejarusewski
Автор

DUDE, you just saved my whole physics assignment

armstronggaming
Автор

Thank you for simple yet great explanation..

prashuprashanth
Автор

Just what I was looking for. Thank You.

Shounak
Автор

at 5:01, why e<<q/4? is it ok when e << q/2?
and why we need bit*(q/2) ? is it ok we have bit*(q)? or bit*(q/3)?

macknightxu
Автор

at 6:27, is the task provided point b, we need to find the most suitable s which is a lattice point so that s is the most closest point of lattice to b?
what is "a basis" here mean? why we here need "a basis"?

macknightxu
Автор

3:58 probably you mean a pre-image resistant hash function?

_my_pobedim
Автор

Hi, if b1.x = A.s.x + e1 .x, then how does it convert to b1.x = s.u + e1.x? we know that A.x = u, but does it mean we can reposition s at the beginning? won't it violate commutative property?

randomvideos
Автор

at 6:15, what the relation between this cryptosystem, LWE and lattice? Not even metion lattice here.

macknightxu
Автор

owe well my method involving multiple ways to convert 1 integer into 2 or more smaller integers in a reversible way geometrically shuffling isn't in NP space either it can only do symmetric encryption and hashing.

quosswimblik
Автор

is LWE problem based on Lattice? so that hardness of LWE problem is as hard as the problem of finding the suitable s in the lattice?

so i could conclude that this cyptosystem's security is based on the hardness of LWE which is basically a field of the lattice cryptography ?

macknightxu
Автор

Hi, at 3:50,
why each of its entries is a 0 or 1 binary, then Alice's X is "unique"?
at 4:05, why is x = (A^-1)*u actually a collision resistant hash function? the multiplication could not be done? why couldn't it be done?

macknightxu
Автор

This may confuse some people at first. Here, we are talking about a lattice, which is kinda like a discrete module. Not to be confused with a lattice, which is an algebraic structure.

TheNomadic
Автор

If A is a M*N matrix, then how come bob's secret vector S has M entries? wouldn't there be a dimension mismatch while calculating A*S?

randomvideos
Автор

Yo I just completed algebra what is this lettuce cryptography you speak of?

johnooe
Автор

You never discuss the posets and how they relate to lattices. This video is great but it would have been nice for you to introduce that too.

navjotsingh
Автор

Lattices are *often* scaled over the integers, but it's definitely not true that the elements of the vectors themselves are.

ThefamousMrcroissant
Автор

taking exponential time on a QTM is impossible because it already is too exponentially powerfull

fait
Автор

Downvoting... really bad narration. Reading from a script... but sounds as though he is like some junior high school student rushing through a passage that the teacher asked him to read in front of the class....

mrv