13 search results - page 1 / 3 » Irreducible trinomials over finite fields |
ISSAC
2001
Springer
13 years 9 months ago
2001
Springer
A necessary condition for irreducibility of a trinomial over a finite field, based on classical results of Stickelberger and Swan, is established. It is applied in the special ca...
ARC
2007
Springer
13 years 11 months ago
2007
Springer
We present a method for implementing a fast multiplier for finite fields GF(2m ) generated by irreducible trinomials of the form αm + αn
ACISP
2005
Springer
13 years 6 months ago
2005
Springer
Abstract. In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especial...
TC
2008
13 years 4 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
FFA
2010
13 years 2 months ago
2010
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...