Pohlig–Hellman algorithm
Algorithm for computing discrete logarithms
In group theory, the Pohlig–Hellman algorithm, sometimes credited as the Silver–Pohlig–Hellman algorithm, is a special-purpose algorithm for computing discrete logarithms in a finite abelian group whose order is a smooth integer. The algorithm was introduced by Roland Silver, but first published by Stephen Pohlig and Martin Hellman, who credit Silver with its earlier independent but unpublished discovery.
Nº Q1755812 ★
Común · Saberes
Pohlig–Hellman algorithm
Algorithm for computing discrete logarithms
In group theory, the Pohlig–Hellman algorithm, sometimes credited as the Silver–Pohlig–Hellman algorithm, is a special-purpose algorithm for computing discrete logarithms in a finite abelian group whose order is a smooth integer. The algorithm was introduced by Roland Silver, but first published by Stephen Pohlig and Martin Hellman, who credit Silver with its earlier independent but unpublished discovery.
Último precio
—
Precio mínimo
—
Mediana 7 d
—
Ventas 30 d
0
Rango 30 d
—
En circulación
0
Cotización
mediana
mín – máx
ventas
Sin ventas en el periodo
Ver tabla
| Fecha | mediana | Mín | Máx | ventas |
|---|
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 group theory, the Pohlig–Hellman algorithm, sometimes credited as the Silver–Pohlig–Hellman algorithm, is a special-purpose algorithm for computing discrete logarithms in a finite abelian group whose order is a smooth integer. The algorithm was introduced by Roland Silver, but first published by Stephen Pohlig and Martin Hellman, who credit Silver with its earlier independent but unpublished discovery. Pohlig and Hellman also list Richard Schroeppel and H. Block as having found the same algorithm, later than Silver, but again without publishing it.
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: David Wong (CC0) ·
Cartas cercanas
-
P
Pollard's kangaroo algorithm
Algorithm for computing the discrete logarithm
Nº Q1911970 ★
Sin ofertas
-
A
Algoritmo de Horner
Nº Q944658 ★★
Sin ofertas
-
FEAL
Block cipher
Nº Q1388053 ★
Sin ofertas
-
Logaritmo decimal
Función matemática
Nº Q966582 ★★★
Sin ofertas
-
Binary GCD algorithm
Algorithm that computes the greatest common divisor of two integers using only arithmetic shifts, comparisons, and subtraction
Nº Q622328 ★
Sin ofertas
-
Algoritmo de Grover
Algoritmo cuántico de búsqueda
Nº Q1028292 ★★
Sin ofertas