LT   EN   RU  
Thursday 23 September 2021 - Independent and informative portal
Register   Login
News subscribe
Subscribe   Unsubscribe
Visits since 2002 09 12 - 68190968
Pages in 40735
  Computers > Computer technologies > Security > Cryptography
Lankomumo reitingas Print version Print version
Cryptographic Hash Functions

Cryptographic hash functions are used in various contexts, for example, to compute the message digest when making a digital signature. A hash function compresses the bits of a message to a fixed-size hash value in a way that distributes the possible messages evenly among the possible hash values. A cryptographic hash function does this in a way that makes it extremely difficult to come up with a message that would hash to a particular hash value.

Cryptographic hash functions typically produce hash values of 128 or more bits. The number of different hash values thus obtained, 2128, is vastly larger than the number of different messages likely to ever be exchanged in the world. The reason for requiring more than 128 bits is based on the birthday paradox. The birthday paradox roughly states that given a hash function mapping any message to an 128-bit hash digest, we can expect that the same digest will be computed twice when 264 randomly selected messages have been hashed. As cheaper memory chips for computers become available it may become necessary to require larger than 128 bit message digests (such as 160 bits as has become standard recently).

Many good cryptographic hash functions are freely available. The most famous cryptographic hash functions are those of the MD family: MD4, MD5, SHA-1, and RipeMD-160. Of these, MD4, MD5, and SHA-1 have been broken. MD4 and MD5 should be considered insecure and not used anymore. SHA-1 is still widely used, although its stronger counterparts, SHA-256, SHA-384, and SHA-512 are likely to replace it in the future.

Lankomumo reitingas

Diskusijos - Discusions

Versija spausdinimui - Print version

Random tags:    Cryptography (10)    Chess (10)    Law (11)    Travels (2)    Formula 1 (2)    Communication (38)    Wedding (10)    Hunting (3)    Telecomunication (40)    Laptops (10)    Linux/Unix (2)    Astronomy (11)    Kisses (13)    Economics2 (2)    Ecology (10)    Cinema (20)    Astrology (10)    Mysticism 2 (3)    V.Nabokov (54)    Programing (13)    Nursing (4)    The Rights of Man (14)    Agriculture (17)    Martial arts (7)    Krishnaism (10)    Architecture (2)    S.Valiulis (2)    Badminton (3)    Software (11)    Hardware (43)    Open source (9)    Paintball (10)    Fencing (2)    Love (48)    Beer (10)    Dogs (17)    Countries (43)    SSL certificates (10)    Sound systems (10)    Guns (11)    Eurointegration (4)    Religion (34)    Helping and prevention (14)    Literature (24)    Viruses (10)    Feng Shui (14)    Monitors (10)    Aquariums (28)    Sport (81)    Energetics (2)
1. Cryptography
2. A Brief History of Cryptography - compiled by Shireen Hebert
3. Cryptography: History
4. Introduction to Cryptosystems
5. Cryptanalysis and Attacks on Cryptosystems
6. Strength of Cryptographic Algorithms
7. Cryptographic Random Number Generators
8. Digital Signatures
9. Basic Cryptographic Algorithms
1. Cryptanalysis and Attacks on Cryptosystems
2. A Brief History of Cryptography - compiled by Shireen Hebert
3. Strength of Cryptographic Algorithms
4. Basic Cryptographic Algorithms
5. Cryptography: History
6. Introduction to Cryptosystems
7. Cryptography
8. Digital Signatures
9. Cryptographic Random Number Generators