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
Implementations of concepts from Berkeley CS 70 - Discrete Math and Probability
Cryptofield is a library to work with discrete algebraic objects. Useful for research in discrete mathematics and cryptography
A collection of scripts thats been used in University and other occasions 🔑💻
p-Adic numbers and finite fields in Python
This repository contains SageMath/Python implementations of results of my mathematical research. The programs make use of the Python classes RichExtensionField and RichPolynomial which are useful for working with univariate polynomials over different finite fields and their extensions.
🔑 Cryptographic algorithms
Scripts that compute instances of the Hamming Code and Reed-Solomon codes. Includes classes that represent finite fields, polynomials over finite fields, and matrices over finite fields.
Elliptic Curves in a Finite Field over a prime factor in python
Error correction codes in python.
💌 BCH codes encoder with Berlekamp-Massey decoder
Pure-Python library for working with modular arithmetic, congruence classes, and finite fields.
Implements a simple Galois Field calculator
Elliptic curve tools, ECDSA, and ECDSA attacks.
Pure-Python implementation of Lagrange interpolation over finite fields.
Python code and tests for the post 'Programming with Finite Fields'
A performant NumPy extension for Galois fields and their applications
Python code to implement various number theory, elliptic curve and finite field computations.
MPyC: Multiparty Computation in Python
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."