P

Pollard's kangaroo algorithm

Algorithm for computing the discrete logarithm

In computational number theory and computational algebra, Pollard's kangaroo algorithm (also Pollard's lambda algorithm, see Naming below) is an algorithm for solving the discrete logarithm problem. The algorithm was introduced in 1978 by the number theorist John M. Pollard, in the same paper as his better-known Pollard's rho algorithm for solving the same problem.

Nº Q1911970 ★

Común · Saberes

Pollard's kangaroo algorithm

Algorithm for computing the discrete logarithm

Texto en inglés

In computational number theory and computational algebra, Pollard's kangaroo algorithm (also Pollard's lambda algorithm, see Naming below) is an algorithm for solving the discrete logarithm problem. The algorithm was introduced in 1978 by the number theorist John M. Pollard, in the same paper as his better-known Pollard's rho algorithm for solving the same problem.

Último precio

—

Precio mínimo

—

Mediana 7 d

—

Ventas 30 d

0

Rango 30 d

—

En circulación

0

Cotización

Ver tabla
Fechamediana MínMáxventas

Historial de ventas

Última venta
—
Media 30 d
—
Mínimo 30 d
—
Máximo 30 d
—
Ventas 7 d
0
Ventas 30 d
0

Aún no hay ventas.

Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.

En Wikipedia

Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.

In computational number theory and computational algebra, Pollard's kangaroo algorithm (also Pollard's lambda algorithm, see Naming below) is an algorithm for solving the discrete logarithm problem. The algorithm was introduced in 1978 by the number theorist John M. Pollard, in the same paper as his better-known Pollard's rho algorithm for solving the same problem. Although Pollard described the application of his algorithm to the discrete logarithm problem in the multiplicative group of units modulo a prime p, it is in fact a generic discrete logarithm algorithm—it will work in any finite cyclic group.

Texto: Wikipedia en inglés, CC BY-SA 4.0. ·

Cartas cercanas

Ver la ficha

Confirmación