https://github.com/bh2smith/discrete-logarithm

Implementation of the Big-step-little-step algorithm for computing discrete logs
https://github.com/bh2smith/discrete-logarithm

Last synced: 11 months ago
JSON representation

Implementation of the Big-step-little-step algorithm for computing discrete logs

• Host: GitHub
• URL: https://github.com/bh2smith/discrete-logarithm
• Owner: bh2smith
• Created: 2015-05-20T02:54:23.000Z (about 11 years ago)
• Default Branch: master
• Last Pushed: 2018-04-07T09:13:19.000Z (over 8 years ago)
• Last Synced: 2025-06-12T14:05:23.834Z (about 1 year ago)
• Language: Python
• Homepage:
• Size: 5.86 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Discrete-Logarithm

A functioning implementation of the ``Big step, little step'' algorithm for computing discrete logs.

reads from STDIN as follows;

T = number of test cases

followed by T lines of:

a b g = numbers for which we seek to solve a^x = b mod g

Algorithm is functional for 1\leq g \leq 10^10 and operates in under 10 seconds when T \leq 10