Skip to content
This repository has been archived by the owner on Mar 24, 2022. It is now read-only.

Latest commit

 

History

History
15 lines (9 loc) · 842 Bytes

README.md

File metadata and controls

15 lines (9 loc) · 842 Bytes
Raw

Pollard Rho Algorithm

Prerequisites:

  1. Discrete Logarithm Problem

Pollard Rho Algorithm can give a unique solution in cases where order of the group, over which the DLP is defined, is a prime number. First, let us define our DLP over the Cyclic Group G = picture having order n.

You can refer to section 3.6.3 of chapter-3 from Handbook of Applied Cryptography to read in detail about Pollard Rho Algorithm

I implemented this algorithm in python here (with appropriate explanation): pollardrho.py

References

  1. Wikipedia- Pollard Rho for DLP
  2. Handbook of Applied Cryptography