0% found this document useful (0 votes)
32 views31 pages

Lecture 27-32 NIS (Digital Signature, HASH, MAC)

Uploaded by

Tanazzah Rehman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views31 pages

Lecture 27-32 NIS (Digital Signature, HASH, MAC)

Uploaded by

Tanazzah Rehman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 31

1

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


2

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


3

Digital Signatures

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


4
5

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


6

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


7

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


8

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


9

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


10

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


11

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


12

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


13

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


14

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


15

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


16

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


17

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


18

Hash Functions

• A hash function H accepts a variable-length block of data


M as input and produces a fixed-size hash value
– h = H ( M)
– Principal object is data integrity
• Cryptographic hash function
– An algorithm for which it is computationally infeasible
to find either:
(a) a data object that maps to a pre-specified hash
result (the one-way property)
(b) two data objects that map to the same hash
result (the collision-free property)
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
19

Figure 11.1 Cryptographic Hash Function h =


uppercase h left parenthesis m right parenthesis

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


20

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


21

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


22

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


23

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


24

Secure Hash Algorithm (SHA)


• SHA was originally designed by the National Institute of
Standards and Technology (NIST) and published as a federal
information processing standard (FIPS 180) in 1993
• Was revised in 1995 as SHA-1
• Based on the hash function MD4 and its design closely models
MD4
• Produces 160-bit hash values
• In 2002 NIST produced a revised version of the standard that
defined three new versions of SHA with hash value lengths of
256, 384, and 512
– Collectively known as SHA-2
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
25

Table 11.3 Comparison of SHA Parameters


Algorithm Message Block Size Word Message
Size Size Digest Size
SHA-1  264 512 32 160
SHA-224  264 512 32 224
SHA-256  264 512 32 256
SHA-384  2128 1024 64 384
SHA-512  2128 1024 64 512
SHA- 1024 64 224
 2128
512/224
SHA-  2128 1024 64 256
512/256

Note: All sizes are measured in bits.

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


26

Figure 11.9 Message Digest Generation


Using SHA-512

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


27

Figure 11.10 SHA-512 Processing of a


Single 1024-Bit Block

Copyright © 2017 Pearson Education, Inc. All Rights Reserved


28
29
30
31

You might also like