Presentation is loading. Please wait.

Presentation is loading. Please wait.

MSIT 543 Cryptography Concepts and Techniques Hashes

Published byTristan Weiner Modified over 6 years ago

Similar presentations

Presentation on theme: "MSIT 543 Cryptography Concepts and Techniques Hashes"— Presentation transcript:

1 MSIT 543 Cryptography Concepts and Techniques Hashes
Dr Jeffrey A Robinson

2 Hashes – One way functions
Easy one direction Difficult or impossible to reverse For example: Modulus mathematics Multiplying or dividing by very large prime numbers and taking the last hundred digits or so. Pseudo-random number generator, using message as the “seed”

3 Hashes Hashes are numbers generated using a one way algorithm (like modulus mathematics)

4 How Hashes Work Modulus functions Checksums CRCs MDA SHA-256
Many proprietary (e.g. login hashes, CANON pictures)

5 How Hashes Work Examples of applications Error Detecting Codes
Lotids Part numbers VIN numbers Passwords Fixity Digital Watermarks - Photos Digital fingerprints Computer Forensics

Download ppt "MSIT 543 Cryptography Concepts and Techniques Hashes"

Similar presentations

Lecture 7 Overview. Advanced Encryption Standard 10, 12, 14 rounds for 128, 192, 256 bit keys – Regular Rounds (9, 11, 13) – Final Round is different.

Lecture 7 Overview. Advanced Encryption Standard 10, 12, 14 rounds for 128, 192, 256 bit keys – Regular Rounds (9, 11, 13) – Final Round is different.
SECURE HASHING ALGORITHM By: Ruth Betcher. Purpose: Authentication Not Encryption Authentication Requirements:  Masquerade – Insertion of message from.

SECURE HASHING ALGORITHM By: Ruth Betcher. Purpose: Authentication Not Encryption Authentication Requirements:  Masquerade – Insertion of message from.
9/21/12. I can identify which factors are prime numbers. LEARNING TARGET.

9/21/12. I can identify which factors are prime numbers. LEARNING TARGET.
Numbers Prime Factors: Every number can be broken down into the smallest numbers which when multiplied together will eventually make that number...

Numbers Prime Factors: Every number can be broken down into the smallest numbers which when multiplied together will eventually make that number...
1 Counter-measures Threat Monitoring Cryptography as a security tool Encryption Digital Signature Key distribution.

1 Counter-measures Threat Monitoring Cryptography as a security tool Encryption Digital Signature Key distribution.
20-751 ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.

ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.
Cryptography (continued). Enabling Alice and Bob to Communicate Securely m m m Alice Eve Bob m.

Cryptography (continued). Enabling Alice and Bob to Communicate Securely m m m Alice Eve Bob m.
Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.

Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Lecture 15 Lecture’s outline Public algorithms (usually) that are each other’s inverse.

Lecture 15 Lecture’s outline Public algorithms (usually) that are each other’s inverse.
Dividing by a Fraction. What does it mean to divide by a fraction?

Dividing by a Fraction. What does it mean to divide by a fraction?
Dan Johnson. What is a hashing function? Fingerprint for a given piece of data Typically generated by a mathematical algorithm Produces a fixed length.

Dan Johnson. What is a hashing function? Fingerprint for a given piece of data Typically generated by a mathematical algorithm Produces a fixed length.
Computer encryption is… Based on the science of cryptography.

Computer encryption is… Based on the science of cryptography.
ICT 6621 : Advanced NetworkingKhaled Mahbub, IICT, BUET, 2008 Lecture 11 Network Security (1)

ICT 6621 : Advanced NetworkingKhaled Mahbub, IICT, BUET, 2008 Lecture 11 Network Security (1)
11-Basic Cryptography Dr. John P. Abraham Professor UTPA.

11-Basic Cryptography Dr. John P. Abraham Professor UTPA.
Confidentiality Confidentiality is maintained so long as private keys are secure. Authenticity is possible via public-key encryption by encrypting messages.

Confidentiality Confidentiality is maintained so long as private keys are secure. Authenticity is possible via public-key encryption by encrypting messages.
Cryptography Chapter 7 Part 3 Pages 812 to 833. Symmetric Cryptography Security Services – Only confidentiality, not authentication or non- repudiation.

Cryptography Chapter 7 Part 3 Pages 812 to 833. Symmetric Cryptography Security Services – Only confidentiality, not authentication or non- repudiation.
MD5 ALGORITHM past and present. History Initial checking of integrity – checksums, then CRC These are only good at detecting lost information due to hardware.

MD5 ALGORITHM past and present. History Initial checking of integrity – checksums, then CRC These are only good at detecting lost information due to hardware.
CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Modern Cryptography.

CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Modern Cryptography.
Computer and Network Security - Message Digests, Kerberos, PKI –

Computer and Network Security - Message Digests, Kerberos, PKI –

Similar presentations

Ads by Google