Re: RSA decryption exponent d (c++)
You can calculate d = e^-1 (mod phi(n)) using the Extended Euclidean
Algorithm.
If you google for it, you find plenty of info about it.
For example, start on www.Wikipedia.com
Kind regards
.
Relevant Pages
- Google wins rights to Aussie algorithm
... Google has snapped up the rights to an advanced text search algorithm ... UNSW PhD student Ori Allon at the university's School of Computer Science. ... Mr Stead said the move was not a secondment; ...
(alt.internet.search-engines) - Re: JSH: Authority from Google search results?
... question of why some of my own amateur research like on my math blog ... Google doesn't have any magical instrument that can measure what's ... code your algorithm. ... code a random problem generator that produces problems in ...
(comp.theory) - Re: Google wins rights to Aussie algorithm
... Google has snapped up the rights to an advanced text search algorithm ... The algorithm, or search engine tool, is called Orion and was developed by ...
(alt.internet.search-engines) - Re: Toward a Forth thats easier to learn
... written in Forth, the algorithm would probably change faster, and ... Googlespam is abuse of the Google search algorithm. ... Let's say I'm a Google developer and annoyed by Cancer on eBay ...
(comp.lang.forth) - Re: JSH: Increasingly the worlds math reference
... what comes up highly in Google. ... binary quadratic Diophantine equations ... this is still an elliptical equation. ... Cyclically applying the algorithm ...
(sci.physics) |
|
