alpertron / calculatorsLinks
Source code of calculators hosted at https://www.alpertron.com.ar
☆248Updated last month
Alternatives and similar repositories for calculators
Users that are interested in calculators are comparing it to the libraries listed below
Sorting:
- msieve - Number Field Sieve implementation by Jason Papadopoulos☆261Updated 2 years ago
- Predict MT19937 PRNG, from preceding 624 generated numbers. There is a specialization for the "random" of Python standard library.☆198Updated 5 years ago
- 🚀 Fast prime counting function library☆346Updated last week
- a fork of primefac(https://pypi.python.org/pypi/primefac) module☆88Updated last month
- Lattice algorithms using floating-point arithmetic☆393Updated 3 months ago
- Automated integer factorization☆322Updated last week
- Given at least 624 outputs of a Mersenne Twister PNRG we can restore its internal state.☆47Updated 10 years ago
- SMT based attacks on non cryptographic PRNGs☆91Updated 2 years ago
- Fast lattice reduction☆228Updated 5 months ago
- Complex multiplication based factorization☆40Updated 3 years ago
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆100Updated 4 years ago
- Unofficial mirror of yafu. Go to https://github.com/bbuhrow/yafu☆202Updated 4 years ago
- M4RI is a library for fast arithmetic with dense matrices over GF(2)☆87Updated 2 weeks ago
- A Python interface for https://github.com/fplll/fplll☆159Updated 2 months ago
- A Sage interface for FGb (Gröbner basis computations)☆39Updated last week
- A SageMath implementation of the Castryck-Decru Key Recovery attack on SIDH☆138Updated 2 years ago
- attacking RSA via lattice reductions (LLL)☆830Updated 4 years ago
- Coppersmith's method for multivariate polynomials☆191Updated 2 years ago
- A C++ library for solving problems on Project Euler☆42Updated 3 weeks ago
- Analysis and generation of substitutions☆25Updated 3 months ago
- Repository containing implementation of attacks on modern public key cryptosystems and symmetric key ciphers.☆143Updated last year
- CADO-NFS is a complete implementation in C/C++ of the Number Field Sieve (NFS) algorithm for factoring integers. For official releases, p…☆30Updated 5 years ago
- Implements Coron's simplification of Coppersmith's algorithm☆43Updated 2 years ago
- FLINT (Fast Library for Number Theory)☆559Updated last week
- Infer internal state of Mersenne Twister from truncated output☆77Updated 3 years ago
- GPL Number Field Sieve implementation☆36Updated 14 years ago
- M4GB: Efficient Groebner Basis algorithm☆71Updated 7 years ago
- Python code to implement various number theory, elliptic curve and finite field computations.☆103Updated 4 years ago
- Swing, divide and conquer the factorial!☆81Updated 3 years ago
- Project HashClash - MD5 & SHA-1 cryptanalysis☆910Updated 9 months ago