Abstract: | Public-key cryptosystems base their security on well-known number-theoretic problems, such as factorisation of a given number n . Hence, prime number generation is an absolute requirement. Many prime number generation techniques have been proposed up-to-date, which differ mainly in terms of complexity, certainty and speed. Pocklington's theorem, if implemented, can guarantee the generation of a true prime. The proposed implementation exhibits low complexity at the expense of long execution time. |