Hey, reviving old topic...I know. The value in this is that someone like me that's creating a table of key pairs that are sorted by public address, with enough, can derive patterns of offset that the private keys are, assuming they wrap around.
On the subject of RSA's:
To encrypt a number you multiply it by itself pub times, making sure to wrap around when you hit the maximum. To decrypt a message, you multiply it by itself priv times and you get back to the original number. It sounds surprising, but it actually works. This property was a big breakthrough when it was discovered.
Source:
https://blog.cloudflare.com/a-relatively-easy-to-understand-primer-on-elliptic-curve-cryptography/ Eventually there will be a breakthrough when it comes to priv, pub keypairs with bitcoin. This idea can be used as a bitcoin recovery business for what was once forever lost bitcoins. This will also mean bitcoin will be broken unless it adapts. I for one would love to create this recovery service for the bitcoin community. If I get close to the breakthrough, I'll be sure to quitly tell whichever devs are working on the main bitcoin development. What good would it be to crash the price of bitcoin to nothing and hold all the coins, but there's value in being the first to make it to recover any current lost coins to re-enter into circulation (a recovery miner), and any new wallets of course would be migrated into newer wallet formats as long as the owner is still alive, thus revealing lost coins.
This is mathematically nonsense. EC is NOT RSA. The concept is faulty since EC point addition does not work in this way.