A performant NumPy extension for Galois fields and their applications
-
Updated
Sep 6, 2024 - Python
A performant NumPy extension for Galois fields and their applications
Cryptography project carried out at the UTT for the GS15 course in fall 2020 (A20).
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.
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.
University group project done by Peter Farah and Anthony Saab(Me) for the EECE455 course at the American University of Beirut. (Fall 2021-2022)
Add a description, image, and links to the galois-fields topic page so that developers can more easily learn about it.
To associate your repository with the galois-fields topic, visit your repo's landing page and select "manage topics."