@alexhagdahl6664

This series has been amazing! I’ve really struggled finding algorithms and code snippets for elliptic curve addition over large prime fields applicable to real world cryptographic parameters.

@CwanyBob

Your explanations are by far the best i found on the Internet. Thank You very much Sir!

@EmaMazzi76

Thank you for your clear explanation (and for the coding lesson as well)! No one compares to you on this kind of subject 👍

@tnorton314

Really helpful series, thanks again for making it.

@calebburke91

Thank you so much! I'm currently using ECC for a project and this explanation made it so much easier to understand!

@SachinSingh-iw4hf

Thank You Sir, It Helped in my project.

@betadistribution6534

I'd like to see a continuation of this series covering ECDH and ECDSA

@shahzadahmad1224

Sir this lecture is also awesome as your previous lectures. Sir, how can we use it to encrypt and decrypt a Matrix? Please make a video on that

@quitethecontrary1846

being that all points have an inverse that has the same x coordinate as its inverse....
it is only needed to store all the points from 1 thru (n-1)/2....thus only half the points need to be stored....
so do you think this would only take 1.5x10^34?