n-WN / sagemath-vscode-enhancedLinks
Bringing the power of SageMath to VS Code with this extension that offers specialized syntax highlighting, quick run capabilities, and additional coding tools.
☆48Updated 2 months ago
Alternatives and similar repositories for sagemath-vscode-enhanced
Users that are interested in sagemath-vscode-enhanced are comparing it to the libraries listed below
Sorting:
- 侧信道攻击学习笔记☆31Updated 2 years ago
- Fast lattice reduction using segmentation, multithreading, Seysen reduction and BLAS☆44Updated last month
- ☆16Updated last month
- An implementation of RSA extending Wiener attack☆16Updated 3 years ago
- my ctf chals☆11Updated 5 months ago
- ☆36Updated 2 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆122Updated 11 months ago
- Automated integer factorization☆308Updated this week
- Solving linear systems over GF(2) by manipulating bitvectors☆74Updated 3 weeks ago
- Fast lattice reduction☆225Updated 3 months ago
- ☆16Updated last year
- all of CTF☆40Updated 3 years ago
- ☆22Updated 9 months ago
- Functions for solving linear inequalities in integers☆57Updated 4 months ago
- Revisiting Differential-Linear Attacks via a Boomerang Perspective☆11Updated 3 weeks ago
- 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
- Nonce reuse attacks for AEAD ciphers, especially for the the most commonly used `ChaCha20-Poly1305` and `AES-GCM`.☆22Updated last year
- a better random cracker can predict python random lib number☆30Updated 8 months ago
- ISCTF2022题目备份&WriteUp☆10Updated 3 years ago
- ☆64Updated last month
- Implementation of cryptographic attacks. Mainly reproduction of recent cryptographic papers.☆16Updated last year
- ☆104Updated 7 months ago
- A Sage interface for FGb (Gröbner basis computations)☆39Updated last year
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆40Updated 5 years ago
- ☆35Updated 2 years ago
- 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
- A toolkit for cryptanalysis using lattices.☆134Updated 2 years ago
- 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
- We implement the progressive Improved Progressive BKZ with Lattice Sieving presented in https://eprint.iacr.org/2022/1343, one can call i…☆13Updated 10 months ago
- Code for "Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA"☆15Updated 2 months ago