michel-leonard / C-Quadratic-SieveLinks
A factorization software using a Quadratic Sieve (SIQS) written in C.
☆36Updated this week
Alternatives and similar repositories for C-Quadratic-Sieve
Users that are interested in C-Quadratic-Sieve are comparing it to the libraries listed below
Sorting:
- nml is a "simple" matrix/numerical analysis library written in pure C. The scope of the library is to highlight various algorithm impleme…☆100Updated last year
- This is the 2009 version of TestU01, a software library, implemented in the ANSI C language, and offering a collection of utilities for t…☆82Updated last year
- A GPU accelerated implementation of the sieve of Eratosthenes☆65Updated 3 years ago
- ☆316Updated 2 months ago
- Imported from svn://scm.gforge.inria.fr/svnroot/ecm/☆29Updated 2 years ago
- 🚀 Sum of the primes below x☆39Updated 3 years ago
- Fast prime factorization in Python☆25Updated 3 years ago
- Source code of calculators hosted at https://www.alpertron.com.ar☆248Updated 3 weeks ago
- A miniature program that can compute Pi to millions of digits.☆149Updated 2 years ago
- Multiple Precision Integers and Rationals☆239Updated last year
- Testing common random-number generators (RNG)☆196Updated 2 weeks ago
- Mathematics library for C and C++☆52Updated last year
- This repository contains efficient implementation of the Miller-Rabin primality test for x86-64☆34Updated 5 years ago
- Parallel C++ algorithms☆66Updated last year
- Lattice algorithms using floating-point arithmetic☆388Updated 2 months ago
- Composing and deciphering C (or C++) declarations or casts, aka ‘‘gibberish.’’☆112Updated this week
- ☆29Updated last week
- A fork of the Practically Random suite of statistical tests & psuedo-random number generators (RNGs, PRNGs)☆27Updated 5 years ago
- A pure C implementation of the Mersenne twister is a pseudo-random number generation algorithm.☆126Updated last year
- Arbitrary precision integer and rational arithmetic library☆151Updated last month
- FELICS Framework☆10Updated 6 years ago
- O(n log n) In-place Stable Quicksort☆20Updated 5 months ago
- bigint is a C++ library which can handle Very very Big Integers. It can calculate factorial of 1000000... it can go any big. It may be us…☆83Updated last year
- A basic implementation of the Small Primes Number-Theoretic Transform (NTT) multiplication algorithm.☆24Updated 8 years ago
- ADAM is an actively developed CSPRNG inspired by ISAAC64☆21Updated 4 months ago
- M4RI is a library for fast arithmetic with dense matrices over GF(2)☆87Updated last month
- C implementation of the SHA-3 and Keccak with Init/Update/Finalize hashing API (NIST FIPS 202/Etherium)☆181Updated last year
- Swing, divide and conquer the factorial!☆81Updated 3 years ago
- SHA-1, SHA-256 and SHA-512 compression functions using Intel, ARMv8 and Power8 SHA intrinsics☆219Updated this week
- Short examples illustrating AVX2 intrinsics for simple tasks.☆98Updated last year