Intel’s HERACLES accelerator introduces a new set of fundamental instructions, the Polynomial Instructions Set Architecture (P-ISA) that operates directly on polynomials requiring a completely new programming environment. This open-source project aims at developing the building blocks for a compiler toolchain for HERACLES.

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

A fast program for computing Groebner bases

Library for computing Gröbner Basis in .NET. Includes sample application that checks if a given graph is k-colorable using the API.

This repository contains the code for symbolic calculations of an 32-FFT multiplication in (R[y]/(y^32+1))[w]/(w^32-1)

Core Fields Arithmetics Project