By: Matthew Ng. AND, XOR, OR, Complement, Circular Left shift, and Addition Modulo Circular Left Shift is done with s positions (0 ≤ s ≤ 31) – Denoted.

Slides:

Advertisements

Similar presentations

Hash Functions A hash function takes data of arbitrary size and returns a value in a fixed range. If you compute the hash of the same data at different.

Advertisements

1 The 2-to-4 decoder is a block which decodes the 2-bit binary inputs and produces four output All but one outputs are zero One output corresponding to.

Chapter Three: Closure Properties for Regular Languages

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 5 Examples of DFA

DFT properties Note: it is important to ensure that the DFTs are the same length If x1(n) and x2(n) have different lengths, the shorter sequence must be.

1 Register Transfer &  -operations Computer Organization Computer Architectures Lab REGISTER TRANSFER AND MICROOPERATIONS Register Transfer Language Register.

Error Detection and Correction Parity Schemes: Modulo 2 addition (XOR) Word parity Block Parity.

MD Collision Sought Marian Ščerbák University of Pavol Jozef Šafárik Košice.

Converting Numbers Between Bases. While the quotient is not zero…  Divide the decimal number by the new base.  Make the remainder the next digit to.

 Stream ciphers o Encrypt chars/bits one at a time o Assume XOR w the key, need long key to be secure  Keystream generators (pseudo-random key) o Synchronous.

Hash and MAC Algorithms

MD5 Message Digest Algorithm CS265 Spring 2003 Jerry Li Computer Science Department San Jose State University.

By: Matthew Ng. SHA stands for Secure Hash Algorithm It is based off the Merkle-Dangard hash function There are 3 versions of it with one coming in 2012.

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.

Company LOGO Midterm Presentation Hash Function using MD5 algorithm Students: Eyal Mendel & Aleks Dyskin Instructor: Evgeny Fiksman High Speed Digital.

Combinational Comparators

7/2/2015Errors1 Transmission errors are a way of life. In the digital world an error means that a bit value is flipped. An error can be isolated to a single.

Team Grey Skies – Pete Biancaniello and Anton Schraut January 18 th, 2012.

February 24, 2015Applied Discrete Mathematics Week 4: Number Theory 1 Modular Arithmetic Let a be an integer and m be a positive integer. We denote by.

MICRO OPERATIONS Department of Computer Engineering, M.S.P.V.L. Polytechnic College, Pavoorchatram.

Chapter 3 Section 1 Number Representation Modern cryptographic methods, unlike the classical methods we just learned, are computer based. Representation.

1 Hash Functions. 2 A hash function h takes as input a message of arbitrary length and produces as output a message digest of fixed length

Cryptographic Hash Functions

H ASHING : SHA256 T AYLER A NGEVINE B ACHELOR OF A RTS D R. K EN B LAHA 3/13/2014.

Logic (continuation) Boolean Logic and Bit Operations.

REGISTER TRANSFER LANGUAGE MICROOPERATIONS. TODAY OUTLINES Logic Microoperations Shift Microoperations.

Lecture 8 Overview. Secure Hash Algorithm (SHA) SHA SHA SHA – SHA-224, SHA-256, SHA-384, SHA-512 SHA-1 A message composed of b bits.

Chapter 18: One-Way Hash Functions Based on Schneier.

Mastering Javascript operators JAVASCRIPT OPERATORS BITWISE OPERATORS AND WHAT THEY DO USING TRACE TABLES TO PREDICT OUTPUT.

Hash Algorithms see similarities in the evolution of hash functions & block ciphers –increasing power of brute-force attacks –leading to evolution in algorithms.

Hash Functions Ramki Thurimella. 2 What is a hash function? Also known as message digest or fingerprint Compression: A function that maps arbitrarily.

Arithmetic Operations

Computer Science CSC 474Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.3 Hash Functions.

Computer Science and Engineering Computer System Security CSE 5339/7339 Lecture 11 September 23, 2004.

Lecture # 15. Mealy machine A Mealy machine consists of the following 1. A finite set of states q 0, q 1, q 2, … where q 0 is the initial state. 2. An.

Computer Science and Engineering Computer System Security CSE 5339/7339 Lecture 10 September 21, 2004.

Number Representation and Arithmetic Circuits

In decimal we are quite familiar with placing a “-” sign in front of a number to denote that it is negative The same is true for binary numbers a computer.

Information Security and Management 11. Cryptographic Hash Functions Chih-Hung Wang Fall

Network Layer4-1 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction m sharing.

Lecture 9 Overview. RSA Invented by Cocks (GCHQ), independently, by Rivest, Shamir and Adleman (MIT) Two keys e and d used for Encryption and Decryption.

1 Message Authentication using Message Digests and the MD5 Algorithm Message authentication is important where undetected manipulation of messages can.

CSE 311 Foundations of Computing I Lecture 12 Modular Arithmetic and Applications Autumn 2012 CSE

Chapter 12 – Hash Algorithms

If the hash algorithm is properly designed and distributes the hashes uniformly over the output space, "finding a hash collision" by random guessing is.

ASymmetric Key Algorithms

Negative Binary Numbers

Network Security Unit-III

Negative Binary Numbers

Secured Hash Algorithm(SHA)

CSE 311 Foundations of Computing I

Rivest, Shamir and Adleman

REGISTER TRANSFER LANGUAGE

CSE 311: Foundations of Computing

Computer Organization and Design

CSE 311 Foundations of Computing I

Bitwise Operators CS163 Fall 2018.

Noncomparison Based Sorting

13 Digital Logic Circuits.

Numbers and Arithmetic and Logical Operation

Activity 2 How is the word length of a two’s complement representation changed without affecting its value? In this activity, we are going to study how.

GCSE COMPUTER SCIENCE Topic 3 - Data 3.3 Logical and Arithmetic Shifts.

Lecture 3 Strings and Things (Section 1.1)

Bit Manipulations CS212.

Cipher-Based MAC Network Security.

Converting Numbers Between Bases

Simple Hash Functions Network Security.

Presentation transcript:

By: Matthew Ng

AND, XOR, OR, Complement, Circular Left shift, and Addition Modulo Circular Left Shift is done with s positions (0 ≤ s ≤ 31) – Denoted by ROTL s Addition Modulo is 2 32

This is pads the input. The binary representation of |x| is l and it is at most 64 bits If |l| < 64 bits then it is padded from the left with zeros to make 64 bits. In the construction of y – one is appended to x and then concatenated with enough zeros so the length is congruent to 448 modulo 512. A concatenation 64 bits that contain binary representation of the original length of x. Divide the string by 512 and create a concatenation of n blocks each of them being 512 bits. y = M1 || M2 || … || Mn

SHA-1-pad (x) : D = (447 - |x|) Mod 512 L = binary of |x| where |l| = 64 y = x || 1 || 0 d || 1 |x| ≤

ABCDE are 32-bit words in the state F is a non-linear function that varies <<< n is a left bit rotation by n places (n varies for each operation) W t is the expanded message word of round t K t is the round constant of round t Boxes addition modulo 2 32

The function is based on what round it is on. If the round is between 0 and 19 F(B,C,D) : (B ∧ C) ∨ ((~B) ∧ D) If the round is between 20 and 39 F(B,C,D): (B XOR C XOR D) If the round is between 40 to 59 F(B,C,D): (B ∧ C) ∨ (B ∧ D) ∨ (C ∧ D) If the round is between 60 to 79 F(B,C,D): (B XOR C XOR D)

The keys also depend on what the round is When the round is between 0 to 19 K t = 5A When the round is between 20 to 39 K t = 6ED9EBA1 When the round is between 40 to 59 K t = 8F1BBCDC When the round is between 60 to 79 K t = CA62C1D6

y = SHA-1-Pad(x) //y = M1 || M2 ||.. || Mn //Initialize Variables H0 = H1 = EFCDAB89 H2 = 98BADCFE H3 = H4 = CSD2E1F0 For i = 1 to n Mi = W0 || W1 || … || W15 //Wi is a word For t = 16 to 79 W t = ROTL 1 (W t-3 XOR W t-8 XOR W t-14 XOR W t-16 )

A = H0, B = H1, C = H2, D = H3, E = H4 For t = 0 to 79 temp = ROTL 5 (A) + F t (B,C,D) + E + W i + K t E = D, D = C, C = ROTL 30 (B), B = A, A = temp H0 = H0 + A H1 = H1 + B H2 = H2 + C H3 = H3 + D H4 = H4 + E Return (H0 || H1 || H2 || H3 || H4)

Stinson Textbook