Sign into an existing account

I don't intend to. I'm just working out some demonstrations to prove what I'm seeing. I knew two problems I was working on prior were linked to ECC, I just couldn't find the bridge before. Was falling asleep when it came to me completely out of the blue.

All my work so far has been partial or incomplete solutions to various cryptography problems. Basilisk 287 for example is focused on RSA and similar asymmetric key systems, and even in it's unfinished state at minimum allows for putting loose bounds on private keys.

Basilisk 292 was related to congruent series in previously unknown variables in the same systems.

I did some work with linear regression that showed promising results for using the internal derived variables from B287 to predict the initializing variables in B292. Prior to that I was able to prove de-facto through testing that B292 is a sub-polynomial time/complexity solution to retrieving keys from asymmetric encryption systems assuming (and that was a big assumption), you had good starting initializations of certain variables. The only thing thats really held that back at all is flipping between job hunting and working anywhere from between 40-70 hours a week at various jobs (I don't stick around at all if I have to work with fuckabouts or drug addicts, etc), so I haven't had a lot of time to focus and do deep work to attack the problems over the last 12 months.

RSA is likely breakable, and I'll stake my name on that.

ECC looks attackable as well at this time.

I'll share more when it's more than a very good guess and napkin math.