Lecture 21 (update): SHA-3 Hash Function by Christof Paar

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

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

guestaccount
Автор

i really feel good when i listen to you prof. i watched you lectures while i was preparing my PhD, and now i am PhD and still watching your lectures

hishamsarhan
Автор

Excellent explanations Sir. Your explanations have helped me to learn many nook and corners of cryptography, starting from Symmetric/Asymmetric ciphers, key agreement, digest functions and how such cryptosystems are used over the wire, clubbed with my understanding of networking and studying about the TLS handshake(which actually does everything necessary covering the four tenets of cryptography), including algorithms as part of the cipher suites. Took over one and a half years going through your lectures, scanning through rfc's etc.



Really! Thumbs Up! You deserve a salute!

AyushmanAdhikary
Автор

Did not expect an upload on this channel after 3 years, much appreciated!

derbensoft
Автор

This is a wonderful video! THANK YOU so much Christof Paar, you are doing the world a great justice by sharing this with us!!!

Digitaliquid
Автор

Thank you for your consistent effort and detailed explanations, Professor Christof. Watched your videos detailing the workings of RSA and Extended-EA for an Mathematics Exploration report which will constitute 20% of my IB Math Grade. Your explanations and clarity have helped me understand what seemed to be an incredibly abstract and complex series of theorems and formulae. I sincerely appreciate your work and dedication to producing tutorials for free, so that the rest of the world may be able to benefit from your teaching. Thank you once again.

SkybusGrizwald
Автор

Studying SHA-3 for a cryptography final. Your explanation is fantastic. Thank you for sharing your lecture.

ianyoung
Автор

Dear Christof, thank you for your course. I have a question related to use of SHA3 as a PRNG as you propose in the lecture. You suggest that one can simply continue to squeeze the sponge and take the part of the block. But this looks deeply concerning since the bits such a generator outputs are feeded back again into the F function of the next iteration. So in case we want to use this approach in an CSPRNG we are baisically giving an attacker a pretty large portion of the state of the generator for free. This looks pretty dangerous. Is this secure because the part of the generator state is not revealed? Even if so I still think I would rather run a Hash DRBG as proposed by NIST based on SHA3 rather than What do you think?

gagra
Автор

Thank you for sharing your knowledge for free sir, appreciate it!

TomKustra
Автор

This is way clearer than my professors have assed 25min explanation. Thank you.

Coder-zxnb
Автор

I finally undestood sponge function. I is hard to understand it fully just by looking at the scheme, explanation of Christof helps a lot.

osobliwynick
Автор

Hi,
For Rho and Pie step - Does this rotation in Rho step takes places 25 times and then move forward to pie step? or is it r[0, 0] -> pie step and again r[0, 1] pie step.
Thank you.

snjklim
Автор

the constants for the rho step are the triangular numbers going by the order of the pi permutation, modulo 64. in addition, the iota constants are actually determined by setting bits 1, 2, 4, 8, 16, 32, 64 of each number to the output of an LFSR, in sequence.

Ykulvaarlck
Автор

Hello Professor,

In SHA-3, when considering X0, what is the other input for XOR ? As per block diagram, its coming from r. Assuming r is a register, what contents should we be assuming?

Thanks and Regards,
Srinivas

srinivasr
Автор

Wonderful presentation, as all the others are!
Question on technology making the current rounds in Cryptographic domain: Are you planning to offer video courses on "Differential Privacy" and "Homomorphic Encryption", both focused on Privacy which is becoming a very sought after area currently?


My problem with the current internet content (both video and text) is that it is overly mathematical, which I don't mind if explained properly and less abstractly. I am hoping that you can offer the courses without overwhelming us with abstract theoretical math, but geared towards actual algorithms which we can understand at a basic level.
We can then take it to actual implementation at hardware and software level. Thank you again for all your efforts.

sathyamurthisadhasivan
Автор

Should I watch the "Lecture 21" video before this "Lecture 21 (update)" or is this a replacement?

baobabkoodaa
Автор

Thanks for the update! Good to see that you are still supporting young minds on crypto.

Gideon_Judges
Автор

where i can find this additional chapter of the book there is no link provided for that. it would be of great help if it can be provided. thanking you sir for the effort

utkarshchaurasia
Автор

Excellent lecture like always Professor Paar. I just had a thought, in the movie "Swordfish" Hugh Jackman was a hacker and in the first 'crypto scene' he was operating on cubes to break the cipher. I think back in the day (this is early 2000s) they already visioned an algorithm in crypto that was to be 3-dimensional :D

noormuhammadmalik
Автор

Good evening Pro. christof

I have a question What is a problem with using serial number as a password? from security aspects
Is there is a problem?

samardahan