2020/05/08 by Tony Ezome, Ezome, Tony, Mohamadou Sall +1
Computer Science · Engineering · #11T30 #12E20 #12E30 #12Y05 #Coding theory and cryptography #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2005.04295
openalex publication_date 2020/05/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We are interested in extending normal bases of F 2n/F 2 to bases of F 2nd/F 2 which allow fast arithmetic in F 2nd. This question has been recently studied by Thomson and Weir in case d is equal to 2. We construct efficient extended bases in case d is equal to 3 and 4. We also give conditions under which Thomson-Weir construction can be combined with ours.