Design of Secure Hash Algorithm(SHA)

DESIGN OF SECURE HASH ALGORITHM
Dr.T.M.SARAVANAN
Associate Professor,
Department of Computer Applications,
Kongu Engineering College,
Perundurai – 638 060.

SECURE HASH ALGORITHM
 Here we will see the design of SHA-256 and SHA-3.
 Both of these are used in Bitcoin and Ethereum, respectively.
1. Design of SHA-256
 SHA-256 has the input message size < 264-bits. Block size is 512-
bits, and it has a word size of 32-bits.
 The output is a 256-bit digest.
 The compression function processes a 512-bit message block and a
256-bit intermediate hash value.
 There are two main components of this function: the Compression
Function and a Message Schedule.
29-06-2021

 The algorithm works as follows, in eight steps:
1. Preprocessing:
1. Padding of the message is used to adjust the length of a block to
512-bits if it is smaller than the required block size of 512-bits.
2. Parsing the message into message blocks, which ensures that
the message and its padding is divided into equal blocks of 512-
bits.
3. Setting up the initial hash value, which consists of the eight 32-bit
words obtained by taking the first 32-bits of the fractional parts of
the square roots of the first eight prime numbers. These initial
values are randomly chosen to initialize the process, and they
provide a level of confidence that no backdoor exists in the
algorithm.
29-06-2021

2. Hash computation:
4. Each message block is then processed in a sequence, and it
requires 64 rounds to compute the full hash output. Each round
uses slightly different constants to ensure that no two rounds are
the same.
5. The message schedule is prepared.
6. Eight working variables are initialized.
7. The intermediate hash value is calculated.
8. Finally, the message is processed, and the output hash is
produced:
29-06-2021

29-06-2021

 In the preceding diagram, a, b, c, d, e, f, g, and h are the registers.
Maj and Ch are applied bitwise.
 Σ0 and Σ1 performs bitwise rotation.
 Round constants are Wj and Kj, which are added, mod 232.
 Maj stands for majority , Ch stands for choose or choice.
29-06-2021

2. Design of SHA-3(Keccak)
 The structure of SHA-3 is very different from that of SHA-1 and SHA-
2.
 The key idea behind SHA-3 is based on unkeyed permutations, as
opposed to other typical hash function constructions that used keyed
permutations.
 Keccak also does not make use of the Merkle-Damgard
transformation that is commonly used to handle arbitrary-length
input messages in hash functions.
 A newer approach called sponge and squeeze construction is
used in Keccak.
 It is a random permutation model.
29-06-2021

 Different variants of SHA-3 have been standardized, such as SHA-3-
224, SHA-3-256, SHA-3-384, SHA-3-512, SHAKE-128, and SHAKE-
256.
 SHAKE-128 and SHAKE-256 are Extendable Output Functions
(XOFs), which are also standardized by NIST.
 XOFs allow the output to be extended to any desired length.
 The following diagram shows the sponge and squeeze model,
which is the basis of SHA-3 or Keccak.
29-06-2021

 Analogous to a sponge, the data is first absorbed into the sponge
after applying padding.
 There it is then changed into a subset of permutation state using
XOR, and then the output is squeezed out of the sponge function
that represents the transformed state.
 The rate is the input block size of a sponge function, while capacity
determines the general security level.
29-06-2021

 Usually, hash functions do not use a key.
 Nevertheless, if they are used with a key, then they can be used to
create another cryptographic construct called MACs.
Message Authentication Codes
 MACs are sometimes called keyed hash functions, and they can be
used to provide message integrity and authentication.
 More specifically, they are used to provide data origin authentication.
 These are symmetric cryptographic primitives that use a shared key
between the sender and the receiver.
 MACs can be constructed using block ciphers or hash functions.
29-06-2021

 With this approach, block ciphers are used in the Cipher Block
Chaining (CBC) mode in order to generate a MAC.
 Any block cipher, for example AES in the CBC mode, can be used.
 The length of the MAC output is the same as the block length of the
block cipher used to generate the MAC.
 MACs are verified simply by computing the MAC of the message and
comparing it to the received MAC.
 If they are the same, then the message integrity is confirmed;
otherwise, the message is considered altered.
 It should also be noted that MACs work like digital signatures,
however they cannot provide non-repudiation service due to their
symmetric nature.
29-06-2021

Merkle Trees
 The concept of Merkle tree was introduced by Ralph Merkle.
 Merkle trees enable secure and efficient verification of large
datasets.
 A diagram of Merkle tree is shown here.
 A Merkle tree is a binary tree in which the inputs are first placed at
the leaves (node with no children), and then the values of pairs of
child nodes are hashed together to produce a value for the parent
node (internal node) until a single hash value known as Merkle root
is achieved.
29-06-2021

Patricia Trees
 To understand Patricia trees, you will first be introduced to the
concept of a trie.
 Trie is an efficient information reTrieval data structure.
 Using Trie, search complexities can be brought to optimal limit (key
length).
 A trie, or a digital tree, is an ordered tree data structure used to
store a dataset.
 Practical Algorithm to Retrieve Information Coded in
Alphanumeric (Patricia), also known as Radix tree, is a compact
representation of a trie in which a node that is the only child of a
parent is merged with its parent.
 A Merkle-Patricia tree, based on the definitions of Patricia and
Merkle, is a tree that has a root node which contains the hash value
of the entire data structure.
29-06-2021

Distributed Hash Tables
 A hash table is a data structure that is used to map keys to values.
 Internally, a hash function is used to calculate an index into an array
of buckets from which the required value can be found.
 Buckets have records stored in them using a hash key and are
organized into a particular order.
 One can think of a DHT as a data structure where data is spread
across various nodes, and nodes are equivalent to buckets in a peer-
to-peer network.
 The following diagram shows how a DHT works.
29-06-2021

Distributed Hash Tables
 Data is passed through a hash function, which then generates a
compact key.
 This key is then linked with the data (values) on the peer-to-peer
network.
 When users on the network request the data (via the filename), the
filename can be hashed again to produce the same key, and any
node on the network can then be requested to find the corresponding
data.
 DHT provides decentralization, fault tolerance, and scalability.
 Another application of hash functions is in digital signatures, where
they can be used in combination with asymmetric cryptography.
29-06-2021

Digital Signatures
 Digital signatures provide a means of associating a message with
an entity from which the message has originated.
 Digital signatures are used to provide data origin authentication
and non-repudiation.
 Digital signatures are used in blockchain where the transactions are
digitally signed by senders using their private key before
broadcasting the transaction to the network.

 This digital signing, proves they are the rightful owner of the asset,
for example, bitcoins.
 These transactions are verified again by other nodes on the network
to ensure that the funds indeed belong to the node (user) who claims
to be the owner.
29-06-2021

Signcryption
 Signcryption is a public key cryptography primitive that provides all
of the functions of a digital signature and encryption.
 Yuliang Zheng invented signcryption, and it is now an ISO standard,
ISO/IEC 29150:2011.
 Traditionally, sign then encrypt or encrypt then sign schemes are
used to provide unforgeability, authentication, and non-repudiation,
but with signcryption, all services of digital signatures and encryption
are provided at a cost that is less than that of the sign then encrypt
scheme.
 Signcryption enables Cost (signature & encryption) << Cost
(signature) + Cost (Encryption) in a single logical step.
29-06-2021

Blind Signatures
 Blind signatures were introduced by David Chaum in 1982.
 They are based on public key digital signature schemes, such as
RSA.
 The key idea behind blind signatures is to get the message signed
by the signer without actually revealing the message.
 This is achieved by disguising or blinding the message before
signing it, hence the name blind signatures.
 This blind signature can then be verified against the original
message just like a normal digital signature.
 Blind signatures were introduced as a mechanism to allow the
development of digital cash schemes.
29-06-2021

Design of Secure Hash Algorithm(SHA)

Recommended

More Related Content

What's hot (20)

Similar to Design of Secure Hash Algorithm(SHA) (20)

Recently uploaded (20)

Design of Secure Hash Algorithm(SHA)