The most profitable mine
Publish: 2021-05-21 16:48:38
1.
Lightcoin needs to be generated by "miner's mining". Mining is done by hashing with computer graphics card. If the value of "mine burst" is calculated, the system will reward 50 lightcoin at one time. At present, the computing power of lightcoin is growing rapidly, and miner can't dig mine through several computers. Therefore, it needs to be added to the mine pool, which collects all the computing power, It is estimated that the probability of calculating the "blasting" value is higher
at present, the well-known ore pools include BTCC (formerly bitcoin China) ore pool, waltc.net fish pool (f2pool), wemineltc, coinotron, silverfish, liteguardian, litecoin pool.org, etc. But at present, the highest income is f2pool. Recently, it launched lightcoin theory income + 10% of mine pool subsidy = your actual income, which has attracted the attention of many miners and the instry
the world's major active digital currency exchange rate currency symbol issue time author's active official website market value bitcoin foundation remarks bitcoin BTC 2009 Satoshi Nakamoto is bitcoin / org ~ $24.3 billion is SHA-256, LTC 2011 coblee is litecoin / org ~ $3.6 billion is script
2.
top ten Ethereum mining software in 2020
in terms of market value, Ethereum is the second largest cryptocurrency, second only to bitcoin. Ethereum's popularity among the holders has increased rapidly because it can build the whole decentralized ecosystem and applications on top of its blockchain. As Ethereum is friendly to GPU mining, Ethereum is a good choice for PC users (especially those with AMD high-end graphics cards). However, 24ker should also warn readers that at this time point, Ethereum's price is $241, which means that even if you use radon VII (90mh / s), your weekly profit is less than $7, The annual profit is about $339. However, considering the potential value-added space of Ethereum, if the price can return to the healthy range of $500-600, it means that your radon will be back in one year
if you already have Ethereum mining hardware and an effective wallet, all you have to do is to find the best eth mining software, which will help you manage the mining work effectively
in this article, we will introce the features, advantages and compatible operating systems. But before we get there... Let's talk about the basics
why Ethereum
unlike traditional currencies, Ethernet operates on the public ledger system, which makes mining itself the core power of Ethereum network. When miners receive the transaction data sent by other members of the network, they assemble them into a structure called Merkle tree, and then try to find an acceptable hash value
only one hash will be returned for each dataset, and the hash value cannot be used to dece the original data. Its purpose is to effectively ensure that the block information is not tampered with. Moreover, if someone changes even one number in any long transaction string, the output hash value will be completely different, and false transaction or fraud will be eliminated
as you can see, if there is no Ethereum mining, Ethereum network will be paralyzed immediately. Therefore, participating in Ethereum mining is not only the mining revenue, but also the support for the operation and growth of Ethereum
what is mining software< In short, mining software is a program that uses a computer graphics card (GPU) as a resource to solve complex mathematical equations. Once the equation is solved, the data is added to the rest of the blockchain
the mining software will monitor the input and output of the hardware, and display statistical data to you, such as miner speed, fan speed, temperature and hash rate
the Ethereum mining software described in this article can be connected to many available Ethereum mining pools
Ethereum mine pool
Ethereum mine pool is a resource area that is equally distributed and shared among miners. Nowadays, it has become too difficult for a person to dig a mine, so it is necessary to use the way of mining pool to fight in groups
today, Ethereum is one of the most famous choice of Ethereum mines. The pool allows its users to remain anonymous and pay only a small 1% mining fee<
top ten Ethereum mining software:
1-ethminer (Ethereum Royal)
it can be seen from the name that ethminer is specially designed for mining Ethereum, and currently supports Linux, MAC and windows. Make sure to download the version corresponding to the device's operating system
in addition to Ethereum, you can also use ethminer to mine all tokens according to ethash algorithm, including expand, elaism, metaverse, musicoin, Pirl, Ethereum classic, etc< Ethminer is a command line software. This means that you can start it from the Linux console or the windows command prompt, or you can use the windows CMD / batch file or the Linux bash script to create a shortcut to the preset command line<
(2-cgminer)
this program was released in 2011. Because it is compatible with three different mining hardware (ASIC, FPGA and GPU), it is still one of the most popular mining software options. CG miner is an open source Ethereum miner written in C language, and provides support and binary files for openwrt router, RPI, etc
the advantages of cgminer include the ability to match your hash rate with zero latency extension, remote interface function and advanced detection of new blocks. The software can be used for Mac, Linux and windows
3 - Claymore (maximum efficiency)
if you are looking for the most efficient Ethereum mining software, please consider using Claymore's al Ethereum mining machine, which can speed up to any hash rate without sacrificing the mining speed
Claymore recently released v12.0 upgrade, which reces the equipment cost of al mining mode from 2% to 1%. The upgrade also offers 3gb and 2GB cards with zero development costs. However, Claymore al miner can't run on Mac. At present, it can only run on Linux and windows. But it supports both NVIDIA and AMD cards
other coins you can mine with this program include siacoin, lbry, decred and Pascal< If you are not familiar with cryptocurrency mining and are looking for the simplest Ethereum mining software, please check wineth
the software is based on the ethminer that we have just evaluated, but wineth provides users with a more simple and easy to understand GUI, combined with "intelligent" algorithm, which will provide the configuration that can ensure the best performance on the new user's hardware
as can be seen from the name, wineth is only compatible with windows devices, and you can find it in the windows 10 app store.
top ten Ethereum mining software in 2020
in terms of market value, Ethereum is the second largest cryptocurrency, second only to bitcoin. Ethereum's popularity among the holders has increased rapidly because it can build the whole decentralized ecosystem and applications on top of its blockchain. As Ethereum is friendly to GPU mining, Ethereum is a good choice for PC users (especially those with AMD high-end graphics cards). However, 24ker should also warn readers that at this time point, Ethereum's price is $241, which means that even if you use radon VII (90mh / s), your weekly profit is less than $7, The annual profit is about $339. However, considering the potential value-added space of Ethereum, if the price can return to the healthy range of $500-600, it means that your radon will be back in one year
if you already have Ethereum mining hardware and an effective wallet, all you have to do is to find the best eth mining software, which will help you manage the mining work effectively
in this article, we will introce the features, advantages and compatible operating systems. But before we get there... Let's talk about the basics
why Ethereum
unlike traditional currencies, Ethernet operates on the public ledger system, which makes mining itself the core power of Ethereum network. When miners receive the transaction data sent by other members of the network, they assemble them into a structure called Merkle tree, and then try to find an acceptable hash value
only one hash will be returned for each dataset, and the hash value cannot be used to dece the original data. Its purpose is to effectively ensure that the block information is not tampered with. Moreover, if someone changes even one number in any long transaction string, the output hash value will be completely different, and false transaction or fraud will be eliminated
as you can see, if there is no Ethereum mining, Ethereum network will be paralyzed immediately. Therefore, participating in Ethereum mining is not only the mining revenue, but also the support for the operation and growth of Ethereum
what is mining software< In short, mining software is a program that uses a computer graphics card (GPU) as a resource to solve complex mathematical equations. Once the equation is solved, the data is added to the rest of the blockchain
the mining software will monitor the input and output of the hardware, and display statistical data to you, such as miner speed, fan speed, temperature and hash rate
the Ethereum mining software described in this article can be connected to many available Ethereum mining pools
Ethereum mine pool
Ethereum mine pool is a resource area that is equally distributed and shared among miners. Nowadays, it has become too difficult for a person to dig a mine, so it is necessary to use the way of mining pool to fight in groups
today, Ethereum is one of the most famous choice of Ethereum mines. The pool allows its users to remain anonymous and pay only a small 1% mining fee<
top ten Ethereum mining software:
1-ethminer (Ethereum Royal)
it can be seen from the name that ethminer is specially designed for mining Ethereum, and currently supports Linux, MAC and windows. Make sure to download the version corresponding to the device's operating system
in addition to Ethereum, you can also use ethminer to mine all tokens according to ethash algorithm, including expand, elaism, metaverse, musicoin, Pirl, Ethereum classic, etc< Ethminer is a command line software. This means that you can start it from the Linux console or the windows command prompt, or you can use the windows CMD / batch file or the Linux bash script to create a shortcut to the preset command line<
(2-cgminer)
this program was released in 2011. Because it is compatible with three different mining hardware (ASIC, FPGA and GPU), it is still one of the most popular mining software options. CG miner is an open source Ethereum miner written in C language, and provides support and binary files for openwrt router, RPI, etc
the advantages of cgminer include the ability to match your hash rate with zero latency extension, remote interface function and advanced detection of new blocks. The software can be used for Mac, Linux and windows
3 - Claymore (maximum efficiency)
if you are looking for the most efficient Ethereum mining software, please consider using Claymore's al Ethereum mining machine, which can speed up to any hash rate without sacrificing the mining speed
Claymore recently released v12.0 upgrade, which reces the equipment cost of al mining mode from 2% to 1%. The upgrade also offers 3gb and 2GB cards with zero development costs. However, Claymore al miner can't run on Mac. At present, it can only run on Linux and windows. But it supports both NVIDIA and AMD cards
other coins you can mine with this program include siacoin, lbry, decred and Pascal< If you are not familiar with cryptocurrency mining and are looking for the simplest Ethereum mining software, please check wineth
the software is based on the ethminer that we have just evaluated, but wineth provides users with a more simple and easy to understand GUI, combined with "intelligent" algorithm, which will provide the configuration that can ensure the best performance on the new user's hardware
as can be seen from the name, wineth is only compatible with windows devices, and you can find it in the windows 10 app store.
3. At present, the existing digital currencies in the world can not be counted. One or even dozens of digital currencies may be born every day, and several or even dozens of digital currencies may disappear every day
the existing well-known digital currencies include bitcoin, Leyte coin, Ruitai coin, Ethereum, dogcoin, bitstock, Ruibo coin, Diandian coin, Yuanbao coin, etc.
the existing well-known digital currencies include bitcoin, Leyte coin, Ruitai coin, Ethereum, dogcoin, bitstock, Ruibo coin, Diandian coin, Yuanbao coin, etc.
4. Also want to ask, if I change this machine into a miner, as long as a card for more than one exchange of fire on the line?
5. Sha family
Sha (secure hash algorithm) is a series of cryptographic hash functions designed by National Security Agency (NSA) and published by National Institute of standards and Technology (NIST). The first member of the family officially named Sha was published in 1993. However, it has now been given an informal name sha-0 to avoid confusion with its successors. Two years later, SHA-1, the successor of the first Sha, was released. There are also four variants that have been released to enhance the scope of output and to change some minor designs: sha-224, SHA-256, sha-384, and sha-512 (sometimes referred to as SHA-2)<
sha-0 and SHA-1
the algorithms originally specified were published in 1993, which are called secure hash standard, FIPS pub 180. This version is now often called & quot; SHA-0" It was withdrawn by NSA soon after its release, and released in 1995 as a revised version of FIPS pub 180-1 (commonly known as & quot; SHA-1") replace. According to NSA, it fixed an error in the original algorithm that would rece password security. However, NSA does not provide any further explanation or proof that the error has been corrected. In 1998, in an attack on sha-0, it was found that this attack was not applicable to SHA-1 - we don't know if this is the error found by NSA, but it may indicate that this correction has improved the security. SHA-1 has been closely examined by the public password community, but it has not been found to be unsafe. It is now considered safe
sha-0 and SHA-1 will generate a 160 bit digest from a message with a maximum size of 2 ^ 64 bits, and then encrypt it based on the similar principle of Ronald L. Rivest, Professor of MIT who designed MD4 and MD5 message digest algorithms<
Cryptanalysis of sha-0
on crypto 98, two French researchers demonstrated an attack on sha-0 (chabaud and joux, 1998): hash collision can be found when the complexity is 2 ^ 61; Less than 2 ^ 80 is an ideal hash function of the same size
in 2004, Biham and Chen discovered the approximate collision of sha-0 - two messages can hash out the same value; In this case, 142 and 160 bits are the same. They also found that sha-0 dropped to 62 bits after 80 full collisions
on August 12, 2004, joux, carribault, lemuet and jalby announced the hash collision of the complete sha-0 algorithm. This is the result of the attack of chabaud and joux. The collision was found to be 2 ^ 51, and it took about 80000 CPU hours to work on a supercomputer with 256 Itanium 2 processors< On August 17, 2004, Wang, Feng, Lai, and Yu announced the preliminary results of attacking MD5, sha-0, and other hash functions at the rump meeting of crypto 2004. Their attack on sha-0 is as complex as 2 ^ 40, which means that their attack results are better than those of joux and others. A brief summary of the rump meeting can be found here, and their discussions in sci.crypt, for example, suggest that people planning to use SHA-1 as a new cryptosystem need to reconsider
longer variants
NIST has released three additional Sha variants, each with a longer message digest. They are named by adding their summary length (in bits) after their original name: & quot; SHA-256", & quot; SHA-384" And & quot; SHA-512" They were published in the draft of FIPS pub 180-2 in 2001, and then passed the review and comments. FIPS pub 180-2, including SHA-1, was released as an official standard in 2002. These new hash functions have not been tested in detail by the public password community like SHA-1, so their password security is not widely trusted. In February 2004, a change notice of FIPS pub 180-2 was issued, and an additional variant was added; SHA-224"， The key length required for double key 3DES is defined
Gilbert and handschuh (2003) studied new varieties and found no weaknesses<
shad
shad function is a simple restatement of the same Sha function:
shad-256 (m) = SHA-256 (SHA-256 (m)). It overcomes the problem of extended length attacks
applications
SHA-1, sha-224, SHA-256, sha-384 and sha-512 are all used by the U.S. federal government, which needs secure hash algorithms. They also use other cryptographic algorithms and protocols to protect sensitive unclassified data. FIPS pub 180-1 also encourages private or commercial organizations to use SHA-1 encryption. Fritz chip will probably use SHA-1 hash function to realize digital rights management on personal computers
the first to promote the publication of secure hash algorithm is the combined digital signature standard
Sha hash function has been used as the basis of shacal block cipher algorithm<
description of SHA-1
the pseudocode of SHA-1 algorithm is as follows:
(initialize variables:)
A = H0 = 0x67452301
b = H1 = 0xefcdab89
C = h2 = 0x98badcfe
d = H3 = 0x10325476
e = H4 = 0xc3d2e1f0
(pre processing:)
paddedmessage = (message) append 1
while length (paddedmessage) mod 512 & gt; 448:
paddedmessage = paddedmessage append 0
paddedmessage = paddedmessage append (length(message) in 64-bit format)
(Process the message in successive 512-bit chunks:)
while 512-bit chunk(s) remain(s):
break the current chunk into sixteen 32-bit words w(i), 0 <= i <= 15
(Extend the sixteen 32-bit words into eighty 32-bit words:)
for i from 16 to 79:
w(i) = (w(i-3) xor w(i-8) xor w(i-14) xor w(i-16)) leftrotate 1
(Main loop:)
for i from 0 to 79:
temp = (a leftrotate 5) + f(b,c,d) + e + k + w(i) (note: all addition is mod 2^32)
where:
(0 <= i <= 19): f(b,c,d) = (b and c) or ((not b) and d), k = 0x5A827999
(20 <= i <= 39): f(b,c,d) = (b xor c xor d), k = 0x6ED9EBA1
(40 <= i <= 59): f(b,c,d) = (b and c) or (b and d) or (c and d), k = 0x8F1BBCDC
(60 <= i <= 79): F (B, C, d) = (b XOR C XOR d), k = 0xca62c1d6
e = d
d = C
C = B leftrotate 30
b = a
A = temp
H0 = H0 + a
H1 = H1 + B
h2 = H2 + C
H3 = H3 + d
H4 = H4 + e
digest = hash = H0 append H1 append H2 append H3 append H4
note: FIPS pub 180-1 shows the concept of, The efficiency can be improved by using the following formula:
(0 & lt= i <= 19): f(b,c,d) = (d xor (b and (c xor d)))
(40 <= i <= 59): f(b,c,d) = (b and c) or (d and (b or c)))
Sha (secure hash algorithm) is a series of cryptographic hash functions designed by National Security Agency (NSA) and published by National Institute of standards and Technology (NIST). The first member of the family officially named Sha was published in 1993. However, it has now been given an informal name sha-0 to avoid confusion with its successors. Two years later, SHA-1, the successor of the first Sha, was released. There are also four variants that have been released to enhance the scope of output and to change some minor designs: sha-224, SHA-256, sha-384, and sha-512 (sometimes referred to as SHA-2)<
sha-0 and SHA-1
the algorithms originally specified were published in 1993, which are called secure hash standard, FIPS pub 180. This version is now often called & quot; SHA-0" It was withdrawn by NSA soon after its release, and released in 1995 as a revised version of FIPS pub 180-1 (commonly known as & quot; SHA-1") replace. According to NSA, it fixed an error in the original algorithm that would rece password security. However, NSA does not provide any further explanation or proof that the error has been corrected. In 1998, in an attack on sha-0, it was found that this attack was not applicable to SHA-1 - we don't know if this is the error found by NSA, but it may indicate that this correction has improved the security. SHA-1 has been closely examined by the public password community, but it has not been found to be unsafe. It is now considered safe
sha-0 and SHA-1 will generate a 160 bit digest from a message with a maximum size of 2 ^ 64 bits, and then encrypt it based on the similar principle of Ronald L. Rivest, Professor of MIT who designed MD4 and MD5 message digest algorithms<
Cryptanalysis of sha-0
on crypto 98, two French researchers demonstrated an attack on sha-0 (chabaud and joux, 1998): hash collision can be found when the complexity is 2 ^ 61; Less than 2 ^ 80 is an ideal hash function of the same size
in 2004, Biham and Chen discovered the approximate collision of sha-0 - two messages can hash out the same value; In this case, 142 and 160 bits are the same. They also found that sha-0 dropped to 62 bits after 80 full collisions
on August 12, 2004, joux, carribault, lemuet and jalby announced the hash collision of the complete sha-0 algorithm. This is the result of the attack of chabaud and joux. The collision was found to be 2 ^ 51, and it took about 80000 CPU hours to work on a supercomputer with 256 Itanium 2 processors< On August 17, 2004, Wang, Feng, Lai, and Yu announced the preliminary results of attacking MD5, sha-0, and other hash functions at the rump meeting of crypto 2004. Their attack on sha-0 is as complex as 2 ^ 40, which means that their attack results are better than those of joux and others. A brief summary of the rump meeting can be found here, and their discussions in sci.crypt, for example, suggest that people planning to use SHA-1 as a new cryptosystem need to reconsider
longer variants
NIST has released three additional Sha variants, each with a longer message digest. They are named by adding their summary length (in bits) after their original name: & quot; SHA-256", & quot; SHA-384" And & quot; SHA-512" They were published in the draft of FIPS pub 180-2 in 2001, and then passed the review and comments. FIPS pub 180-2, including SHA-1, was released as an official standard in 2002. These new hash functions have not been tested in detail by the public password community like SHA-1, so their password security is not widely trusted. In February 2004, a change notice of FIPS pub 180-2 was issued, and an additional variant was added; SHA-224"， The key length required for double key 3DES is defined
Gilbert and handschuh (2003) studied new varieties and found no weaknesses<
shad
shad function is a simple restatement of the same Sha function:
shad-256 (m) = SHA-256 (SHA-256 (m)). It overcomes the problem of extended length attacks
applications
SHA-1, sha-224, SHA-256, sha-384 and sha-512 are all used by the U.S. federal government, which needs secure hash algorithms. They also use other cryptographic algorithms and protocols to protect sensitive unclassified data. FIPS pub 180-1 also encourages private or commercial organizations to use SHA-1 encryption. Fritz chip will probably use SHA-1 hash function to realize digital rights management on personal computers
the first to promote the publication of secure hash algorithm is the combined digital signature standard
Sha hash function has been used as the basis of shacal block cipher algorithm<
description of SHA-1
the pseudocode of SHA-1 algorithm is as follows:
(initialize variables:)
A = H0 = 0x67452301
b = H1 = 0xefcdab89
C = h2 = 0x98badcfe
d = H3 = 0x10325476
e = H4 = 0xc3d2e1f0
(pre processing:)
paddedmessage = (message) append 1
while length (paddedmessage) mod 512 & gt; 448:
paddedmessage = paddedmessage append 0
paddedmessage = paddedmessage append (length(message) in 64-bit format)
(Process the message in successive 512-bit chunks:)
while 512-bit chunk(s) remain(s):
break the current chunk into sixteen 32-bit words w(i), 0 <= i <= 15
(Extend the sixteen 32-bit words into eighty 32-bit words:)
for i from 16 to 79:
w(i) = (w(i-3) xor w(i-8) xor w(i-14) xor w(i-16)) leftrotate 1
(Main loop:)
for i from 0 to 79:
temp = (a leftrotate 5) + f(b,c,d) + e + k + w(i) (note: all addition is mod 2^32)
where:
(0 <= i <= 19): f(b,c,d) = (b and c) or ((not b) and d), k = 0x5A827999
(20 <= i <= 39): f(b,c,d) = (b xor c xor d), k = 0x6ED9EBA1
(40 <= i <= 59): f(b,c,d) = (b and c) or (b and d) or (c and d), k = 0x8F1BBCDC
(60 <= i <= 79): F (B, C, d) = (b XOR C XOR d), k = 0xca62c1d6
e = d
d = C
C = B leftrotate 30
b = a
A = temp
H0 = H0 + a
H1 = H1 + B
h2 = H2 + C
H3 = H3 + d
H4 = H4 + e
digest = hash = H0 append H1 append H2 append H3 append H4
note: FIPS pub 180-1 shows the concept of, The efficiency can be improved by using the following formula:
(0 & lt= i <= 19): f(b,c,d) = (d xor (b and (c xor d)))
(40 <= i <= 59): f(b,c,d) = (b and c) or (d and (b or c)))
6. 1. The browser sends a set of encryption rules it supports to the website
2. The website selects a group of encryption algorithm and hash algorithm, and sends its identity information back to the browser in the form of certificate. The certificate contains the website address, encrypted public key, and the certificate authority and other information
3. After the browser obtains the website certificate, the browser should do the following work:
A) verify the validity of the certificate (whether the certificate issuing authority is legal, whether the website address contained in the certificate is consistent with the address being visited, etc.). If the certificate is trusted, a small lock will be displayed in the browser bar, otherwise the certificate will not be trusted
b) if the certificate is trusted or the user accepts an untrusted certificate, the browser will generate a string of random number passwords and encrypt them with the public key provided in the certificate
C) use the agreed hash algorithm to calculate the handshake message, use the generated random number to encrypt the message, and finally send all the previously generated information to the website< After receiving the data from the browser, the website should do the following operations:
A) use its own private key to decrypt the information, take out the password, use the password to decrypt the handshake message from the browser, and verify whether the hash is consistent with that from the browser
b) encrypt a handshake message with a password and send it to the browser
5. The browser decrypts and calculates the hash of the handshake message. If the hash is consistent with the hash sent by the server, the handshake process ends, and then all the communication data will be encrypted by the random password generated by the previous browser and the symmetric encryption algorithm.
2. The website selects a group of encryption algorithm and hash algorithm, and sends its identity information back to the browser in the form of certificate. The certificate contains the website address, encrypted public key, and the certificate authority and other information
3. After the browser obtains the website certificate, the browser should do the following work:
A) verify the validity of the certificate (whether the certificate issuing authority is legal, whether the website address contained in the certificate is consistent with the address being visited, etc.). If the certificate is trusted, a small lock will be displayed in the browser bar, otherwise the certificate will not be trusted
b) if the certificate is trusted or the user accepts an untrusted certificate, the browser will generate a string of random number passwords and encrypt them with the public key provided in the certificate
C) use the agreed hash algorithm to calculate the handshake message, use the generated random number to encrypt the message, and finally send all the previously generated information to the website< After receiving the data from the browser, the website should do the following operations:
A) use its own private key to decrypt the information, take out the password, use the password to decrypt the handshake message from the browser, and verify whether the hash is consistent with that from the browser
b) encrypt a handshake message with a password and send it to the browser
5. The browser decrypts and calculates the hash of the handshake message. If the hash is consistent with the hash sent by the server, the handshake process ends, and then all the communication data will be encrypted by the random password generated by the previous browser and the symmetric encryption algorithm.
7. I tell you,
1 enter the city
2 in the top left corner of the map, there is a gymnasium (not the one at work)
3 repair it
4 let the Teenagers come in after entering
5 Click to trigger it
if you don't understand, you can continue to ask
1 enter the city
2 in the top left corner of the map, there is a gymnasium (not the one at work)
3 repair it
4 let the Teenagers come in after entering
5 Click to trigger it
if you don't understand, you can continue to ask
8. 1. The browser sends a set of encryption rules it supports to the website
2. The website selects a group of encryption algorithm and hash algorithm, and sends its identity information back to the browser in the form of certificate. The certificate contains the website address, encrypted public key, and the certificate authority and other information
3. After the browser obtains the website certificate, the browser should do the following work:
A)
verify the validity of the certificate (whether the certificate issuing authority is legal, whether the website address contained in the certificate is consistent with the address being visited, etc.). If the certificate is trusted, a small lock will be displayed in the browser bar, otherwise the certificate will not be trusted
b)
if the certificate is trusted, or if the user accepts an untrusted certificate, the browser will generate a string of random number passwords and encrypt them with the public key provided in the certificate
C)
use the agreed hash algorithm to calculate the handshake message, use the generated random number to encrypt the message, and finally send all the previously generated information to the website< After receiving the data from the browser, the website should do the following operations:
A)
use its own private key to decrypt the information, take out the password, use the password to decrypt the handshake message from the browser, and verify whether the hash is consistent with that from the browser
b)
encrypt a handshake message with password and send it to the browser
5. The browser decrypts and calculates the hash of the handshake message. If it is consistent with the hash sent by the server, the handshake process ends, and then all the communication data will be encrypted by the random password generated by the previous browser and using the symmetric encryption algorithm.
2. The website selects a group of encryption algorithm and hash algorithm, and sends its identity information back to the browser in the form of certificate. The certificate contains the website address, encrypted public key, and the certificate authority and other information
3. After the browser obtains the website certificate, the browser should do the following work:
A)
verify the validity of the certificate (whether the certificate issuing authority is legal, whether the website address contained in the certificate is consistent with the address being visited, etc.). If the certificate is trusted, a small lock will be displayed in the browser bar, otherwise the certificate will not be trusted
b)
if the certificate is trusted, or if the user accepts an untrusted certificate, the browser will generate a string of random number passwords and encrypt them with the public key provided in the certificate
C)
use the agreed hash algorithm to calculate the handshake message, use the generated random number to encrypt the message, and finally send all the previously generated information to the website< After receiving the data from the browser, the website should do the following operations:
A)
use its own private key to decrypt the information, take out the password, use the password to decrypt the handshake message from the browser, and verify whether the hash is consistent with that from the browser
b)
encrypt a handshake message with password and send it to the browser
5. The browser decrypts and calculates the hash of the handshake message. If it is consistent with the hash sent by the server, the handshake process ends, and then all the communication data will be encrypted by the random password generated by the previous browser and using the symmetric encryption algorithm.
9.
Sha is a hash algorithm, not an encryption algorithm. There is no decryption problem
reason:
to decrypt data is to find any source data and generate the same target data
sha256 is basically unbreakable, that is, the "collision" result can not be found (or the probability is very small)
website decryption rules:
the website selects a group of encryption algorithm and hash algorithm from the information sent by the browser, and sends its own identity information back to the browser in the form of certificate. The certificate contains the website address, encrypted public key, and the certificate authority and other information
extended data:
in the process of encryption and decryption, the browser verifies the website:
1. Verify the legitimacy of the certificate (whether the certification authority is legal, whether the website address contained in the certificate is consistent with the address being visited, etc.). If the certificate is trusted, a small lock will be displayed in the browser bar, Otherwise, the certificate will not be trusted
2. If the certificate is trusted or the user accepts the untrusted certificate, the browser will generate a string of random number passwords and encrypt them with the public key provided in the certificate
3. Use the agreed hash algorithm to calculate the handshake message, and use the generated random number to encrypt the message, and finally send all the previously generated information to the website< br />
10. Sha family
Sha (secure hash algorithm) is a series of cryptographic hash functions designed by National Security Agency (NSA) and published by National Institute of standards and Technology (NIST). The first member of the family officially named Sha was published in 1993. However, it has now been given an informal name sha-0 to avoid confusion with its successors. Two years later, SHA-1, the successor of the first Sha, was released. There are also four variants that have been released to enhance the scope of output and to change some minor designs: sha-224, SHA-256, sha-384, and sha-512 (sometimes referred to as SHA-2)<
sha-0 and SHA-1
the algorithm originally specified was released in 1993, which is called secure hash standard, FIPS pub 180. This version is now often called & quot; SHA-0" It was withdrawn by NSA soon after its release, and released in 1995 as a revised version of FIPS pub 180-1 (commonly known as & quot; SHA-1") replace. According to NSA, it fixed an error in the original algorithm that would rece password security. However, NSA does not provide any further explanation or proof that the error has been corrected. In 1998, in an attack on sha-0, it was found that this attack was not applicable to SHA-1 - we don't know if this is the error found by NSA, but it may indicate that this correction has improved the security. SHA-1 has been closely examined by the public password community, but it has not been found to be unsafe. It is now considered safe
sha-0 and SHA-1 will generate a 160 bit digest from a message with a maximum size of 2 ^ 64 bits, and then encrypt it based on the similar principle of Ronald L. Rivest, Professor of MIT who designed MD4 and MD5 message digest algorithms<
Cryptanalysis of sha-0
on crypto 98, two French researchers demonstrated an attack on sha-0 (chabaud and joux, 1998): hash collision can be found when the complexity is 2 ^ 61; Less than 2 ^ 80 is an ideal hash function of the same size
in 2004, Biham and Chen discovered the approximate collision of sha-0 - two messages can hash out the same value; In this case, 142 and 160 bits are the same. They also found that sha-0 dropped to 62 bits after 80 full collisions
on August 12, 2004, joux, carribault, lemuet and jalby announced the hash collision of the complete sha-0 algorithm. This is the result of the attack of chabaud and joux. The collision was found to be 2 ^ 51, and it took about 80000 CPU hours to work on a supercomputer with 256 Itanium 2 processors< On August 17, 2004, Wang, Feng, Lai, and Yu announced the preliminary results of attacking MD5, sha-0, and other hash functions at the rump meeting of crypto 2004. Their attack on sha-0 is as complex as 2 ^ 40, which means that their attack results are better than those of joux and others. A brief summary of the rump meeting can be found here, and their discussions in sci.crypt, for example, suggest that people planning to use SHA-1 as a new cryptosystem need to reconsider
longer variants
NIST has released three additional Sha variants, each with a longer message digest. They are named by adding their summary length (in bits) after their original name: & quot; SHA-256", & quot; SHA-384" And & quot; SHA-512" They were published in the draft of FIPS pub 180-2 in 2001, and then passed the review and comments. FIPS pub 180-2, including SHA-1, was released as an official standard in 2002. These new hash functions have not been tested in detail by the public password community like SHA-1, so their password security is not widely trusted. In February 2004, a change notice of FIPS pub 180-2 was issued, and an additional variant was added; SHA-224"， The key length required for double key 3DES is defined
Gilbert and handschuh (2003) studied new varieties and found no weaknesses<
shad
shad function is a simple restatement of the same Sha function:
shad-256 (m)=
Sha (secure hash algorithm) is a series of cryptographic hash functions designed by National Security Agency (NSA) and published by National Institute of standards and Technology (NIST). The first member of the family officially named Sha was published in 1993. However, it has now been given an informal name sha-0 to avoid confusion with its successors. Two years later, SHA-1, the successor of the first Sha, was released. There are also four variants that have been released to enhance the scope of output and to change some minor designs: sha-224, SHA-256, sha-384, and sha-512 (sometimes referred to as SHA-2)<
sha-0 and SHA-1
the algorithm originally specified was released in 1993, which is called secure hash standard, FIPS pub 180. This version is now often called & quot; SHA-0" It was withdrawn by NSA soon after its release, and released in 1995 as a revised version of FIPS pub 180-1 (commonly known as & quot; SHA-1") replace. According to NSA, it fixed an error in the original algorithm that would rece password security. However, NSA does not provide any further explanation or proof that the error has been corrected. In 1998, in an attack on sha-0, it was found that this attack was not applicable to SHA-1 - we don't know if this is the error found by NSA, but it may indicate that this correction has improved the security. SHA-1 has been closely examined by the public password community, but it has not been found to be unsafe. It is now considered safe
sha-0 and SHA-1 will generate a 160 bit digest from a message with a maximum size of 2 ^ 64 bits, and then encrypt it based on the similar principle of Ronald L. Rivest, Professor of MIT who designed MD4 and MD5 message digest algorithms<
Cryptanalysis of sha-0
on crypto 98, two French researchers demonstrated an attack on sha-0 (chabaud and joux, 1998): hash collision can be found when the complexity is 2 ^ 61; Less than 2 ^ 80 is an ideal hash function of the same size
in 2004, Biham and Chen discovered the approximate collision of sha-0 - two messages can hash out the same value; In this case, 142 and 160 bits are the same. They also found that sha-0 dropped to 62 bits after 80 full collisions
on August 12, 2004, joux, carribault, lemuet and jalby announced the hash collision of the complete sha-0 algorithm. This is the result of the attack of chabaud and joux. The collision was found to be 2 ^ 51, and it took about 80000 CPU hours to work on a supercomputer with 256 Itanium 2 processors< On August 17, 2004, Wang, Feng, Lai, and Yu announced the preliminary results of attacking MD5, sha-0, and other hash functions at the rump meeting of crypto 2004. Their attack on sha-0 is as complex as 2 ^ 40, which means that their attack results are better than those of joux and others. A brief summary of the rump meeting can be found here, and their discussions in sci.crypt, for example, suggest that people planning to use SHA-1 as a new cryptosystem need to reconsider
longer variants
NIST has released three additional Sha variants, each with a longer message digest. They are named by adding their summary length (in bits) after their original name: & quot; SHA-256", & quot; SHA-384" And & quot; SHA-512" They were published in the draft of FIPS pub 180-2 in 2001, and then passed the review and comments. FIPS pub 180-2, including SHA-1, was released as an official standard in 2002. These new hash functions have not been tested in detail by the public password community like SHA-1, so their password security is not widely trusted. In February 2004, a change notice of FIPS pub 180-2 was issued, and an additional variant was added; SHA-224"， The key length required for double key 3DES is defined
Gilbert and handschuh (2003) studied new varieties and found no weaknesses<
shad
shad function is a simple restatement of the same Sha function:
shad-256 (m)=
Hot content