Rings: efficient JVM library for polynomial rings
-
Updated
Oct 26, 2023 - Java
Rings: efficient JVM library for polynomial rings
java library providing the implementation of ECDSA and useful algebraic structures such as finite fields
Latin Squares and Their Applications to Cryptography by N. O. Schmidt
A web application applying Shamir's Secret Sharing for text, image and zip files sharing and recovery
Code for arithmetic with polynomials mod p and within finite fields. The code deals with various objects, such as integers modulo a number, elements in a finite field, and with arithmetic in 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."