A performant NumPy extension for Galois fields and their applications

Solutions to https://cryptopals.com problems

Cryptography project carried out at the UTT for the GS15 course in fall 2020 (A20).

Lightweight C implementations of short error correcting codes including Reed Solomon over GF(8) and GF(16)

A C++ library for polynomial operations and Galois field calculations.

The Zmodn package provides a class for representing integers modulo a given prime number. This class can be used to applications such as cryptography and computer algebra.

A small library for doing elliptic curve Diffie-Hellman key exchange using binary curves (NOT CONSTANT TIME)

University group project done by Peter Farah and Anthony Saab(Me) for the EECE455 course at the American University of Beirut. (Fall 2021-2022)

C library that provides a set of operations for elements of Galois field.

A stupid implementation of non-prime fields GF(p^n) with prime p and n>1

Python classes which allow for finite field arithmetic as well as matrix manipulation within this system.

This project is about Galois fields, what properties they have and how they can be used in cryptography.

Header-only library for error control coding (ECC) simulations and experiments. Can deal with arbitrary finite fields and complex field relationships, based on compile-time or runtime LUTs. Provides data structures and algorithms for matrices, vectors, and polynomials.