Відео

Thanks for the great explanation since I am looking for the answer about AES GCM message authentication ❤

Clocks are actually infinite sets that just increment the day by 1 every time the base of 24 is satisfied. And we are just truncating the incrementing day value. A better example of a modular set would be the alphabet, since once you get to the end of the set, it doesn't increment a higher place value. If a clock is a modular set then it follows that the decimal system's 1s place is a modular set if you don't show the tens place.

Zank yew fau zis lektur! Schnitzel-dwaf!

where is subtitles?????????????

Thanks for uploading teacher

Thank you for your excellent cryptography lectures. They have been incredibly helpful for my studies. Could you please consider making videos on the new chapters about SHA-3 and post-quantum cryptography from the latest edition of your book?

Prof. Christof Paar in Cryptography = Prof. Gilbert Strang in Linear Algebra (I really hope Prof. Paar reads this comment 🥺)

I love those boards...............................

14 years after the recording of this video, It is still perfect

Thanks so much!!

how come most learning for cryptography online is quite dated? most the lectures and courses are from years ago, this one is a decade old, alot are years old and talking about stuff like dvd and blu ray encryption, is this stuff becoming too top secret for open learning now?

I love the way he says "that's it for today thank you very much"

56:35 anybody knows what a "cupa cubana" is?

I love these and thank you for sharing them. I will say I disagree about the statement at 17:25 though about AES being generally secure because the agencies use it. What was later found since this time period was that AES has this property where some keys are strong and others are weak. There were certain attacks possible with poorly chosen keys and of course the NSA requires their own use of AES to get keys provided from a central key authority within the NSA. This key authority then only provides strong keys for their internal use and if laymen use AES they lack the knowledge of how to select these extra strong keys. Now that future attacks such as Invariant Subspace were discovered we can see how clever this was. So the statement at 17:25 I highly disagree with and we learned that this kind of logic fails with new side-channel and mathematical attacks. The simple use of an algorithm by the government means nothing unless you also can use their key selection processes. They are willing to bless subpar implementations and utilize those weaknesses against others while shielding themselves. Otherwise excellent lecture.

Thank you for this wonderful lecture, Mr. Paar.

24:30

boring lecture

Rule number one for a teacher: Never assume that everyone is on the same page!

at 29:13 when defining the set the number to the right of 12 shoukd be 17 not 15

I think the combinations for the permutations at 54:54 are wrong.if you are considering capital letters - which looks to be true . So the combinations are really 52 * 51 * 50 * 49. Good lecture though otherwise.

noob question. if there's a secure channel to exchange keys. why not just use that channel to transfer the data?

What kind of filming is this? I've never seen the board move like I'm on a boat before. It works though. Thanks for publishing these!

Great lectures ♥

Sir which book were you refering to in class?

9:12 Did he just glance at his watch and say "3 months ago"?

In the encryption, we have IP in the beginning and IP^-1 in the end which means that the initial permutation has been sort of cancelled by the inverse of initial permutation. Why do we need IP and IP^-1 in the decryption if the effect of permutation has been nullified during the encryption? Maybe I am missing something here. Thanks for your time in reading my question (and hopefully answering it).😃

i can't believe how disrespectful these students are. Great lecture.

Thank you so much, you make learning this fun and so interesting and not easy but much easier!

Please somebody make subtitles for the videos.

Where have you been this whole time!

Thank you for the lecture

Zee Proffesor I should have had in my Computer Science Klass.

Thanks professor for this amazing lecture !

I don't know if I miss something because of my English skill but In book, it said " If two inputs to an S-box differ in exactly one bit, their outputs must differ in at least two bits". I tried it by inputting two 100110 and 100101. Even though they differ only one bit and outputs are same (8 = 1000). This happen in S box 1.

Preciate it brother

your sound is more faster then the video

Professor Christof Paar is an international treasure.

The best teacher i have ever seen in my life THANK YOU A LOT

It was this easy all along?!!

Great lectures by an awesome professor. I had never found a material so well balanced between mathematical depth and practical application, foundational to most real-world applications of modern cryptography. I have bought your book from Amazon, though the Kindle version because I could not wait🙂. Thanks Professor Paar!

Professor Paar is a true legend. I am proud to have learnt Crypto from him at UMASS Amherst

so in 18:00, given we have K possible X1 predictable plaintext values (since we use files headers for example and they are somehow limited), So we don't actually need to perform this every time for every attack attempt right ? we can accelerate the attack by calculating them beforehand and make standalone look-up tables and whenever the attacker intercepts a ciphertext Y1 they can just find collisions. Or am I missing something ?

Agenda 2:20

SHA1: algorithm 21:40 (high level) SHA1: rounds details 52:30 SHA1: word scheduler 1:11:57

I CAN'T THANK YOU ENOUGH PROFESSOR.

I FEEL SO POWERFUL AFTER LEARNING ALL THIS!!!

Dear Professor Paar, Just wanted to drop a quick note to say a huge thanks for putting your lecture on UA-cam! 🙌 Your video was seriously a game-changer for me. The way you explained things made it so much easier to grasp, and I'm feeling way more confident about the topic now. It's awesome that you're sharing this kind of quality content for free. Your passion for teaching really comes through, and it's making a big difference for learners like me. Cheers

Thank you for these amazing lecture series.

Insecure Channels in some chronological order : Smoke Signals, Sticks, Newspapers, Prince Harry, Radio, Wire Telegraphy, Internet...

get rich quick scheme😂