I saw it. Did you read my post? Did you grasp the sheer time required?
what part of we have no Supercomputer available today, not even hypothetically quantum computing, that could break a 256bit AES encryption.
The calculation I used when I came up with those numbers was based on the supercomputer capabilities of four years ago or so. . . And then I quadrupled them. . . , then I doubled them again. The times were for supercomputers that weren’t even on the drawing boards yet, and were were still talking about time frames that exceeded by three times the estimated half lives of sub atomic particles! By four and a half times the longest half-life of electrons.
No, Mariner, there are no supercomputers at Apple or the NSA that are working away cracking encryptions in a few weeks. The laws of mathematics don’t allow it. They are still chasing huge primes and trillionth decimals of pi hoping to find an ending. No, there isn’t going to be a magic algorithm that suddenly and simply breaks them by applying a thirteenth dimensional Fourier transformation of the nth iteration of the square root of -1. (Although I once saw a paper that postulated that all data a person could possibly need could be eventually compressed and encrypted down and stored in a single digit number. . . But, of course, it would require a really, really, really huge key!)
all data a person could possibly need could be eventually compressed and encrypted down and stored in a single digit number.
Done - the answer is 43 which reduces to 7 :)