Faster Multiplication in GF(2)[x]

DOI10.1007/978-3-540-79456-1_10zbMath1230.11152OpenAlexW2116078937WikidataQ56938989 ScholiaQ56938989MaRDI QIDQ5387595

Richard P. Brent, Emmanuel Thomé, Pierrick Gaudry, Paul Zimmermann

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79456-1_10

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items

Fast arithmetics in Artin-Schreier towers over finite fields, Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic, Impact of Intel's new instruction sets on software implementation of \(GF(2)[x\) multiplication], A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Fast transforms over finite fields of characteristic two, A logic-algebraic tool for reasoning with knowledge-based systems, Ten new primitive binary trinomials, Binary Kloosterman Sums with Value 4

Uses Software

• NTL

Cites Work

• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
• On arithmetical algorithms over finite fields
• Fast multiplication of polynomials over fields of characteristic 2
• Polynomial factorization over ${\mathbb F}_2$
• Five, six, and seven-term Karatsuba-like formulae
• Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
• The truncated fourier transform and applications
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• A Kilobit Special Number Field Sieve Factorization
• Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item