alpertron / calculators

Related projects ⓘ

Alternatives and complementary repositories for calculators

• kimwalisch / primecount
  🚀 Fast prime counting function implementations
  ☆311Updated this week
• bbuhrow / yafu
  Automated integer factorization
  ☆214Updated last week
• radii / msieve
  msieve - Number Field Sieve implementation by Jason Papadopoulos
  ☆222Updated last year
• pwang00 / Cryptographic-Attacks
  Repository containing implementation of attacks on modern public key cryptosystems and symmetric key ciphers.
  ☆118Updated 8 months ago
• kmyk / mersenne-twister-predictor
  Predict MT19937 PRNG, from preceding 624 generated numbers. There is a specialization for the "random" of Python standard library.
  ☆171Updated 3 years ago
• fplll / fplll
  Lattice algorithms using floating-point arithmetic
  ☆323Updated last week
• elliptic-shiho / primefac-fork
  a fork of primefac(https://pypi.python.org/pypi/primefac) module
  ☆79Updated 4 months ago
• DarkenCode / yafu
  Unofficial mirror of yafu. Go to https://github.com/bbuhrow/yafu
  ☆201Updated 2 years ago
• defund / coppersmith
  Coppersmith's method for multivariate polynomials
  ☆156Updated last year
• p4-team / crypto-commons
  Small python module for common CTF crypto functions
  ☆163Updated 2 years ago
• deut-erium / RNGeesus
  SMT based attacks on non cryptographic PRNGs
  ☆77Updated last year
• keeganryan / flatter
  Fast lattice reduction
  ☆170Updated 3 months ago
• TheBlupper / linineq
  Functions for solving linear inequalities in integers
  ☆37Updated 3 weeks ago
• GiacomoPope / Castryck-Decru-SageMath
  A SageMath implementation of the Castryck-Decru Key Recovery attack on SIDH
  ☆122Updated last year
• crocs-muni / cm_factorization
  Complex multiplication based factorization
  ☆35Updated 2 years ago
• baihacker / pe
  A C++ library for solving problems on Project Euler
  ☆37Updated this week
• flintlib / flint
  FLINT (Fast Library for Number Theory)
  ☆445Updated last week
• PeterLuschny / Fast-Factorial-Functions
  Swing, divide and conquer the factorial!
  ☆78Updated 2 years ago
• mimoo / RSA-and-LLL-attacks
  attacking RSA via lattice reductions (LLL)
  ☆773Updated 3 years ago
• radii / ggnfs
  GPL Number Field Sieve implementation
  ☆33Updated 13 years ago
• elliptic-shiho / crypto_misc
  ☆66Updated 4 years ago
• archmageirvine / joeis
  Java implementations of sequences in the OEIS
  ☆58Updated this week
• juliannowakowski / automated-coppersmith
  ☆30Updated last year
• icemonster / symbolic_mersenne_cracker
  Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs
  ☆71Updated 3 years ago
• kimwalisch / primesum
  🚀 Sum of the primes below x
  ☆36Updated 2 years ago
• rkm0959 / Inequality_Solving_with_CVP
  CVP "trick" for CTF challenges
  ☆123Updated last year
• tna0y / Python-random-module-cracker
  Predict python's random module generated values.
  ☆378Updated last year
• orisano / owiener
  A Python3 implementation of the Wiener attack on RSA
  ☆114Updated 5 months ago
• AdamWhiteHat / GNFS
  A complete, proof-of-concept, C# implementation of the General Number Field Sieve algorithm for factoring very large semi-prime numbers. …
  ☆56Updated 3 weeks ago
• mkauers / ore_algebra
  ☆29Updated last month