Year: 2018
Type: preprint
Abstract: This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe algorithms with quasi-linear complexity to multiply two elements given in each one of the bases.
Source: arXiv (Cornell University)
Authors: Ezome, Tony, Sall, Mohamadou
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2892922503
