Solutions to https://cryptopals.com problems
-
Updated
Dec 16, 2023 - Java
Solutions to https://cryptopals.com problems
Comprehensive univariate polynomial class. All arithmetic performed symbolically. Some advanced features include: Arithmetic of polynomial rings over a finite field, the Tonelli-Shanks algorithm, GCD, exponentiation by squaring, irreducibility checking, modular arithmetic (obviously) and polynomials from roots.
CAS, Commutative Rings, Fraction Fields, Quotient Rings, Polynomial Rings, Galois Fields
Library for computing Gröbner Basis in .NET. Includes sample application that checks if a given graph is k-colorable using the API.
Core Fields Arithmetics Project
This repository contains the code for symbolic calculations of an 32-FFT multiplication in (R[y]/(y^32+1))[w]/(w^32-1)
Add a description, image, and links to the polynomial-rings topic page so that developers can more easily learn about it.
To associate your repository with the polynomial-rings topic, visit your repo's landing page and select "manage topics."