Number theoretic

Pohlig Hellman Algorithm

The Pohlig-Hellman algorithm can be used when the factorization of the group order q is known. When q has small factors, this technique reduces the given discrete logarithm instance to multiple instances of the discrete logarithm problem in groups of smaller order. Solutions to each of the latter can be combined to give the desired solution to the original problem. <read on>

Euclid’s algorithm

The Euclidean Algorithm is a technique for quickly finding the GCD of two integers. It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. <read on>