Introduction to Learning With Errors (LWE) - Quantum Robust Public Key

[@kenrgoss]

The security of RSA is not based on the intractability of the discrete log problem for classical computers. You may wish to add an edit to that effect in your above notes. The rest of the discussion was of course correct as you followed up that statement by discussing the difficulty of integer factorization.

[@Retr0id]

I believe there are proofs that if you can solve DLP, you've solved factorization, and vice versa

[@MP-kd8zn]

I find your videos extremely helpful. You explain with such simple terms, this makes paper reading also very easy. Thank you Is there any restriction on the number of samples we choose?

[@aspidistrax_x2722]

Thank u so much. I finally got asymmetric lwe

[@rajthimmiah3859]

Thank you for the video and the simple explanation, I found it valuable.

[@fakhrihidayat3597]

Thanks for the explanation!

[@nithinbharadwajpunter]

Thank you. Appreciate your effort.

[@BastiaanQuast]

Thank you, very insightful

[@carlosnunodacruzribeiro1830]

I think there is something wrong with this video. Just try with s=6 and e=13 to see what I mean.

[@hxllside]

Yep, the reason it worked out is because he selected 5 (which is equal to s) values out of t

[@aaallami]

I really can't thank you enough for such an amazing tutorial.

[@imensonspionrona2117]

I don't get it. Given t and g you could calculate s and e with just one tuple of t and g?

[@elhassanimustapha3972]

thank you

[@SymonsChasel-f7w]

Harris John Thompson Brenda Jackson Margaret