Here are
59 public repositories
matching this topic...
MPyC for Secure Multiparty Computation in Python
Updated
Jul 13, 2021
Python
blockchain (crypto) tools, libraries & scripts in ruby
Python code to implement various number theory, elliptic curve and finite field computations.
Updated
Jun 3, 2020
Python
Library for Multiprecision Compile-Time and Run-Time Arithmetic (including Modular Arithmetic)
Constant time pairing-based or elliptic curve based cryptography and digital signatures
goff (go finite field) is a unix-like tool that generates fast field arithmetic in Go.
Geometric Algebra Library
LinBox - C++ library for exact, high-performance linear algebra
algebra arithmetic, finite fields, elliptic curves, zero-knowledge
Updated
Oct 23, 2019
Rust
Rings: efficient JVM library for polynomial rings
Python code and tests for the post 'Programming with Finite Fields'
Updated
Jun 9, 2020
Python
Finite field and algebraic extension field arithmetic
Updated
Aug 20, 2021
Haskell
FFLAS-FFPACK - Finite Field Linear Algebra Subroutines / Package
Updated
Jul 15, 2021
Julia
Arithmetic and polynomial operations in finite fields.
Updated
Aug 11, 2021
TypeScript
An elliptic curve library written in Swift 4
Updated
Jun 27, 2019
Swift
Finite field polynomial arithmetic based on fast Fourier transforms
Updated
Nov 15, 2020
Haskell
A performant NumPy extension for Galois fields and their applications
Updated
Sep 3, 2021
Python
A research project on isomorphisms of finite fields
Updated
Jun 15, 2018
Jupyter Notebook
Rust finite field library with fixed size multi-word values
Updated
Apr 13, 2021
Rust
java library providing the implementation of ECDSA and useful algebraic structures such as finite fields
Updated
Feb 17, 2018
Java
Libfinite - a tiny bignum library for arithmetic over (parts of) Z/nZ.
Elliptic curve tools, ECDSA, and ECDSA attacks.
Updated
Oct 29, 2019
Python
A Golang implementation of arithmetic in GF(2^8).
Algobra is a collection of packages that implement finite field arithmetic as well as univariate and bivariate polynomials over finite fields.
An implementation of Rijndael (AES) encryption that builds the operations from the ground up with finite fields and matrix operations.
Latin Squares and Their Applications to Cryptography by N. O. Schmidt
Updated
Dec 31, 2017
Java
256-bit prime field Golang implementation
Improve this page
Add a description, image, and links to the
finite-fields
topic page so that developers can more easily learn about it.
Curate this topic
Add this topic to your repo
To associate your repository with the
finite-fields
topic, visit your repo's landing page and select "manage topics."
Learn more
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session.
You signed out in another tab or window. Reload to refresh your session.
Currently
multiplicative_generatoris a method defined on FFTField. We should instead move this to Field, since all fields have a multiplicative generator, not just FFTField's. (Furthermore, there are contexts where one may not have an FFT-friendly field, but still needs the multiplicative generator for it)This would be a breaking change, that I think would require a change to every curve in