What application, if any, does this have to say, RSA decryption?
If I understand correctly, RSA is a polynomial based algorithm.
And this is used to quickly factor and solve quadratic formulas, which are second order polynomials.
But I'm not informed enough to take the thought any further than that. Anyone familiar with the topic?
What application, if any, does this have to say, RSA decryption?
If I understand correctly, RSA is a polynomial based algorithm.
And this is used to quickly factor and solve quadratic formulas, which are second order polynomials.
But I'm not informed enough to take the thought any further than that. Anyone familiar with the topic?
I just looked this up on Wonkipedia and it says they use functions in the form: φ(n) = (p − 1)(q − 1). This would explain why the algorithms are useful for second order computations. That's my best guess on the surface anyway, as I've not looked into much of this stuff.
I just looked this up on Wonkipedia and it says they use functions in the form: φ(n) = (p − 1)(q − 1). This would explain why the algorithms are useful for second order computations. That's my best guess on the surface anyway, as I've not looked into much of this stuff.
(post is archived)