Efficient software implementation of binary field arithmetic using vector instruction sets
From MaRDI portal
Publication:3584980
DOI10.1007/978-3-642-14712-8_9zbMATH Open1285.94040OpenAlexW1506108026MaRDI QIDQ3584980FDOQ3584980
Authors: Diego F. Aranha, Julio López, Darrel Hankerson 
Publication date: 31 August 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14712-8_9
Recommendations
- Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic
- Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication
- Efficient software-implementation of finite fields with applications to cryptography
- High-speed parallel software implementation of the \(\eta_{T}\) pairing
- scientific article; zbMATH DE number 1759279
Cited In (13)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Koblitz curves over quadratic fields
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Faster binary-field multiplication and faster binary-field macs
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
- Parallelizing the Weil and Tate pairings
- The rank-based cryptography library
- Fast three-valued abstract bit-vector arithmetic
- Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication
- Batch binary Weierstrass
- Binary Kummer line
- Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic
- Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)
Uses Software
This page was built for publication: Efficient software implementation of binary field arithmetic using vector instruction sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584980)
