Template:Number-theoretic algorithms
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 179.34.48.190 (talk) at 23:34, 15 March 2015 (Removed trial division since that article is referring to factorization only). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 23:34, 15 March 2015 by 179.34.48.190 (talk) (Removed trial division since that article is referring to factorization only)
| Primality tests | |
|---|---|
| Prime-generating | |
| Integer factorization | |
| Multiplication | |
| Discrete logarithm | |
| Greatest common divisor | |
| Modular square root | |
| Other algorithms | |
| |