Modern cryptography
◦Modern cryptography base on
mathematical theory and
computer science practice.
◦Cryptographic algorithms are
designed around computational
hardness assumptions.
Cipher methods
◦Substitution cipher ◦Vernam cipher
◦Transposition cipher ◦Book or running cipher
◦Exclusive OR ◦Hash function
HASH FUNCTION
Hash function
◦Mathematical algorithms: ◦Generate a summary or
◦Arithmetic operations fingerprint of a message:
◦Binary operations ◦Fixed-length message
◦Compression function ◦Unique
◦Verify integrity and identity.
Hash function
◦Not encrypt data:
◦Impossible to decrypt
◦Ensure the content remains unchanged:
◦Generates a unique value for a given dataset
◦The hash value changes completely with each
altered character (Avalanche Effect property)
Hash function
◦Fixed-length value: ◦Same hash value with same hash
◦Convert a variable-length algorithms:
message into a fixed-length ◦Same message always provides the
message same hash value
◦Hash value itself cannot be used to
determine the contents of the message
Hash function
◦Does not require a key:
◦Only use hash algorithms to
hash message
◦Can be used with MAC
(Message Authentication Code).
◦Uses a symmetric key to
ensure confidentiality
Hash function
◦Used for Fingerprint:
◦To authenticate something
◦Used to store passwords:
◦To protect passwords
Secure Hash Standard (SHS)
◦Issued by the National Institute of Standards and Technology
(NIST).
◦The number of bits used in the hash algorithm is a
measurement of the strength of the algorithm against collision
attacks.
Secure Hash Standard (SHS)
◦SHA-1 (160-bit hash) was initially specified in FIPS 180-1,
based on MD4 principles.
◦SHA-256, SHA-384, and SHA-512 were introduced, offering
128, 192, and 256-bit security.
Hash Function Attacks
◦Obtain or gain access to hashed password files.
◦Use brute-force and dictionary attacks.
◦Easy to implement.
◦Requires more time and a powerful computer..
◦=> Ineffective in practice.
Rainbow cracking
◦An evolution of brute-force and dictionary attacks against hash
functions.
◦Uses a rainbow table:
◦A database containing precomputed hashes from sequentially generated
passwords.
◦Classified as a time–memory tradeoff attack.
Rainbow cracking
◦It looks up the hashed password and retrieves the plaintext.
◦Similar to a search algorithm.
Rainbow cracking defense
◦Protect the file of hashed passwords .
◦Implement strict limits on the number of login attempts.
◦Use password hash salting.
◦Use stronger password (case, special character, number, …).
Password hash salting
Password hash salting
◦Creates a different hash.
◦Salt value stored along with the account identifier.
◦Rainbow cracking fails since the time-memory tradeoff is no longer in the
attacker’s favor.
Conclusion
Conclusion
◦The ideal cryptographic hash function has four main properties:
• It is easy to compute the hash value for any given message
• It is infeasible to generate a message that has a given hash
• It is infeasible to modify a message without changing the hash
• It is infeasible to find two different messages with the same hash.
Conclusion
◦Hash functions are widely used in information security:
• Digital signatures, message authentication codes (MACs), and authentication
• Data indexing, fingerprinting, duplicate detection, file identification, and
checksums for error detection
• Digital fingerprints or checksums
VERY THANKS
YOUS
VERY MORE MUCH
___
Adversary : kẻ thù Condense : cô đọng
Infeasible : không khả thi Propose : đề xuất
Scheme : chương trình Intermediate : trung gian
Computationally : về mặt tính toán Compression : nén
Identical : giống hệt nhau Concern : mối lo
Issue : ban hành Ordinary : bình thường
