mpFq
From MaRDI portal
Software:21320
swMATH9337MaRDI QIDQ21320FDOQ21320
Author name not available (Why is that?)
Cited In (20)
- Speeding-up verification of digital signatures
- Jacobi Quartic Curves Revisited
- ECM using Edwards curves
- Fast Cryptography in Genus 2
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine
- Exploiting the Power of GPUs for Asymmetric Cryptography
- 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
- Recursive Double-Size Fixed Precision Arithmetic
- Modular SIMD arithmetic in M <scp>athemagix</scp>
- The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
- Polynomial root finding over local rings and application to error correcting codes
- The rank-based cryptography library
- Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets
- Generalised Mersenne numbers revisited
- Faster Implementation of Scalar Multiplication on Koblitz Curves
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
This page was built for software: mpFq
