Template:Number-theoretic algorithms: Difference between revisions

Revision as of 21:16, 15 October 2015

Revision as of 21:22, 15 October 2015

Line 59:

| group5 = [[Discrete logarithm]]

| list5 =

* {{smallcaps|[[Baby-step giant-step]]}}

* [[Pollard's rho algorithm for logarithms|Pollard rho]]

* [[Pollard's kangaroo algorithm|Pollard kangaroo]]

* {{smallcaps|[[Pohlig–Hellman algorithm|Pohlig–Hellman]]}}

* [[Index calculus algorithm|Index calculus]]

* [[Function field sieve]]

Line 83:

* [[Chakravala method|Chakravala]]

* [[Cornacchia's algorithm|Cornacchia]]

* [[IntegerLenstra–Lenstra–Lovász relationlattice basis reduction algorithm|Integer relationLLL]]

* {{smallcaps|[[Integer square root]]}}

* {{smallcaps|[[Modular exponentiation]]}}

* {{smallcaps|[[Schoof's algorithm|Schoof's]]}}

| belowclass = hlist

| below =

* ''Italics'' indicate that algorithm is for numbers of special forms

* {{smallcaps|Smallcaps}} indicate a [[deterministic algorithm]]

}}<noinclude>