📝 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
Many modern #blockchain platforms are built using very outdated #cryptographic algorithms that use the elliptic curve #algorithm.
⠀
🔓 This method is very reliable, but if you find a linear discrete logarithm algorithm or select a key using a quantum computer, then the cryptographic strength is reduced to zero.
⠀
⚙️ And if you find a linear algorithm a task that is almost impossible in modern technical realities, then quantum computers can easily cope with this task.
⠀
❓ What solution does Relictum Pro offer?
⠀
💡 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 (256 bits). This gives a high crypto-stability, including from a promising quantum #computer. Regardless of the size of the input, SHA-1 always gives a 32-bytes #hash.
⠀
🔹 Suppose that the message sent to you by the user, with standard #encryption algorithms, would take 15 bytes. In this case, it would be very easy to find it, simply by going through all possible solutions on a quantum computer.
⠀
🔐 However, expanding the message to 32 bytes would confuse the encryption search algorithm and, in all possible cases, would return an incorrect value.
⠀
✔️ Thus, Relictum Pro easily tackles the main blockchain problem with the advent of the quantum computer and provides the best cryptographic strength in the #industry.
⠀
📢 Learn more about the Relictum Pro project on our website: https://relictum.pro/
⠀
🔓 This method is very reliable, but if you find a linear discrete logarithm algorithm or select a key using a quantum computer, then the cryptographic strength is reduced to zero.
⠀
⚙️ And if you find a linear algorithm a task that is almost impossible in modern technical realities, then quantum computers can easily cope with this task.
⠀
❓ What solution does Relictum Pro offer?
⠀
💡 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 (256 bits). This gives a high crypto-stability, including from a promising quantum #computer. Regardless of the size of the input, SHA-1 always gives a 32-bytes #hash.
⠀
🔹 Suppose that the message sent to you by the user, with standard #encryption algorithms, would take 15 bytes. In this case, it would be very easy to find it, simply by going through all possible solutions on a quantum computer.
⠀
🔐 However, expanding the message to 32 bytes would confuse the encryption search algorithm and, in all possible cases, would return an incorrect value.
⠀
✔️ Thus, Relictum Pro easily tackles the main blockchain problem with the advent of the quantum computer and provides the best cryptographic strength in the #industry.
⠀
📢 Learn more about the Relictum Pro project on our website: https://relictum.pro/
