A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is
Many technics for randomness extraction over finite fields was proposed by various authors such as Fouque et al. and Carneti et al.. At eurocrypt'09, these previous works was improved by Chevalier et al., over a finite field F p , where p is a prime. But their papers don't study the case where the field is not prime such as binary fields. In this paper, we present a deterministic extractor for a multiplicative subgroup of F * p n , where p is a prime. In particular, we show that the k-first F 2doi:10.12988/ija.2013.2566 fatcat:lawrulspczdj3e2p7457zmisge