Lecture 11: Number Theory for PKC: Euclidean Algorithm, Euler's Phi Function & Euler's Theorem

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

2:40 Euclidean Algorithm
23:50 extended Euclidean Alg.
1:12:20 Some theorems

dpraajz
Автор

I don't know why anyone would be sleep for a lecture on Number Theory! To me, this one of most lovable fields of Mathematics and definitely my favourite. Great lecture, knew most but watched it purely for pleasure. Greetings from Finland :D

Darkenedbyshadows
Автор

Professor Paar, Thank you very much for your methods of teaching. it makes everything so clear. Big applause.

TheImaginary
Автор

The best lecture about Number Theory for PKC out there! Thank You Prof. Paar!

mdvm
Автор

I was tearing my hair out figuratively and literally trying to understand this chapter of my cryptography book. I was so happy to see you have a lecture here thank Dr Paar

dongyongkim
Автор

I had such a horrible number theory professor. I would beg to have a professor like this guy.

rikenm
Автор

Hello from Kent State University.  I am using your material for individual study and the lectures help me TREMENDOUSLY!  Thanks!

lanceschamberg
Автор

"You can start playing cards again". Don't think I've ever heard a prof say that before.

AlDumbrava
Автор

I wish I found this series of lectures earlier. I laughed out loud when he said you don’t want to learn the Extended Euclidean Algorithm, because that is what my cryptography professor told our class to do 😆. In fact he made us cover the entire number theory portion of the course on our own.

thetyler
Автор

I paid for this on Coursera and it was awful. Prof Christof Paar, you are the sweetest and the brightest!

slaozeren
Автор

The ONLY way to truly get comfortable with Euclid Extended is to work on the exercises... and then get a friend to write 100 more for you to solve. Really, do fifty by hand. It helped me to use red ink for the r0 and r1 values. That way I could see them as algebra variables I was trying to isolate. Thank you Prof. Paar !

timetraveller
Автор

wooow this Professor is insane at explaining Concepts🤩🤩🤩

rohitsutrave
Автор

You may not read this since it's been over 2 years since posting this video, but thanks. I'm currently taking a Cryptography course and missed portions of some lectures and this video was very helpful.

eikast
Автор

Euclidean Algorithm 2:40
extended Euclidean Alg. 24:00
Some theorems 1:12:30

mr.shanegao
Автор

Hello from Vietnam. Thanks Profession Paar so much :)

HuanPhanThai
Автор

58:58 yes, also in latin the plural nominative case of "formula" is "formulae". Thanks so much, Prof. Paar, super great lecture!

cmlon
Автор

The moment, 1:03:00 when Professor says you can sleep now, you can start playing your cards now :D

primepsp
Автор

I model and simulate cyber and electronic just recentlyfor employment. Was reading PySDR tutorial by Dr. Marc Lichtman. DPS uses many tangential concepts. Now I will be able to model cyber better.

ucfeconknight
Автор

This was amazing!
Thank you so much for recording these lectures! :)

CoreDump
Автор

Remarks
gcd(a, b) = Xa+ Yb is called the bezout lemma too.
and the extended euclidean algorithm is called eculidean division algorithm. is the algorithm taught to children in the schooll

By the way good teacher.my question is if are the proofs in the book ?

jordiescofet