Implementing fast carryless multiplication
From MaRDI portal
Recommendations
- Faster Multiplication in GF(2)[x]
- Implementing the multiplication of polynomial matrices over the field GF(2) by means of the fast Fourier transform
- scientific article; zbMATH DE number 1583946
- Fast polynomial multiplication over \(\mathbb{F}_{2^{60}}\)
- Fast multiplication of polynomials over fields of characteristic 2
Cited in
(16)- Fast on-line integer multiplication
- Improved method for finding optimal formulas for bilinear maps in a finite field
- XOR-counts and lightweight multiplication with fixed elements in binary finite fields
- Implementation of the DKSS algorithm for multiplication of large numbers
- Fast polynomial multiplication over \(\mathbb{F}_{2^{60}}\)
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
- Faster integer multiplication using plain vanilla FFT primes
- Polynomial multiplication over finite fields in time O(n n)
- Faster Multiplication in GF(2)[x]
- Implementing the multiplication of polynomial matrices over the field GF(2) by means of the fast Fourier transform
- Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$
- scientific article; zbMATH DE number 3223196 (Why is no real title available?)
- Fast on-line integer multiplication
- Faster integer multiplication using short lattice vectors
- Towards a library for straight-line programs
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
This page was built for publication: Implementing fast carryless multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628485)
