Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT.
-
Updated
Sep 7, 2017 - C++
Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT.
Reusable C++ coding-related code library
Finds an inverse mix column of data using pre-calculated Galois finite field.
Efficient Lagrange interpolator, capable of handling hundreds of thousands of points. Supports Galois fields.
A small library for doing elliptic curve Diffie-Hellman key exchange using binary curves (NOT CONSTANT TIME)
A high-performance C++ library implementing the AES-128 standard for encrypting and decrypting 128-bit data blocks.
Add a description, image, and links to the galois-field topic page so that developers can more easily learn about it.
To associate your repository with the galois-field topic, visit your repo's landing page and select "manage topics."