Implementation of finite polynomial rings to support coding schemes like Reed-Solomon and Network Coding
-
Updated
May 8, 2019 - Python
Implementation of finite polynomial rings to support coding schemes like Reed-Solomon and Network Coding
Blazingly slow finite fields library
A program for computing differential properties such as uniformity of certain functions over finite fields of characteristic two.
LaTeX notes for the undergraduate Finite Fields course at University of Trento
My habilitation thesis
An ECC based application using Linux
Implementations of concepts from Berkeley CS 70 - Discrete Math and Probability
Discrete Fourier transform in positive characteristic for cyclic group and symmetric group.
256-bit prime field Golang implementation
Cryptofield is a library to work with discrete algebraic objects. Useful for research in discrete mathematics and cryptography
Finite Field and Accelerating Computation on 254-bit Prime Field
A Golang implementation of arithmetic in GF(2^8).
A collection of scripts thats been used in University and other occasions 🔑💻
GPU functionality to the chol function using MAGMA
Code for arithmetic with polynomials mod p and within finite fields. The code deals with various objects, such as integers modulo a number, elements in a finite field, and with arithmetic in finite fields.
A code that check the solutions for elliptic curves over large prime fields
💽 Galois Field Arithmetic Unit Capstone Project
Add a description, image, and links to the finite-fields topic page so that developers can more easily learn about it.
To associate your repository with the finite-fields topic, visit your repo's landing page and select "manage topics."