Template:Number-theoretic algorithms
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by CsDix (talk | contribs) at 00:25, 18 March 2013 (exapnding abbreviations to avoid similarity with smallcaps). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 00:25, 18 March 2013 by CsDix (talk | contribs) (exapnding abbreviations to avoid similarity with smallcaps)
| Primality tests | |
|---|---|
| Prime-generating | |
| Integer factorization | |
| Multiplication | |
| Discrete logarithm | |
| Greatest common divisor | |
| Modular square root | |
| Other algorithms | |
| |