Pages that link to "Item:Q451123"
From MaRDI portal
The following pages link to Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123):
Displaying 34 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves (Q321311) (← links)
- Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems (Q396609) (← links)
- Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0 (Q411481) (← links)
- The pairing computation on Edwards curves (Q460158) (← links)
- An optimal representation for the trace zero subgroup (Q521853) (← links)
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication (Q744601) (← links)
- Index calculus in the trace zero variety (Q895005) (← links)
- Extending the GLS endomorphism to speed up GHS Weil descent using Magma (Q1979955) (← links)
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 (Q1995209) (← links)
- Revocable hierarchical identity-based authenticated key exchange (Q2104408) (← links)
- Ready-made short basis for GLV+GLS on high degree twisted curves (Q2129735) (← links)
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree (Q2163356) (← links)
- Point compression for the trace zero subgroup over a small degree extension field (Q2340180) (← links)
- Cryptography on twisted Edwards curves over local fields (Q2515455) (← links)
- Efficient point multiplication for elliptic curves over special optimal extension fields (Q2764243) (← links)
- A Multivariate Encryption Scheme with Rainbow (Q2801772) (← links)
- Families of Fast Elliptic Curves from ℚ-curves (Q2867211) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem (Q3383117) (← links)
- Pairing Computation on Edwards Curves with High-Degree Twists (Q3454153) (← links)
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves (Q3627455) (← links)
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine (Q3637151) (← links)
- A New Encoding Algorithm for a Multidimensional Version of the Montgomery Ladder (Q5048986) (← links)
- Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves (Q5055960) (← links)
- Generalised Mersenne numbers revisited (Q5326517) (← links)
- Algorithmic Number Theory (Q5899271) (← links)
- A note on inverted twisted Edwards curve (Q6134026) (← links)
- Efficiently computable complex multiplication of elliptic curves (Q6134027) (← links)
- A new twofold Cornacchia-type algorithm and its applications (Q6167302) (← links)
- Secure and Efficient Pairing at 256-Bit Security Level (Q6487201) (← links)
- On the optimization of Pippenger's bucket method with precomputation (Q6613373) (← links)
- Fast endomorphisms in integer sub-decomposition method on Secp192k1 (Q6618035) (← links)
- Making the identity-based Diffie-Hellman key exchange efficiently revocable (Q6619930) (← links)
