This channel is wildly underrated!

this may be the most accessible explanation of lattice crypto on the Internet

So good to see you back on KZread talking math again, Kelsey!

@y__h

9 ай бұрын

Oh I wonder why her voice sounds familiar!

@shresthamishra

4 ай бұрын

I'm so happy to find you again😢😢😊😊

the best explanation of lattice in youtube 🔥

I just found your channel from the PBS Infinite Series. It made my day to learn that you still make videos! I hope you keep uploading!

Stunningly great video. Super clear.

Thanks for this video, I could finally got the concept of the Shortest Vector Problem and Closest Vector Problem. I really appreciate your explanation.

Fascinating and well explained. Thank you

Well-articulated! Thank you.

such a beautifully well done video. Thank you for taking an intimidating concept and making it accessible.

Thank you so much. It's so simple and understandable

Amazing video, really really good. Thanks so much!!!

This video saved me a lot of time and confusion. Thank you so much for your great videos ♡♡♡

Very good video, glad this is the first video that showed up when I searched for this topic

I love your videos .keep up the good work.

This video really helped, thanks!

very pleasant to watch.

You videos are amazing and I recommended it to every person interested in cryptography, keep up the great work

Great video!

Awesome!

Thanks for video

c'est si clair et si bien expliqué. merci beaucoup !

Great presentation! The basic concept of lattice-based cryptography looks simple which I think is good for analyzing it in terms of security.

Great video

good one, thanks.

this was amazing!

This video is so cool 😎 thx

Thanks for the follow up on PQC standardization procedure. Maths part is always interesting?

Wow!!

5:02

finally. an educational video without ear-splitting intros, pointless soundbites and effects and people speaking broken english. keep up the simple and good work

Very informative.. thanks for putting together the insane math concepts in an easy to understand capsule!! I have one question though, which could be dumb 🙃 The strength with the algorithm is on keeping the 'good' basis confidential, and am curious on how it could be shared between Alice & Bob, without compromising it 🤔

@quartyom

Жыл бұрын

It's not shared. As it was said, Alice would receive a bad basis from Bob as a public key for encryption. The point is, no matter how bad basis is, its easy to combine vectors and get the point. But to decompose that point to the combination is VERY hard, having only bad vectors. Decryption is run by the owner of good basis to receive messages. This is how asymmetrical keys work

I think there was an interesting problem we just blew past in this video around 6:05, where Alice sets up two bases with the same lattice. Is there an easy algorithm that allows someone to generate the "bad" basis from the "good" basis in a non-reversible way? Or was the fact that there's a way to reverse that the algorithm the "sneakiness" you allude to around 7:50?

@TheAqissiaq

Жыл бұрын

I am not an expert on this, but I found the papers and the answer appears to be: 1) yes, several 2) no. GGH (1996) generate their bad basis by multiplying the good basis by some randomly generated unimodular (determinant ±1) matrix and picking a result in which the basis vectors are sufficiently parallel (the threshold value is a parameter to their scheme and is called "dual orthogonality defect" of the unreduced basis). They discuss a few ways to generate these unimodular matrices - for example you can put 1's along the diagonal, random numbers along the middle row or column, and zeros everywhere else. Nguyen's (1999) sneakiness is to solve the closest vector problem modulo "some well chosen integer". In addition to the bad basis, Alice needs to share a maximal error e, so that Bob knows how far from his lattice point the encrypted point can be. Nguyen then solves the problem modulo 2e which is much easier, and uses this to recover information with high probability.

@Bronzite

Жыл бұрын

@@TheAqissiaq I appreciate you doing the legwork on the actual papers. The unimodular matrix transformation seems reasonable, although I still have a nagging feeling that it would be tractable reversible if Eve knew the implementation they were using. Knowing that the maximal error is part of the public key also makes me feel a little better; I was thinking the "closest point" problem could be arbitrary under most lattices across a rational coordinate system given mutually prime bases, but having a fixed maximal error solves that issue. I was wondering if there was some principle of linear algebra that allowed for conclusive confirmation of the closest possible point I wasn't privy to.

@PvblivsAelivs

8 ай бұрын

The problem is hard to solve in the general case, because there _is_ no "good" basis. Given two vectors that are near-parallel, it is possible to reduce one with respect to the other so they are more orthogonal. In higher dimensions, it can be a bit trickier.

Can you provide books and references to read more on this? Also I'm planning to take courses on this. Please do recommend. Thanks. :)

Regular people: just another thing to look at. Mathematician: why can't I make a mathematical model of this

are you one from pbs infinite series i was waiting for your video

Could someone please share KYPER technique that perform the encryption and decryption?

I just was getting notifications from PBS Infinite Series. And there you are. Plan to restart those? Or production pace is too exausting?

I was really disappointed at the lack of visual representation of 17-dimentional lattice at 4:53 :(

@Daniel-ng8fi

8 ай бұрын

you should be grateful she didn't show it. It would have caused anyones head who viewed it to explode.

If you know the bad basis and the closest vector is it easy to verify?

How could Bob create the list of all lattice points using bad basis? If everyone having bad basis can create the lattice, what is stopping them from finding the closest lattice point just by visual inspection?

Anybody here heard about fourier trans in crystalography? Or about voronoi triangulation?

How do you create this kind of representation and animations of point lattices? I am writting a university project about post quantum cryptography, and I would like to introduce pictures and visualizations about lattices. Thanks :)

I love you ❤

0:41

All lattice propositions have been dropped by NIST at round 4, what does this imply for those protocols?

@BlueDippy

9 ай бұрын

The thing is I was thinking of some “lattice” based encryption method a while ago. And then I got to thinking… it’s all just perceived as a lattice based on a data structure and algorithm. I mean… it’s a lattice in our heads because of how we think. But in a computer it’s literally just abstract bits lol.

@chalktalkmath

9 ай бұрын

They already chose to standardize some algorithms, including lattice-based ones. The fourth round is being used to explore additional non-lattice algorithms. It's slightly different than the previous rounds.

You'd think going from a good basis to a bad basis would be easier! Like translating a vector! 🤔 Otherwise very nicely explained, won't be for everyone but perfect level for me! Thanks

Why can't the bad basis simply be orthonormalized?

* Two different looking basis vectors can generate same lattice. * Shortest Vector Problem: The point constructed by basis that is closest to origin, other than origin * Closest Vector Problem: Similar to SVP, but the point can be anything, not only origin.

wawawewa, it's a very nice!

Why is it always Alice & Bob

@Kyoz

5 ай бұрын

Because the alphabet goes, A, B, C...

noooooooooooo why are you gone again?!? why did I not find the channel earlier? whhhhhy edit: oh, I am so sad