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.
@Retr0id10 ай бұрын
I believe there are proofs that if you can solve DLP, you've solved factorization, and vice versa
@MP-kd8zn3 жыл бұрын
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_x27228 ай бұрын
Thank u so much. I finally got asymmetric lwe
@rajthimmiah38596 жыл бұрын
Thank you for the video and the simple explanation, I found it valuable.
@fakhrihidayat35972 жыл бұрын
Thanks for the explanation!
@nithinbharadwajpunter5 жыл бұрын
Thank you. Appreciate your effort.
@BastiaanQuast5 жыл бұрын
Thank you, very insightful
@carlosnunodacruzribeiro18302 жыл бұрын
I think there is something wrong with this video. Just try with s=6 and e=13 to see what I mean.
@hxllside2 жыл бұрын
Yep, the reason it worked out is because he selected 5 (which is equal to s) values out of t
@aaallami5 жыл бұрын
I really can't thank you enough for such an amazing tutorial.
@imensonspionrona21175 жыл бұрын
I don't get it. Given t and g you could calculate s and e with just one tuple of t and g?