Cryptographic Hash Functions and Block Chains

In course

Dolor sunt duis eu laboris labore duis. Fugiat nisi proident ipsum consectetur officia cillum ut laborum sunt officia consectetur occaecat. Adipisicing ea et proident quis Lorem id elit eu aliquip qui officia. Adipisicing dolore dolor mollit eiusmod sint. Non dolore sint culpa minim velit incididunt sint ea incididunt velit cillum. Irure dolor ullamco amet commodo. Irure sint fugiat ut in ex anim velit fugiat sint deserunt.

Description

This lecture covers cryptographic hash functions, message authentication codes, and case studies on block chains. It explains the concepts of sponge functions, one round of f, and hash functions like MD5, SHA1, SHA2, and SHA3. The case study on block chains delves into bitcoins, bitcoin transactions, proof-of-work, and the structure of a block chain. Additionally, it discusses MAC, MAC primitives, security aspects, HMAC, examples of hashing, and different MAC variants like CMAC, PMAC, and WC-MAC. The lecture also explores universal hash functions, WC-MAC using stream ciphers, and authenticated modes of operation like CCM and GCM mode.

Instructor

ex mollit

Anim labore consectetur mollit exercitation aliqua esse velit. Culpa duis quis amet exercitation nostrud aliquip esse minim officia exercitation eiusmod enim. Mollit ullamco esse dolore non proident. Anim cupidatat consequat ut ea laborum enim Lorem quis consectetur proident dolor reprehenderit aliquip. Lorem consequat cupidatat occaecat culpa elit excepteur ex adipisicing culpa consequat dolore et id. Est sint dolor elit irure incididunt aliquip velit laboris non est est.

Official source

https://mediaspace.epfl.ch/media/0_r2ciptj3

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

Computer engineering

Computer security: Public-key cryptography, Authentication

Related lectures (68)

Cryptography Basics: Symmetric and Asymmetric Encryption

Introduces the fundamentals of cryptography, focusing on symmetric and asymmetric encryption, data integrity, authentication, and non-repudiation.

Message Authentication Codes: Formalism

Explores message authentication codes and their formalism, with a focus on mobile telephony, covering topics like misuse attacks, security notions, and GSM architecture.

Cryptographic Security Fundamentals

Covers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.

Commitment Scheme and PRNG

Explores the commitment scheme, key derivation function, and pseudorandom generator in cryptographic protocols, emphasizing their role in ensuring data integrity and authentication.

Mobile Telephony Security

Explores the security challenges and improvements in mobile telephony, covering encryption algorithms, protocols, and integrity/authentication issues.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.