Batch Binary Edwards
From MaRDI portal
Publication:3183572
DOI10.1007/978-3-642-03356-8_19zbMath1248.94052OpenAlexW2156279885MaRDI 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 curvesvectorizationDiffie-Hellmanscalar multiplicationKaratsubacomplete addition formulasdifferential additionToombinary Edwards curvesbatch throughput
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (12)
Improved Three-Way Split Formulas for Binary Polynomial Multiplication ⋮ High-throughput elliptic curve cryptography using AVX2 vector instructions ⋮ Efficient hardware implementations for elliptic curve cryptography over Curve448 ⋮ Full-Size High-Security ECC Implementation on MSP430 Microcontrollers ⋮ The Karatsuba integer middle product ⋮ Speeding up elliptic curve discrete logarithm computations with point halving ⋮ 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 ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Binary Huff Curves ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity
Uses Software
This page was built for publication: Batch Binary Edwards
