![]() ![]() "I lost my job a year ago and since then have been unable to find a steady paying job, I needed a reliable income, I was not interested in the "get rich quick" scams you see all over the internet. Working online has been a big break for Sebastian, who struggled for months going from one dead end job to another. It's more than enough to comfortably replace my old jobs income, especially considering I hardly work at all." "I basically make about $6,000-$8,000 a month online. In our phone interview he told me his amazing story. I read Sebastian's blog last month and decided to feature his story in our job report. He was finally able to make a good salary and at the same time have enough free time to enjoy his life. His long hours of research paid off and he discovered a secret system that would help him get a break in life. One late night while surfing the internet, curiosity got the best of him and he decided to look into making money online. Life seemed merely a succession of bills and worrying about how to pay them. Sebastian Hernandez of Los Angeles, California was tired of worrying all the time where the next pay check would come from. In other words, a 12-word mnemonic would have its security reduced to 64 bits (considered unsafe) in terms of classical computer security, while a 24-word mnemonic would only reduce to 128 bits in the same scenario.Have You Ever Considered Making Money Online? Grover's algorithm could brute-force a 128-bit symmetric cryptographic key in roughly 2^64 iterations or a 256-bit key in roughly 2^128 iterations.` Such a huge leap in security could help protect a user later from Grover's algorithm running on a fast-enough quantum computer which could perform such an n-time brute-force search in the "square of n-time", compared classical computers requiring n-time. raise it to the power of 2), a 24-word mnemonic which represents 264 bits (minus an 8-bit checksum) would be the square of two 12-word mnemonics in terms of bit security as 2^128*2^128 = 2^256. Note: If you wanted to square your security (i.e. ![]() To only search the range of valid ones, unless SHA256 is broken). In order to find one of the 2^128 valid ones (i.e. This means an attacker still needs to search in the range of 2^132.In summary, I think a mnemonic with a valid checksum would be more safe than one without a checksum, on the basis that it's probably less likely for SHA256 to be cracked anytime soon which would otherwise speed a potential brute-force search of all mnemonics. Therefore, while 2048^12 = 2^132, the checksum means that the range.So the idea with the checksum was to slow an attacker from searching through all possible 12-word mnemonics of which there are 2^132 of them, even though the number of valid ones is 2^128 in terms of a valid checksum (as if reducing the strength from 12 words to 11.6363636364 words, since the checksum completes part of the last word), as an attacker would have to run the SHA256 algorithm each time which will slow their brute-force search. Larger than 2^128 (where (2^128)*16 = 2^132), the checksum cannotīe predicted unless an attacker can break SHA256, as the checksum isĬomputed based on the hash digest of the leading 128 bits formatted Even though the range of 2^132 of all possible mnemonics is 16 times.The security in bits of a 12-word mnemonic that has a valid checksum as per BIP39 is not 132 bits, but rather 128 bits, as the last 4 bits are determined based on the first 128 bits - the initial "entropy". ![]()
0 Comments
Leave a Reply. |