Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
From MaRDI portal
Publication:436584
DOI10.1016/j.ipl.2012.03.012zbMath1243.68330OpenAlexW2057926105MaRDI QIDQ436584
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.012
cryptography\(\mathrm{GF}(2)[x\) multiplication]AVXKaratsuba algorithmPCLMULQDQSSE
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- Space- and time-efficient polynomial multiplication
- Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication
- Five, six, and seven-term Karatsuba-like formulae
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
- Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
- Faster Multiplication in GF(2)[x]
This page was built for publication: Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication