swMATH9337MaRDI QIDQ21320FDOQ21320
Author name not available (Why is that?)
Official website: https://gforge.inria.fr/projects/mpfq/
Cited In (35)
- Speeding-up verification of digital signatures
- Jacobi Quartic Curves Revisited
- ECM using Edwards curves
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine
- Exploiting the Power of GPUs for Asymmetric Cryptography
- Efficient software implementation of binary field arithmetic using vector instruction sets
- Fast cryptography in genus 2
- Fast cryptography in genus 2
- Code Generation for Polynomial Multiplication
- Genus 2 point counting over prime fields
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
- Polynomial root finding over local rings and application to error correcting codes
- Faster implementation of scalar multiplication on Koblitz curves
- The rank-based cryptography library
- MIRACL
- ECPP
- eBASH
- qhasm
- eBACS
- gf2x
- RELIC
- OpenSSL
- eBATS
- SECCURE
- Echidna
- GAUT
- Curve25519
- RecInt
- Generalised Mersenne numbers revisited
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- BearSSL
- Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
- Modular SIMD arithmetic in \textsc{Mathemagix}
- Recursive double-size fixed precision arithmetic
This page was built for software: mpFq
