๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new algorithm for multiplication in finite fields

โœ Scribed by Pincin, A.

Book ID
119772236
Publisher
IEEE
Year
1989
Tongue
English
Weight
518 KB
Volume
38
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Bit Serial Multiplication in Finite Fiel
Bit Serial Multiplication in Finite Fields
โœ Wang, Muzhong; Blake, Ian F. ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 637 KB
Multiplication of Polynomials over Finit
Multiplication of Polynomials over Finite Fields
โœ Bshouty, Nader H.; Kaminski, Michael ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 607 KB
Algorithms for Exponentiation in Finite
Algorithms for Exponentiation in Finite Fields
โœ Shuhong Gao; Joachim Von zur gathen; Daniel Panario; Victor Shoup ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 298 KB

Gauss periods yield (self-dual) normal bases in finite fields, and these normal bases can be used to implement arithmetic efficiently. It is shown that for a small prime power q and infinitely many integers n, multiplication in a normal basis of F q n over Fq can be computed with O(n log n loglog n)