-
As part of his Ph.D. thesis, Malcolm Kotok implemented a function to compute zeta functions of nondegenerate hypersurfaces over finite fields, based on a paper of Sperber and Voight. We wish to inco…
-
Polynomial rings over finite fields have a method `polynomials`
to return a generator of polynomials of given degree or of given maximal degree.
We add an option `monic` (defaulting to `False`)
so …
-
### Describe the project you are working on
A 2D physics-based puzzle platformer
### Describe the problem or limitation you are having in your project
I constantly run into issues when changi…
-
`hmatrix` is the Haskell de-facto standard for matrix operations over real and complex numbers in Haskell. Some applications are requiring matrices over arbitrary fields; specifically over finite fiel…
-
-
# R1CS and QAP (zkSNARKs) : From Zero to Hero with Finite Fields & sagemath – Risen Crypto – Mathematical Cryptography
[https://risencrypto.github.io/R1CSQAP/](https://risencrypto.github.io/…
-
The use of Continuous Galerkin mathematics is currently necessary to ensure fluxes remain well defined. However, this is only a mathematical convenience internal to the ice dynamics part of nextSIM-DG…
-
Given an ordinary elliptic curve over a finite field, its endomorphism ring is an order in an imaginary quadratic field, which contains the order generated by the Frobenius (as computed by `frobeniu…
-
A lot of Haskell libraries exist for prime fields; there are no good and clean ones for field extensions - the missing construction to fully have a proper finite-field library.
It seems the `finite…
-
Adding a method which converts a linear function over a finite field in the form of a matrix into a polynomial over that finite field.
This method uses dual bases to perform this calculation in mill…