Understanding_Cryptography_Chptr_11---Hash Functions

Understanding_Cryptography_Chptr_11---Hash Functions -...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Understanding Cryptography – A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl www.crypto-textbook.com Chapter 11 – Hash Functions ver. October 29, 2009 These slides were prepared by Stefan Heyse and Christof Paar and Jan Pelzl
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2/22 Chapter 11 of Understanding Cryptography by Christof Paar and Jan Pelzl Some legal stuff (sorry): Terms of Use The slides can used free of charge. All copyrights for the slides remain with Christof Paar and Jan Pelzl. The title of the accompanying book “Understanding Cryptography” by Springer and the author’s names must remain on each slide. If the slides are modified, appropriate credits to the book authors and the book title must remain within the slides. It is not permitted to reproduce parts or all of the slides in printed form whatsoever without written consent by the authors.
Background image of page 2
3/22 Chapter 11 of Understanding Cryptography by Christof Paar and Jan Pelzl Content of this Chapter Why we need hash functions How does it work Security properties Algorithms Example: The Secure Hash Algorithm SHA-1
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4/22 Chapter 11 of Understanding Cryptography by Christof Paar and Jan Pelzl Content of this Chapter Why we need hash functions How does it work Security properties Algorithms Example: The Secure Hash Algorithm SHA-1
Background image of page 4
5/22 Chapter 11 of Understanding Cryptography by Christof Paar and Jan Pelzl Motivation Problem: Naive signing of long messages generates a signature of same length. Three Problems Computational overhead Message overhead Security limitations For more info see Section 11.1 in “ Understanding Cryptography ”. Solution: Instead of signing the whole message, sign only a digest (=hash) Also secure, but much faster Needed: Hash Functions
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6/22 Chapter 11 of Understanding Cryptography by Christof Paar and Jan Pelzl
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/01/2011 for the course MA C taught by Professor Anario during the Spring '11 term at Universitat Politècnica de Catalunya.

Page1 / 22

Understanding_Cryptography_Chptr_11---Hash Functions -...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online