The following pages link to Faster Multiplication in GF(2)[x] (Q5387595):
Displaying 15 items.
- A note on the paper ``Multiplication of polynomials modulo \(x^n\)'' by Murat Cenk and Ferruh Özbudak (Q418751) (← links)
- Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication (Q436584) (← links)
- Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\) (Q1199646) (← links)
- Fast multiplication of polynomials over fields of characteristic 2 (Q1240012) (← links)
- A logic-algebraic tool for reasoning with knowledge-based systems (Q1994361) (← links)
- Fast transforms over finite fields of characteristic two (Q2229746) (← links)
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic (Q2430987) (← links)
- (Q2707607) (← links)
- Ten new primitive binary trinomials (Q3055140) (← links)
- Binary Kloosterman Sums with Value 4 (Q3104685) (← links)
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes (Q3540050) (← links)
- (Q3809261) (← links)
- Applied Cryptography and Network Security (Q4680967) (← links)
- Entropically secure encryption with faster key expansion (Q6492513) (← links)
