MPyC: Multiparty Computation in Python
-
Updated
May 24, 2024 - Python
MPyC: Multiparty Computation in Python
A performant NumPy extension for Galois fields and their applications
Python code to implement various number theory, elliptic curve and finite field computations.
Python code and tests for the post 'Programming with Finite Fields'
p-Adic numbers and finite fields in Python
Elliptic curve tools, ECDSA, and ECDSA attacks.
Error correction codes in python.
Implements a simple Galois Field calculator
💌 BCH codes encoder with Berlekamp-Massey decoder
Pure-Python library for working with modular arithmetic, congruence classes, and finite fields.
Pure-Python implementation of Lagrange interpolation over finite fields.
Implementations of concepts from Berkeley CS 70 - Discrete Math and Probability
A collection of scripts thats been used in University and other occasions 🔑💻
🔑 Cryptographic algorithms
Elliptic Curves in a Finite Field over a prime factor in python
Implementation of finite polynomial rings to support coding schemes like Reed-Solomon and Network Coding
Cryptofield is a library to work with discrete algebraic objects. Useful for research in discrete mathematics and cryptography
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.
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.
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."