Reduction-free multiplication for finite fields and polynomial rings
DOI10.1007/978-3-031-22944-2_4zbMath1527.11099MaRDI QIDQ6169003
No author found.
Publication date: 10 August 2023
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
cryptographyMontgomery multiplicationfinite field arithmeticpseudoprimespolynomials ringsMersenne polynomialsequally-spaced polynomialsinterleaved multiplicationKaratsuba-Ofman multiplicationpolynomial bi-partite multiplicationreduction-free multiplicationreduction-free trinomials
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Computational methods for problems pertaining to field theory (12-08)
Cites Work
- Unnamed Item
- Unnamed Item
- FHE-based bootstrapping of designated-prover NIZK
- On Mersenne polynomials over \(\mathbb{F}_2\)
- Homomorphic encryption for arithmetic of approximate numbers
- Fast multiplication of large numbers
- The great trinomial hunt
- Modular Multiplication Without Trial Division
- Mastrovito multiplier for all trinomials
- A Computer Algorithm for Calculating the Product AB Modulo M
- Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Mastrovito multiplier for general irreducible polynomials
- Bipartite Modular Multiplication Method
- Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula>
- Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)
- An Efficient CRT-Based Bit-Parallel Multiplier for Special Pentanomials
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Primitive trinomials whose degree is a Mersenne exponent
This page was built for publication: Reduction-free multiplication for finite fields and polynomial rings
