Finite field multiplication combining AMNS and DFT approach for pairing cryptography

FREE-DOWNLOAD N El Mrabet… – Information Security and Privacy, 2009
Abstract. Pairings over elliptic curves use fields Fpk with p = 2160 and 6 < k = 32. In this paper
we propose to represent elements in Fp with AMNS sytem of [1]. For well chosen AMNS we get
roots of unity with sparse representation. The multiplication by these roots are thus really