Ggint. A tool for working with very large numbers and testing if they're prime.

github.com/ggerganov/ggint

Vaya's read on this project

Problem, audience, market, and the verdict — sign in to see it.

Updates

January 2019
  • Add Discrete Logarithm Problem (DLP) example
December 2018
  • Move prime test into common file
  • Fix bug in mod function + faster sieve check
  • Some optimizations:
  • Update README.md
  • Optimizations
  • Print decimal representation
  • Update README.md
  • Move examples to subfolder
  • Initial implementation of Miller-Rabin primality test
  • Wrap-up stuff
  • Add ggint::shbl function
  • Improving safe prime search
  • Basic ggint operations
  • Adding ggint::pow_mod, ggint::shbr functions
  • Adding ggint::rand() and ggint::mod()
  • Initial commit