Alternatives and similar repositories for discrete-log

Users that are interested in discrete-log are comparing it to the libraries listed below

• TheBlupper / coppersmith
  ☆22Updated 6 months ago
• ludopulles / BLASter
  Fast lattice reduction using segmentation, multithreading, Seysen reduction and BLAS
  ☆35Updated 2 months ago
• juliannowakowski / automated-coppersmith
  ☆33Updated 2 years ago
• juliannowakowski / lwe_with_hints
  ☆34Updated 2 years ago
• TheBlupper / linineq
  Functions for solving linear inequalities in integers
  ☆55Updated last month
• D33BaT0 / my-ctf-challenges
  my ctf chals
  ☆11Updated 2 months ago
• keeganryan / cuso
  ☆92Updated 4 months ago
• maple3142 / lll_cvp
  ☆54Updated 3 weeks ago
• GiacomoPope / Castryck-Decru-SageMath
  A SageMath implementation of the Castryck-Decru Key Recovery attack on SIDH
  ☆138Updated 2 years ago
• maple3142 / gf2bv
  Solving linear systems over GF(2) by manipulating bitvectors
  ☆55Updated 5 months ago
• hash-hash / My-CTF-Challenges
  ☆13Updated last month
• Breaking-SIDH / direct-attack
  ☆15Updated 2 years ago
• josephsurin / lattice-based-cryptanalysis
  A toolkit for cryptanalysis using lattices.
  ☆128Updated last year
• mwageringel / fgb_sage
  A Sage interface for FGb (Gröbner basis computations)
  ☆38Updated last year
• malb / bdd-predicate
  Solving BDD and uSVP with predicate
  ☆49Updated last year
• xbonnetain / optimization-subset-sum
  Numerical optimization code for classical and quantum subset-sum algorithms
  ☆10Updated 5 years ago
• LearningToSQI / SQISign-SageMath
  ☆44Updated 2 years ago
• kionactf / coppersmith
  Coppersmith method (solving polynomial equation over composite modulus on small bounds)
  ☆114Updated 8 months ago
• keeganryan / flatter
  Fast lattice reduction
  ☆213Updated 3 weeks ago
• deut-erium / auto-cryptanalysis
  Automated cryptanalysis of substitution permutation network cipher
  ☆32Updated last year
• hadipourh / DL
  Revisiting Differential-Linear Attacks via a Boomerang Perspective
  ☆11Updated last month
• y011d4 / factor-from-random-known-bits
  Python's library written in Rust to quickly factor `n = pq` when around >50% bits of `p` and `q` are known which are distributed at rando…
  ☆19Updated 4 years ago
• crocs-muni / cm_factorization
  Complex multiplication based factorization
  ☆38Updated 3 years ago
• vvasseur / isd
  An implementation of Dumer's algorithm for Information Set Decoding.
  ☆14Updated last year
• ranea / CASCADA
  A tool to evaluate the security of cryptographic primitives against distinguishing attacks with bit-vector SMT solvers.
  ☆36Updated 10 months ago
• deut-erium / RNGeesus
  SMT based attacks on non cryptographic PRNGs
  ☆86Updated 2 years ago
• 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
  ☆92Updated 4 years ago
• defund / coppersmith
  Coppersmith's method for multivariate polynomials
  ☆183Updated last year
• hvrr1c4n3 / My-Public-CTF-Challenges
  Repo for collecting part of my public CTF challenges
  ☆41Updated last year
• AZ-0 / Writeups
  Some writeups for some CTFs
  ☆17Updated last year