Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication
From MaRDI portal
Publication:436584
\(\mathrm{GF}(2)[x\) multiplication]AVXcryptographyKaratsuba algorithmPCLMULQDQSSE
Recommendations
- Implementing fast carryless multiplication
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- scientific article; zbMATH DE number 1583946
- Efficient software implementation of binary field arithmetic using vector instruction sets
- scientific article; zbMATH DE number 2080690
Cites work
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- Faster Multiplication in GF(2)[x]
- Five, six, and seven-term Karatsuba-like formulae
- scientific article; zbMATH DE number 1583946 (Why is no real title available?)
- scientific article; zbMATH DE number 3709576 (Why is no real title available?)
- scientific article; zbMATH DE number 2043312 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
- Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication
- Space- and time-efficient polynomial multiplication
Cited in
(2)
This page was built for publication: Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436584)