alpertron / calculatorsLinks
Source code of calculators hosted at https://www.alpertron.com.ar
☆246Updated 2 months ago
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☆252Updated 2 years ago
- Lattice algorithms using floating-point arithmetic☆380Updated 2 weeks ago
- 🚀 Fast prime counting function library☆339Updated this week
- a fork of primefac(https://pypi.python.org/pypi/primefac) module☆88Updated last year
- A Python interface for https://github.com/fplll/fplll☆155Updated 5 months ago
- Given at least 624 outputs of a Mersenne Twister PNRG we can restore its internal state.☆47Updated 10 years ago
- Fast lattice reduction☆216Updated 2 months ago
- Complex multiplication based factorization☆40Updated 3 years ago
- Predict MT19937 PRNG, from preceding 624 generated numbers. There is a specialization for the "random" of Python standard library.☆192Updated 4 years ago
- FLINT (Fast Library for Number Theory)☆534Updated last week
- attacking RSA via lattice reductions (LLL)☆819Updated 4 years ago
- Automated integer factorization☆296Updated last week
- A Sage interface for FGb (Gröbner basis computations)☆39Updated last year
- Repository containing implementation of attacks on modern public key cryptosystems and symmetric key ciphers.☆139Updated last year
- Coppersmith's method for multivariate polynomials☆186Updated 2 years ago
- M4RI is a library for fast arithmetic with dense matrices over GF(2)☆79Updated 2 weeks ago
- Unofficial mirror of yafu. Go to https://github.com/bbuhrow/yafu☆201Updated 3 years ago
- SMT based attacks on non cryptographic PRNGs☆87Updated 2 years ago
- A SageMath implementation of the Castryck-Decru Key Recovery attack on SIDH☆138Updated 2 years ago
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆95Updated 4 years ago
- Library for Polynomial System Solving through Algebraic Methods☆163Updated 3 weeks ago
- GPL Number Field Sieve implementation☆36Updated 14 years ago
- M4GB: Efficient Groebner Basis algorithm☆68Updated 6 years ago
- The General Sieve Kernel☆125Updated 3 months ago
- ☆60Updated 2 months ago
- Project HashClash - MD5 & SHA-1 cryptanalysis☆889Updated 5 months ago
- ☆99Updated 6 months ago
- An easy to use tool for cryptanalysis of symmetric primitives based on SMT/SAT solvers.☆98Updated 2 years ago
- CADO-NFS is a complete implementation in C/C++ of the Number Field Sieve (NFS) algorithm for factoring integers. For official releases, p…☆28Updated 5 years ago
- 🚀 Fast prime number generator☆1,036Updated last month