Batch Binary Edwards
From MaRDI portal
Publication:3183572
DOI10.1007/978-3-642-03356-8_19zbMath1248.94052MaRDI QIDQ3183572
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_19
elliptic curves; vectorization; Diffie-Hellman; scalar multiplication; Karatsuba; complete addition formulas; differential addition; Toom; binary Edwards curves; batch throughput
68W30: Symbolic computation and algebraic computation
94A60: Cryptography
11G20: Curves over finite and local fields
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
The Karatsuba integer middle product, High-throughput elliptic curve cryptography using AVX2 vector instructions, Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors, Fast algorithm of square rooting in some finite fields of odd characteristic, NTRU prime: reducing attack surface at low cost, Speeding up elliptic curve discrete logarithm computations with point halving, Efficient hardware implementations for elliptic curve cryptography over Curve448, On the arithmetic operations over finite fields of characteristic three with low complexity, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, Improved Three-Way Split Formulas for Binary Polynomial Multiplication, Full-Size High-Security ECC Implementation on MSP430 Microcontrollers, Binary Huff Curves
Uses Software
