One-way Encryption Properties

Slides:



Advertisements
Similar presentations
Hashes and Message Digests
Advertisements

Lecture 5: Cryptographic Hashes
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.
SHA-1 collision found Lukáš Miňo, Richard Bartuš.
ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.
PIITMadhumita Chatterjee Security 1 Hashes and Message Digests.
BY MUKTADIUR RAHMAN MAY 06, 2010 INTERODUCTION TO CRYPTOGRAPHY.
Chapter 4  Hash Functions 1 Overview  Cryptographic hash functions are functions that: o Map an arbitrary-length (but finite) input to a fixed-size output.
Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.
Announcements: 1. HW6 due now 2. HW7 posted Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman, ElGamal Hash Functions.
Secure Hashing and DSS Sultan Almuhammadi ICS 454 Principles of Cryptography.
Cryptography (continued). Enabling Alice and Bob to Communicate Securely m m m Alice Eve Bob m.
Cryptography April 20, 2010 MIS 4600 – MBA © Abdou Illia.
Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Lecture 4 Cryptographic Tools (cont) modified from slides of Lawrie Brown.
Encryption Methods By: Michael A. Scott
Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.
Vitaly Shmatikov CS 361S Cryptographic Hash Functions.
Java supports encryption by a wide variety of packages: The standard java.security package The standard javax.crypto package Packages supplied by third.
DNSSEC Cryptography Review Track 2 Workshop July 3, 2010 American Samoa Hervey Allen.
HASH Functions.
Dan Johnson. What is a hashing function? Fingerprint for a given piece of data Typically generated by a mathematical algorithm Produces a fixed length.
Security+ Guide to Network Security Fundamentals, Third Edition Chapter 11 Basic Cryptography.
Security.  is one of the most widely used and regarded network services  currently message contents are not secure may be inspected either.
Chapter 8: Scrambling Through Cryptography Security+ Guide to Network Security Fundamentals Second Edition.
Monitor's Secret Key Crypto - KARN, encrypt 512 bit Secret.
EE515/IS523 Think Like an Adversary Lecture 4 Crypto in a Nutshell Yongdae Kim.
Module 3 – Cryptography Cryptography basics Ciphers Symmetric Key Algorithms Public Key Algorithms Message Digests Digital Signatures.
Improving Encryption Algorithms Betty Huang Computer Systems Lab
Hashing Algorithms: Basic Concepts and SHA-2 CSCI 5857: Encoding and Encryption.
ITIS 1210 Introduction to Web-Based Information Systems Chapter 50 Cryptography, Privacy, and Digital Certificates.
11-Basic Cryptography Dr. John P. Abraham Professor UTPA.
6fb52297e004844aa81be d50cc3545bc Hashing!. Hashing  Group Activity 1:  Take the message you were given, and create your own version of hashing.  You.
Public / Private Keys was a big year… DES: Adopted as an encryption standard by the US government. It was an open standard. The NSA calls it “One.
MD5 Summary and Computer Examination Process Introduction to Computer Forensics.
Lecture 2: Introduction to Cryptography
Week 4 - Friday.  What did we talk about last time?  Snow day  But you should have read about  Key management.
Security fundamentals Topic 4 Encryption. Agenda Using encryption Cryptography Symmetric encryption Hash functions Public key encryption Applying cryptography.
MT311 Java Application Development and Programming Languages Li Tak Sing ( 李德成 )
MM Clements Cryptography. Last Week Firewalls A firewall cannot protect against poor server, client or network configuration A firewall cannot.
ENGR 101 Compression and Encryption. Todays Lecture  Encryption  Symmetric Ciphers  Public Key Cryptography  Hashing.
LAB#6 MAC & MASSAGE DIGEST CPIT 425. Message Authentication 2  Message authentication is a mechanism used to verify the integrity of a message.  Message.
Hervey Allen Phil Regnauld 15 June 2009 Papeete, French Polynesia DNSSEC Tutorial: Public / Private.
Information and Computer Security CPIS 312 Lab 9
CHAPTER 4 TJADEN plus Chapters 13 & 14 Crytography Decrypted Hashing Functions, Message Digests, Message Authentication Codes (MACs) Dr. Suzanne Buchele.
IT443 – Network Security Administration Instructor: Bo Sheng
DTTF/NB479: Dszquphsbqiz Day 26
Cryptographic Hash Function
Network Security.
One-way Encryption Ideal Properties
Presented by: Dr. Munam Ali Shah
최신정보보호기술 경일대학교 사이버보안학과 김 현성.
BPSEC Updates Edward Birrane
Cryptography Lecture 13.
MAC: Message Authentication Code
ICS 454 Principles of Cryptography
Unit 2 “Implementation of a RC5 block cipher algorithm and implementing an attack on it”
Cryptography Team Presentation 1
Analysis of the RSA Encryption Algorithm
Lesson Objectives Aims You should know about: 1.3.1:
CSE 484 Midterm Review “1st half of the quarter in 5 slides”
ICS 454 Principles of Cryptography
DTTF/NB479: Dszquphsbqiz Day 27
Chapter 3 - Public-Key Cryptography & Authentication
Practical Aspects of Modern Cryptography
Cryptography Lecture 14.
Hashing Hash are the auxiliary values that are used in cryptography.
Cryptography Lecture 13.
Cryptography Fundamentals
Presentation transcript:

One-way Encryption Properties A cipher designed only to encrypt, not decrypt. One-way encryption is useful for storing passwords, among other things. plaintext ciphertext encryption algorithm This slide is a reminder from the Classis Crypto lecture. Actually, a hash is a special kind of one-way encryption. (It uses no key and is a fixed length (128 to 512 bits). A hash must be as random as possible and be “collision resistant”.. Properties • Encryption produces a unique value for each different plaintext value (collision free). • There cannot be a decryption algorithm (one-way). • Both keyed and non-keyed algorithms.

Non-keyed One-way Ciphers MD5 • Created by Ron Rivest (MIT) - 1992 • 128-bit digest SHA family • SHA-1 created by NSA - 1995 • 160-bit digest for SHA-1 • variants with larger digests: SHA-256, SHA-384, SHA-512 MD5 (128-bit key) is beginning to be suspect. SHA1 (160-bit key) is next. NSA is considering SHA256 and SHA512 as standards. There isn’t must research on hashing and no other hashes have stood the test of time. Note: In 2004 three cryptographers (Eli Biham, Rafi Chen, and Antoine Joux) discover potential collisions in SHA-0 (and possibly SHA-1).

How To Use for Passwords? User Selects New Password password digest encryption algorithm store in password file User Enters Password (in response to challenge) password digest encryption algorithm compared to digest from password file

...in Java Four Steps Instantiate a java.security.MessageDigest object. (This is done by calling a static method named getInstance). 2) Fill a byte array from plaintext to be hashed. 3) Call update on the object, passing the byte array. 4) Call digest to retrieve the hash value (as a byte array). MessageDigest md = MessageDigest.getInstance(“MD5”); byte[] buffer = someMethodToReturnPlaintext(); md.update(buffer); Note: This can be called as many times as necessary. byte[] digest = md.digest();