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 ...
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...
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...
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...
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...