Alternatives and similar repositories for TestU01-2009

Users that are interested in TestU01-2009 are comparing it to the libraries listed below

• less-sig / LESS
  Repository for the current status of the LESS submission
  ☆12Updated 2 weeks ago
• linbox-team / givaro
  Givaro - C++ library for arithmetic and algebraic computations
  ☆53Updated 2 months ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆191Updated 2 years ago
• metalibm / metalibm
  Code generation tool to generate mathematical libraries
  ☆58Updated last month
• slothy-optimizer / slothy
  Assembly super-optimization via constraint solving
  ☆225Updated last week
• linbox-team / linbox
  LinBox - C++ library for exact, high-performance linear algebra
  ☆97Updated last month
• arpra-project / arpra
  Arpra is a C library for analyzing the propagation of numerical error in arbitrary precision IEEE-754 floating-point computations.
  ☆25Updated 3 years ago
• cr-marcstevens / m4gb
  M4GB: Efficient Groebner Basis algorithm
  ☆71Updated 7 years ago
• flintlib / antic
  Antic has been merged into FLINT -- use https://github.com/flintlib/flint/ instead
  ☆62Updated 2 years ago
• kimwalisch / primesum
  🚀 Sum of the primes below x
  ☆39Updated 3 years ago
• passagemath / upstream-LiDIA
  LiDIA --- A library for computational number theory, developed 1994-2004 by Johannes Buchmann's group at TU Darmstadt, relicensed to GPL …
  ☆30Updated 6 months ago
• taschini / crlibm
  A mirror of the CRLibm project from INRIA Forge
  ☆49Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• usubalang / usuba
  A programming language to write bitsliced ciphers
  ☆58Updated last year
• Mysticial / ProtoNTT
  A basic implementation of the Small Primes Number-Theoretic Transform (NTT) multiplication algorithm.
  ☆24Updated 8 years ago
• nehmeier / libieeep1788
  C++ implementation of the preliminary IEEE P1788 standard for interval arithmetic
  ☆49Updated 10 years ago
• vegard / sha1-sat
  SAT instance generator for SHA-1
  ☆49Updated 4 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆117Updated 2 months ago
• seehuhn / dieharder
  A modified version of Robert G. Brown's "dieharder" tests for random number generators.
  ☆56Updated 5 years ago
• nicolasprevot / GpuShareSat
  Source code for GpuShareSat, a library for SAT solvers to use the GPU for clause sharing between CPU threads.
  ☆34Updated 4 years ago
• fplll / fplll
  Lattice algorithms using floating-point arithmetic
  ☆382Updated last month
• vscrypto / ringlwe
  A Practical Ring Learning With Errors (RingLWE) Implementation containing New Hope and Peikert reconciliation for Prime and Power-of-2 ca…
  ☆37Updated 7 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 7 years ago
• drepper / optmark
  Markup source code showing optimizations
  ☆36Updated 5 years ago
• Fourmilab / ent_random_sequence_tester
  Utility for testing random and pseudorandom sequences, either as bytes or bit streams, reporting entropy, mean value, serial correlation,…
  ☆106Updated last year
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆61Updated 6 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• libntl / ntl
  ☆314Updated 3 weeks ago
• cryptolu / FELICS
  FELICS Framework
  ☆10Updated 5 years ago
• flintlib / flint
  FLINT (Fast Library for Number Theory)
  ☆539Updated last week