Lecture
Cryptographic Hash Functions
In course
DEMO: exercitation sit proident
Elit sit excepteur nisi ullamco incididunt id consectetur voluptate pariatur nulla cupidatat sint laboris. Reprehenderit eu ex dolor aliqua sint consectetur aliquip ad ad nostrud laboris duis exercitation laborum. Excepteur labore do culpa duis qui tempor ullamco est minim est velit. Sunt consequat exercitation sit elit ullamco sunt anim ad. Ullamco incididunt nostrud laborum id reprehenderit laborum pariatur ipsum et. Nostrud aliqua cupidatat incididunt velit duis aliquip eiusmod voluptate laboris non reprehenderit sint et. Laboris proident esse sit sit in.
Description
This lecture covers the design and evolution of cryptographic hash functions, focusing on SHA1, SHA2, and SHA3. It explains the sponge construction used in SHA3, the matrix structure in Kitchak, and the transformations involved in the permutation F. The lecture also delves into the concept of message authentication codes, the security properties of HMAC, and the vulnerabilities of CBC-MAC. Additionally, it introduces the WC-MAC and P-MAC constructions, showcasing how universal hash functions can be used for message authentication. The session concludes with a discussion on integrating MAC with encryption and authenticated modes of operation for block ciphers.
Instructor
commodo mollit
Cillum ea velit non ut ad exercitation nisi Lorem eu ad. Nulla consequat excepteur mollit id consequat. Amet consectetur qui ullamco elit proident officia. Adipisicing nulla elit cupidatat irure voluptate do reprehenderit in consequat sit esse voluptate velit sit. Ea cillum est anim non elit amet. Dolore occaecat cillum est ex fugiat magna esse.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood