Template:Number-theoretic algorithms
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Frobitz (talk | contribs) at 21:22, 15 October 2015 (Remove integer relation (which is a problem, not an algorithm), added LLL, removed use of smallcaps to distinguish deterministic algorithms -- most of the algorithms listed are deterministic but were not shown in smallcaps.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 21:22, 15 October 2015 by Frobitz (talk | contribs) (Remove integer relation (which is a problem, not an algorithm), added LLL, removed use of smallcaps to distinguish deterministic algorithms -- most of the algorithms listed are deterministic but were not shown in smallcaps.)
| Primality tests | |
|---|---|
| Prime-generating | |
| Integer factorization | |
| Multiplication | |
| Discrete logarithm | |
| Greatest common divisor | |
| Modular square root | |
| Other algorithms | |
| |