Quasi-optimal algorithms for multiplication in the extensions of F16 of degree 13, 14 and 15-Reference-Cited by-同舟云学术

Quasi-optimal algorithms for multiplication in the extensions of F16 of degree 13, 14 and 15

Published:2002-06 Issue:2-3 Volume:171 Page:149-164
ISSN:0022-4049
Container-title:Journal of Pure and Applied Algebra
language:en
Short-container-title:Journal of Pure and Applied Algebra

Author:

Ballet Stéphane

Publisher

Elsevier BV

Subject

Algebra and Number Theory

Reference12 articles.

1. S. Ballet, On the complexity of multiplication in certain finite extensions of finite fields, Bulletin numéro 3 de la Cellule de Prospective en Cryptographie, Codage et Sécurité des Réseaux de la DGA, Janvier, 1998, pp. 78–89.

2. Curves with many points and multiplication complexity in any extension of Fq;Ballet;Finite Fields Appl.,1999

3. An optimal algorithm for multiplication in F256/F4;Baum;Appl. Algebra Eng. Comm. Comput.,1991

4. Algebraic complexities and algebraic curves over finite fields;Chudnovsky;J. Complexity,1988

5. H.F. Groote, Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties, Lectures Notes in Computer Science, Vol. 245, Springer, Berlin, 1985.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields;Designs, Codes and Cryptography;2022-01-20

2. A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line;Arithmetic, Geometry, Cryptography, and Coding Theory 2021;2022

3. Optimization of the scalar complexity of Chudnovsky2 multiplication algorithms in finite fields;Cryptography and Communications;2021-06-03

4. On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry;Russian Mathematical Surveys;2021-02-01

5. On the Scalar Complexity of Chudnovsky $$^2$$ Multiplication Algorithm in Finite Fields;Algebraic Informatics;2019