📝 The hash function is a deterministic function, the input of which is a string of bits of #arbitrary length, and the output is always a bit string of a fixed length n.
⠀
🔰 Properties that should be inherent in #cryptographic hash functions:
1. Resistance to the search for the first #prototype - absence effective polynomial algorithm for computing the inverse function.
2. Resistance to the search for the second prototype (collisions first kind).
3. Resistance to collisions (collisions of the second kind)
The resistance of the hash function to collisions means that there is no #effective polynomial algorithm to find collisions.
⠀
〽️ SHA1 is a hash algorithm created by the National #Security Agency (NSA). The #SHA1 hash algorithm is commonly used in security and data integrity applications. SHA-1 was established in 1995 as the successor to SHA-0. SHA1 is a message hashing or digest algorithm where it generates a 160-bit unique value from the input. The size of the input does not matter, because SHA1 always generates a message hash of the same size, which is 160 bits. This may seem very confusing, but the algorithm is just for that.
⠀
📊 Hash algorithms specified in this standard are called #safe because it is impossible to calculate the following according to a given algorithm: 1) restore a message using a specific message digest, or 2) find two different messages that have the same message digest (find a collision). Any changes in the message are very likely to result in different hash values. This property is useful when creating and verifying digital signatures, when #authenticating messages, and when creating random numbers.
⠀
♻️ Each #algorithm consists of two stages: preprocessing and hash calculation. Pre-processing includes message padding, splitting the padded message into M-bit #blocks, and setting the initialization values used to calculate the hash. The calculation of the hash is iterative, processing each M-bit block of the augmented message, and uses functions, constants, and word operations to obtain a hash value. The result of the hash calculation procedure is a message digest.
⠀
💠 𝗥𝗲𝗹𝗶𝗰𝘁𝘂𝗺 𝗣𝗿𝗼 𝗵𝗮𝘀𝗵𝗶𝗻𝗴 𝗺𝗲𝗰𝗵𝗮𝗻𝗶𝘀𝗺
Relictum Pro is a supplemented modification of SHA1-based #hashing mathematics. The main advantage of it is in converting from 20 bytes to 32 bytes (in your own hash). This gives a high crypto-stability, including from a promising #quantum computer.
🏮 Website: https://relictum.pro
⠀
#Blockchain #relictcoin #tech #relictumpro #fintech #Crypto #blockchain5 #technology #techno
⠀
🔰 Properties that should be inherent in #cryptographic hash functions:
1. Resistance to the search for the first #prototype - absence effective polynomial algorithm for computing the inverse function.
2. Resistance to the search for the second prototype (collisions first kind).
3. Resistance to collisions (collisions of the second kind)
The resistance of the hash function to collisions means that there is no #effective polynomial algorithm to find collisions.
⠀
〽️ SHA1 is a hash algorithm created by the National #Security Agency (NSA). The #SHA1 hash algorithm is commonly used in security and data integrity applications. SHA-1 was established in 1995 as the successor to SHA-0. SHA1 is a message hashing or digest algorithm where it generates a 160-bit unique value from the input. The size of the input does not matter, because SHA1 always generates a message hash of the same size, which is 160 bits. This may seem very confusing, but the algorithm is just for that.
⠀
📊 Hash algorithms specified in this standard are called #safe because it is impossible to calculate the following according to a given algorithm: 1) restore a message using a specific message digest, or 2) find two different messages that have the same message digest (find a collision). Any changes in the message are very likely to result in different hash values. This property is useful when creating and verifying digital signatures, when #authenticating messages, and when creating random numbers.
⠀
♻️ Each #algorithm consists of two stages: preprocessing and hash calculation. Pre-processing includes message padding, splitting the padded message into M-bit #blocks, and setting the initialization values used to calculate the hash. The calculation of the hash is iterative, processing each M-bit block of the augmented message, and uses functions, constants, and word operations to obtain a hash value. The result of the hash calculation procedure is a message digest.
⠀
💠 𝗥𝗲𝗹𝗶𝗰𝘁𝘂𝗺 𝗣𝗿𝗼 𝗵𝗮𝘀𝗵𝗶𝗻𝗴 𝗺𝗲𝗰𝗵𝗮𝗻𝗶𝘀𝗺
Relictum Pro is a supplemented modification of SHA1-based #hashing mathematics. The main advantage of it is in converting from 20 bytes to 32 bytes (in your own hash). This gives a high crypto-stability, including from a promising #quantum computer.
🏮 Website: https://relictum.pro
⠀
#Blockchain #relictcoin #tech #relictumpro #fintech #Crypto #blockchain5 #technology #techno
🧮 Hash and hashing algorithms are key concepts that newcomers to the blockchain know about and which always go hand in hand with security.
⠀
♨️ To maintain decentralized networks and consensus mechanisms, including Bitcoin or #Ethereum with a thousand nodes connected via p2p, a “lack of trust” and an effective confirmation system are necessary. These #networks need compact methods of encrypting information that would allow participants to conduct quick and secure checks.
⠀
🔳 #Block is one of the main components of #Bitcoin and Ethereum. The block contains information about transactions, timestamps, and other significant metadata. A considerable role in ensuring #security is played by the ability to compress large amounts of information about the global network status into short standard messages, which can be easily checked if necessary. These messages are the hash.
⠀
⚜️ Hash algorithms in #cryptography are used everywhere. The main areas of their application are the #storage of passwords, file verification systems, etc. The essence of these hashes is to use a deterministic algorithm that takes input and creates a string with a fixed length. Thus, the same input will always be converted to the same output.
⠀
Determinism is important not only for hashes because even if you change one bit of the input data, you also get a completely different hash.
⠀
🌀 However, there is a problem with #hashing algorithms - this is the inevitability of collisions. Collisions are bad. This means that the attacker who created the collisions can transfer malicious files while hiding under the correct hash. A good hash #function should make it more difficult for attackers to find ways to create an input with the same hash value.
⠀
♻️ The process of calculating the hash should not be too effective since in this case, #attackers can easily calculate collisions. Hash #algorithms must be resistant to the attacks of finding the pre-image. It is necessary to complicate the process of calculating steps to find the initial value from which the hash was created (for example, the inverse image).
⠀
🌐 𝗥𝗲𝗹𝗶𝗰𝘁𝘂𝗺 𝗣𝗿𝗼 is a supplemented modification of #SHA1-based hashing mathematics. The main advantage of it is in converting from 20 #bytes to 32 bytes (in your own hash). This gives a high crypto-stability, including from a promising quantum computer.
⠀
♨️ To maintain decentralized networks and consensus mechanisms, including Bitcoin or #Ethereum with a thousand nodes connected via p2p, a “lack of trust” and an effective confirmation system are necessary. These #networks need compact methods of encrypting information that would allow participants to conduct quick and secure checks.
⠀
🔳 #Block is one of the main components of #Bitcoin and Ethereum. The block contains information about transactions, timestamps, and other significant metadata. A considerable role in ensuring #security is played by the ability to compress large amounts of information about the global network status into short standard messages, which can be easily checked if necessary. These messages are the hash.
⠀
⚜️ Hash algorithms in #cryptography are used everywhere. The main areas of their application are the #storage of passwords, file verification systems, etc. The essence of these hashes is to use a deterministic algorithm that takes input and creates a string with a fixed length. Thus, the same input will always be converted to the same output.
⠀
Determinism is important not only for hashes because even if you change one bit of the input data, you also get a completely different hash.
⠀
🌀 However, there is a problem with #hashing algorithms - this is the inevitability of collisions. Collisions are bad. This means that the attacker who created the collisions can transfer malicious files while hiding under the correct hash. A good hash #function should make it more difficult for attackers to find ways to create an input with the same hash value.
⠀
♻️ The process of calculating the hash should not be too effective since in this case, #attackers can easily calculate collisions. Hash #algorithms must be resistant to the attacks of finding the pre-image. It is necessary to complicate the process of calculating steps to find the initial value from which the hash was created (for example, the inverse image).
⠀
🌐 𝗥𝗲𝗹𝗶𝗰𝘁𝘂𝗺 𝗣𝗿𝗼 is a supplemented modification of #SHA1-based hashing mathematics. The main advantage of it is in converting from 20 #bytes to 32 bytes (in your own hash). This gives a high crypto-stability, including from a promising quantum computer.
