Alternatives and similar repositories for sagemath-vscode-enhanced

Users that are interested in sagemath-vscode-enhanced are comparing it to the libraries listed below

• X3NNY / chipwhisperer-cn
  侧信道攻击学习笔记
  ☆30Updated 2 years ago
• juliannowakowski / automated-coppersmith
  ☆35Updated 2 years ago
• D33BaT0 / my-ctf-challenges
  my ctf chals
  ☆11Updated 3 months ago
• hash-hash / My-CTF-Challenges
  ☆13Updated last month
• ludopulles / BLASter
  Fast lattice reduction using segmentation, multithreading, Seysen reduction and BLAS
  ☆40Updated 3 weeks ago
• maple3142 / gf2bv
  Solving linear systems over GF(2) by manipulating bitvectors
  ☆66Updated 6 months ago
• kionactf / coppersmith
  Coppersmith method (solving polynomial equation over composite modulus on small bounds)
  ☆118Updated 10 months ago
• XDSEC / miniLCTF_2024
  ☆16Updated last year
• tl2cents / AEAD-Nonce-Reuse-Attacks
  Nonce reuse attacks for AEAD ciphers, especially for the the most commonly used `ChaCha20-Poly1305` and `AES-GCM`.
  ☆20Updated 11 months ago
• X3NNY / RSA-extending-wiener-attack
  An implementation of RSA extending Wiener attack
  ☆16Updated 3 years ago
• keeganryan / flatter
  Fast lattice reduction
  ☆218Updated 2 months ago
• mwageringel / fgb_sage
  A Sage interface for FGb (Gröbner basis computations)
  ☆39Updated last year
• juliannowakowski / lwe_with_hints
  ☆34Updated 2 years ago
• tl2cents / Implementation-of-Cryptographic-Attacks
  Implementation of cryptographic attacks. Mainly reproduction of recent cryptographic papers.
  ☆15Updated 10 months ago
• josephsurin / lattice-based-cryptanalysis
  A toolkit for cryptanalysis using lattices.
  ☆132Updated last year
• hadipourh / DL
  Revisiting Differential-Linear Attacks via a Boomerang Perspective
  ☆11Updated 2 months ago
• TheBlupper / coppersmith
  ☆22Updated 7 months ago
• TheBlupper / linineq
  Functions for solving linear inequalities in integers
  ☆56Updated 3 months ago
• maple3142 / lll_cvp
  ☆60Updated 2 months ago
• keeganryan / cuso
  ☆99Updated 6 months ago
• X3NNY / xenny
  all of CTF
  ☆40Updated 3 years ago
• 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
• bbuhrow / yafu
  Automated integer factorization
  ☆296Updated last week
• NonupleBroken / ExtendMT19937Predictor
  Predict and Backtrack MT19937 PRNG by putting 32 * 624 bits generated numbers. Python "random" standard library uses mt19937, so we can …
  ☆40Updated 2 years ago
• Breaking-SIDH / direct-attack
  ☆15Updated 2 years ago
• fffmath / MSBsOfPrivateKeyAttack
  Code for "Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA"
  ☆15Updated 3 weeks ago
• ISCTF / ISCTF2022
  ISCTF2022题目备份&WriteUp
  ☆10Updated 2 years ago
• JuliaPoo / MT19937-Symbolic-Execution-and-Solver
  Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices
  ☆41Updated 5 years ago
• sliedes / xor_factor
  Given p xor q and n=p*q for two unknown primes p and q, factor n and output p and q.
  ☆22Updated 8 years ago
• AyushSingh-c / Cryptohack
  Solution of some challenges on Cryptohack
  ☆13Updated last year