27 search results - page 3 / 6 » Fast Construction of Irreducible Polynomials over Finite Fie... |
TC
2008
13 years 8 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 ...
ISSAC
2009
Springer
14 years 3 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
MOC
2000
13 years 8 months ago
2000
These tables record results on curves with many points over finite fields. For relatively small genus (0 g 50) and q a small power of 2 or 3 we give in two tables the best presen...
PKC
2000
Springer
14 years 3 days ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
IJNSEC
2010
13 years 3 months ago
2010
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over Fm 2 , and it...