All the “crypto” currencies and their corresponding wallets were based on a false premise (that was known to be false when all this e-commerce nonsense started. It is all based on the assumption that the product of large primes is “hard” to factor (or mathematical problems isomorphic to that one). Well, hard for Joe Schmo is one thing, hard for the NSA and other governments “three letter” agencies is another.
Since then, numerous mathematical journal papers have appeared (and many censored) showing, e.g. explaining algorithms that can do fast factoring (or “problems isomorphic to that”). In any event, there is no mathematical proof showing the large prime factoring problem is intrinsically hard.
Further, the public/private key encryption methods, are NO HARDER than the product of large primes factoring problem. In the vast majority of cases they are, in fact, much easier. For any public/private key encryption the public is likely to be exposed to one does not actually have to solve for the actual “private key” given a known “public key”. One only has to find ANY “private key” that gives rise to the SAME public key. At that point it doesn’t make any difference, one gains all the access of the “genuine” “private key” holder. For the vast majority of public keys there are a great many “private keys” that will give rise to them, hence the probability of finding one is relatively high and a much easier problem to solve than the factoring one, which is not as “hard” as most people think.
This stuff, back in the late 1970’s and early 1980’s was normally in University Graduate Level Mathematics courses in “Abstract Algebra” and “Number Theory”. It also was frequently covered in Graduate Engineering courses in “Signal Analysis and Communications Systems”.
Digital currencies, wallets, etc. were all a fraud from the get go. Modern cheap powerful computers now allow any mathematically knowledgeable organization or even just a single person to “print” as much of it as they like.
