[Back] Within discrete logarithms we use the form of \(h = g^x \pmod p\). The order of \(g\) is then defined as \(p-1\), and which can be factorized into small primes:

## Discrete logs: Order of a prime and factorization into small primes |

## Outline

An example of \(p=3,187\):

p= 3187 h = g^x (mod 3187) The factors of (p-1) are: [2, 3, 3, 3, 59] For factors, [q,e] prime, counts: [[59, 1], [2, 1], [3, 3]]

We can see that \(p-1\) is \(2 \times 3 \times 3 \times 3 \times 59\).