In computational number theory, the index calculus algorithm is a probabilistic algorithm for computing discrete logarithms. Dedicated to the discrete...

sieve Index calculus algorithm Number field sieve Pohlig–Hellman algorithm Pollard's rho algorithm for logarithms Pollard's kangaroo algorithm (aka Pollard's...

algorithm, see the index calculus algorithm. The algorithm is well known by two names. The first is "Pollard's kangaroo algorithm". This name is a reference...

Baby-step giant-step Index calculus algorithm Pohlig–Hellman algorithm Pollard's rho algorithm for logarithms Euclidean algorithm: computes the greatest...

to the sieving step in other sieving algorithms such as the Number Field Sieve or the index calculus algorithm. Instead of numbers one sieves through...

Multi-index notation is a mathematical notation that simplifies formulas used in multivariable calculus, partial differential equations and the theory...

between these algorithms is essentially the methods used to generate (x, y) candidates. Factor bases are also used in the Index calculus algorithm for computing...

Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor...

{\textstyle {\frac {n}{p}}\leq 4} usually suffices. The index calculus algorithm is another algorithm that can be used to solve DLP under some circumstances...

of computing an integral, is one of the two fundamental operations of calculus, the other being differentiation. Integration was initially used to solve...

while the tensor index notation is preferred in physics. Two competing notational conventions split the field of matrix calculus into two separate groups...

In mathematical logic, the lambda calculus (also written as λ-calculus) is a formal system for expressing computation based on function abstraction and...

processes uses mathematical knowledge and techniques from probability, calculus, linear algebra, set theory, and topology as well as branches of mathematical...

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers...

The calculus of variations (or variational calculus) is a field of mathematical analysis that uses variations, which are small changes in functions and...

The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It is a...

matrix representation adversary algorithm algorithm BSTW algorithm FGK algorithmic efficiency algorithmically solvable algorithm V all pairs shortest path alphabet...

A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random...

Pollard's rho algorithm is an algorithm for integer factorization. It was invented by John Pollard in 1975. It uses only a small amount of space, and...

implemented Plankalkül on any of his Z-series machines. Kalkül (from Latin calculus) is the German term for a formal system—as in Hilbert-Kalkül, the original...

Fractional calculus is a branch of mathematical analysis that studies the several different possibilities of defining real number powers or complex number...

In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking...

The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor...

multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient...

computer programs that will solve Sudoku puzzles using a backtracking algorithm, which is a type of brute force search. Backtracking is a depth-first...

than 550 CPU-hours. This computation was performed using the same index calculus algorithm as in the recent computation in the field with 24080 elements....

called infinitesimal calculus or "the calculus of infinitesimals", it has two major branches, differential calculus and integral calculus. The former concerns...

differential refers to several related notions derived from the early days of calculus, put on a rigorous footing, such as infinitesimal differences and the derivatives...

The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers, published by Arnold Schönhage and Volker Strassen...

efficient non-quantum integer factorization algorithm is known. However, it has not been proven that such an algorithm does not exist. The presumed difficulty...