2DT-GLS: faster and exception-free scalar multiplication in the GLS254 binary curve
From MaRDI portal
Publication:6619837
DOI10.1007/978-3-031-58411-4_3MaRDI QIDQ6619837
Diego F. Aranha, Marius A. Aardal
Publication date: 16 October 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recent progress on the elliptic curve discrete logarithm problem
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Constructive and destructive facets of Weil descent on elliptic curves
- Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors
- Koblitz curves over quadratic fields
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Faster unbalanced private set intersection
- Implementing GCM on ARMv8
- Complete Addition Formulas for Prime Order Elliptic Curves
- Attacking a Binary GLS Elliptic Curve with Magma
- ECC2K-130 on Cell CPUs
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Exponent Recoding and Regular Exponentiation Algorithms
- Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
- Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields
- Four$$\mathbb {Q}$$ on Embedded Devices with Strong Countermeasures Against Side-Channel Attacks
- Public Key Cryptography - PKC 2006
This page was built for publication: 2DT-GLS: faster and exception-free scalar multiplication in the GLS254 binary curve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619837)
