I wrote a system that can give relatively tight upper and lower bounds on private keys in RSA but thats as far as I've got, along with some theoretical work in ECC.
I also demoed an ultra bare-bones linear regression model that used a subset of known variables from this system to give even better estimates, sort of proof-of-concept. That worked. Gave estimates for hidden variables to within ~98%
Now I'm building a full ML model to train on the data to do it properly because some of the algorithms and equations are convergent, so having good estimates lets me obtain better estimates that essentially convert them to functions and then memoize the equations in question.
I have one that is constant time but thats a huge stretch to get working for a variety of reasons, one thats O(n log n) time, and another thats subpolynomial. All of them require either knowing a hidden variable, having a good approximation of one, or knowing certain initialization values for free parameters.
This is what the ML model is supposed to help me sort out: What combination of known variables are most predictive of the hidden variables, which is critical because the base model has on the order of 1500 known or public variables in the naive case, derived only from the public key and the root of the key. With certain transformations of those variables, the count goes way higher, into the low tens of thousands, each with their own properties, algebriac relations, and ability to predict the upper or lower bounds of variables from the unknown set.
That, combine with a few dozen congruent equations (still waiting on sufficiently precise aproximators), all scattered through four+ years of research entries and logs, means its a lot to sort out, parse, and make sense of.
I'm confident that either the new model will do exactly what I intend it to do based on the proof of concept's performance, or I'll tear it out and go to a standard regressor model, though I'm avoiding that because numpy and everything built on it is a raging dumpster fire of convoluted garbage and I rather roll my own.
The plan is not to do anything myself. The plan hinges on the pure lawfulness of releasing something to the public that 1. anyone can use for any purpose, 2. anyone will use.
[ - ] x0x7 1 point 6 monthsOct 22, 2024 09:21:01 ago (+1/-0)
Of course the government desperately wants RSA hacked because then they get everyone to adopt the elliptic curve parameters they get to advise on. I guess they already get that to an extent.
[ - ] prototype 1 point 6 monthsOct 22, 2024 14:39:34 ago (+1/-0)
Anything that relies on public/private key pairs.
The exception is systems built on chinese remainder theorem, but theres some non-trivial bridging work I've done between that and elliptic curves, all theoretical at this time because I'm focused on RSA.
OP has good ideas. Go for it @prototype. I wish I was smart enough to code like that. As soon as someone crashes this mother fucker life can go back to normal, we can wipe the kikes out once and for all, deport/deal with undesirables, race traitors, etc. and get rid of non whites.
[ + ] oyveyo
[ - ] oyveyo 9 points 6 monthsOct 22, 2024 01:24:36 ago (+9/-0)
[ + ] prototype
[ - ] prototype 9 points 6 monthsOct 22, 2024 01:10:54 ago (+9/-0)
I also demoed an ultra bare-bones linear regression model that used a subset of known variables from this system to give even better estimates, sort of proof-of-concept. That worked. Gave estimates for hidden variables to within ~98%
Now I'm building a full ML model to train on the data to do it properly because some of the algorithms and equations are convergent, so having good estimates lets me obtain better estimates that essentially convert them to functions and then memoize the equations in question.
I have one that is constant time but thats a huge stretch to get working for a variety of reasons, one thats O(n log n) time, and another thats subpolynomial. All of them require either knowing a hidden variable, having a good approximation of one, or knowing certain initialization values for free parameters.
This is what the ML model is supposed to help me sort out: What combination of known variables are most predictive of the hidden variables, which is critical because the base model has on the order of 1500 known or public variables in the naive case, derived only from the public key and the root of the key. With certain transformations of those variables, the count goes way higher, into the low tens of thousands, each with their own properties, algebriac relations, and ability to predict the upper or lower bounds of variables from the unknown set.
That, combine with a few dozen congruent equations (still waiting on sufficiently precise aproximators), all scattered through four+ years of research entries and logs, means its a lot to sort out, parse, and make sense of.
I'm confident that either the new model will do exactly what I intend it to do based on the proof of concept's performance, or I'll tear it out and go to a standard regressor model, though I'm avoiding that because numpy and everything built on it is a raging dumpster fire of convoluted garbage and I rather roll my own.
The plan is not to do anything myself. The plan hinges on the pure lawfulness of releasing something to the public that 1. anyone can use for any purpose, 2. anyone will use.
And that anyone could be anyone, and everyone.
Human nature will do the rest.
We're going back to 0 A.D. baby.
[ + ] Crackinjokes
[ - ] Crackinjokes 4 points 6 monthsOct 22, 2024 03:11:55 ago (+4/-0)
Keep going
[ + ] prototype
[ - ] prototype 0 points 6 monthsOct 22, 2024 14:40:15 ago (+0/-0)
medium rare but getting there.
[ + ] Deleted
[ - ] deleted 0 points 6 monthsOct 22, 2024 01:23:35 ago (+0/-0)
[ + ] MaryXmas
[ - ] MaryXmas [op] 0 points 6 monthsOct 22, 2024 15:57:28 ago (+0/-0)
[ + ] glooper
[ - ] glooper 1 point 6 monthsOct 22, 2024 11:34:39 ago (+1/-0)*
Take that for what you will...
[ + ] prototype
[ - ] prototype 0 points 6 monthsOct 22, 2024 13:31:39 ago (+0/-0)
[ + ] MaryXmas
[ - ] MaryXmas [op] 0 points 6 monthsOct 22, 2024 16:41:17 ago (+0/-0)
[ + ] x0x7
[ - ] x0x7 1 point 6 monthsOct 22, 2024 09:21:01 ago (+1/-0)
[ + ] prototype
[ - ] prototype 0 points 6 monthsOct 22, 2024 13:32:21 ago (+0/-0)
[ + ] RMGoetbbels
[ - ] RMGoetbbels 1 point 6 monthsOct 22, 2024 05:16:39 ago (+1/-0)
[ + ] mannerbund
[ - ] mannerbund 1 point 6 monthsOct 22, 2024 00:35:41 ago (+1/-0)
[ + ] prototype
[ - ] prototype 1 point 6 monthsOct 22, 2024 14:39:34 ago (+1/-0)
The exception is systems built on chinese remainder theorem, but theres some non-trivial bridging work I've done between that and elliptic curves, all theoretical at this time because I'm focused on RSA.
[ + ] RobertJHarsh
[ - ] RobertJHarsh 0 points 6 monthsOct 22, 2024 08:11:30 ago (+0/-0)
[ + ] AlexanderMorose13
[ - ] AlexanderMorose13 0 points 6 monthsOct 22, 2024 05:41:14 ago (+0/-0)