On arithmetical algorithms over finite fields
Journal of Combinatorial Theory Series A
Arithmetic and factorization of polynomial over F2 (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Factoring high-degree polynomials over f2 with Niederreiter's algorithm on the IBM SP2
Mathematics of Computation
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Polynomial factorization over F2
Mathematics of Computation
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
The truncated fourier transform and applications
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Five, Six, and Seven-Term Karatsuba-Like Formulae
IEEE Transactions on Computers
A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Generic GF(2m) arithmetic in software and its application to ECC
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
A kilobit special number field sieve factorization
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Fast arithmetics in artin-schreier towers over finite fields
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Fast arithmetics in Artin-Schreier towers over finite fields
Journal of Symbolic Computation
Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication
Information Processing Letters
Binary kloosterman sums with value 4
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
The M4RIE library for dense linear algebra over small fields with even characteristic
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.01 |
In this paper, we discuss an implementation of various algorithmsfor multiplying polynomials in GF(2)[x]: variants of the windowmethods, Karatsuba's, Toom-Cook's, Schönhage's and Cantor's algorithms.For most of them, we propose improvements that lead to practicalspeedups.