Professional Documents
Culture Documents
Unit III
Unit III
Contents
1.Message Authentication Requirements
2.Message Authentication Functions
3.Message Authentication Code
4.Advantages Of MAC
5.Applications Of MAC
6.Attacks On MAC
7.Hash Function
6.Application Of Cryptographic Hash Function
7.Two Simple Hash Functions
8.Secure Hash Algorithm(SHA512)
9.DAA
10.Cipher-based Message Authentication Code (CMAC)
11. HMAC
MESSAGE AUTHENTICATION REQUIREMENTS
Disclosure: Release of message contents to any person or process
not possessing the appropriate cryptographic key.
Traffic analysis: Discovery of the pattern of traffic between parties.
• In a connection-oriented application, the frequency and duration
of connections could be determined.
• In either a connection oriented or connectionless environment,
the number and length of messages between parties could be
determined.
Masquerade: Insertion of messages into the network from a
fraudulent source.
• This includes the creation of messages by an opponent that are
purported to come from an authorized entity.
• Also included are fraudulent acknowledgments of message
receipt or no receipt by someone other than the message
recipient.
Content modification: Changes to the contents of a message,
including insertion, deletion, transposition, and modification.
Sequence modification: Any modification to a sequence of messages
between parties, including insertion, deletion, and reordering.
Timing modification: Delay or replay of messages.
• In a connection-oriented application, an entire session or sequence
of messages could be a replay of some previous valid session
• Individual messages in the sequence could be delayed or replayed.
• In a connectionless application, an individual message (e.g.,
datagram) could be delayed or replayed.
Source repudiation: Denial of transmission of message by source.
Destination repudiation: Denial of receipt of message by destination.
Measures to deal with the first two attacks are in the realm of
message
MESSAGE AUTHENTICATION FUNCTIONS
• For example, suppose that we are transmitting English-
language messages using a Caesar cipher with a shift of one (K
= 1).
• A sends the following legitimate cipher text:
• nbsftfbupbutboeepftfbupbutboemjuumfmbnctfbujwz
• B decrypts to produce the following plaintext
• Mareseatoatsanddoeseatoatsandlittlelambseativy
• A simple frequency analysis confirms that this message has the
profile of ordinary English. On the other hand, if an opponent
generates the following random sequence of letters:
• zuvrsoevgqxlzwigamdvnmhpmccxiuureosfbcebtqxsxq
• This decrypts to
• Ytuqrndufpwkyvhfzlcumlgolbbwhttqdnreabdaspwrwp
• which does not fit the profile of ordinary English.
Figure: TCP segment
MESSAGE AUTHENTICATION CODE