The following pages link to Selected Areas in Cryptography (Q5713972):
Displayed 12 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- Some techniques for faster scalar multiplication on GLS curves (Q888957) (← links)
- Counting points of the curve \(y^2=x^{12}+a\) over a finite field (Q946983) (← links)
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields (Q1949237) (← links)
- Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) (Q1994975) (← links)
- Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems (Q2243220) (← links)
- Constructing pairing-friendly hyperelliptic curves using Weil restriction (Q2430992) (← links)
- A generic approach to searching for Jacobians (Q3055104) (← links)
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax (Q3600501) (← links)
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms (Q3600509) (← links)
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields (Q3627456) (← links)
- Hasse–Witt and Cartier–Manin matrices: A warning and a request (Q5236835) (← links)