This video was really helpful in my understanding of the RSA broadcast attack! Thank you Bill! :)

amazing explanation. thank you!

Internet can be very unforgiving place and that's why privacy and anonymity are important. Like Bruce said in his book "Data and Goliath"; "forgetting is forgiving". Erasing embarrassing posts prevents them from affects your future.

thank you for making this available to us plebs Bill

Loved this. Thank you for sharing.

this is very helpful!

Math + CS = Lamport? 😂

This IS the interview between two legends that we all needed. Love how humble DJB is and the motivation of curiosity. Thank you!

thank you Dr

Just finished listening. Ted sounds like a really genuine and grounded person. Enjoyed this interview a lot.

Hi Bill! Remember the painting of the Sator square? Today I heard a very plausible theory that it describes LNER tech. As an electrical engineer I'm certain this would be interesting to you. There's an amazing group of people on yt that are experimenting with low energy tech in their sheds! Amazing stuff. Blessings to you and the family. A

Oh My God, I finally understood how group theory connects to Diffie Hellman! Thank you so much!

1:05:30

Sorry it doesn't work, can you check again for me?

Gracias profesor por su contenido y su pagina web es muy util, saludos desde Peru 🇵🇪

Great video can you do one about precalculation for rsa/diffie hellman decryption or generating 1024 bit primes? Or prime reuse?

Great but can you not teach with an etchasketch? Perhaps use a notepad or notepad. When you say 1024 bit prime does that mean prime numbers that are exactly 1024 bits in length or can it be less or more ?

damn bitcoins ecdsa

Indeed! How prescient they were as was this gentleman kzbin.info/www/bejne/kHSyeHmJrNd6hMU

You are the best, Sir

Bill, this makes me so sad! What can we do? Are we lost?

sir can you please provide example using RLWE based BGV scheme

underrated channel

I think this channel is heaven for cryptographers.

Well that counts some of the good explanation available

Thank you!

this interview is very much informative for new cipher designers.

Awesome

Relying on brain, thats the key! 😊

thank you

thanks, dude

Can you explain how to calculate the inverse of “x+1” that “(x+1)^{-1} = x^3+x^2+x”?

I have not managed to set the connection via usb(

whit is the most vibrant of all cryptographers ive ever listened too and i love it

Greate Video! Thanks a lot :)

Thanks for creating these unique videos. first year in college and decided to learn cryptography and you have tons of videos about it.

OMG, you're Thunderf00t!

Thank you so much. Ur videos really help me❤

Thank u so much. I finally got asymmetric lwe

thanks

😅 Bruce is so blunt and to the point! Very entertaining to watch; I'd love to chat to him at dinner and see him really let loose!

Hi Bill! Great to see you going strong!

Ok, so the ed25519 algorithm is basically EdDSA?

I just found your website! Thank you so much!

For, e(x·G1, x·G2) · e(G1, -x·G2) · e(G1, 42·G2) = 0 Not sure if we can obtain -x·G2 from x·G2... So the second pairing could instead be e( -1·G1, x·G2) PS, in mod arithmetics, -1*G1 would just be <Order - 1>*G1 Can someone clarify if -1G1 should be <Field - 1> instead?

thanks for posting

Thank You Sir , Very helpful .

Superb explanation.

Best presentation for beginners.