• Aucun résultat trouvé

Fast Algorithms for Towers of Finite Fields and Isogenies

N/A
N/A
Protected

Academic year: 2021

Partager "Fast Algorithms for Towers of Finite Fields and Isogenies"

Copied!
191
0
0

Texte intégral

Figure

Figure 3.1: Nodes over the standard linear basis: round ones are evaluation nodes, square ones are input and output nodes.
Figure 3.2 shows two examples of arithmetic circuits. Input and output nodes are ordered from left to right; ports are not ordered because the basis is  commuta-tive
Figure 3.4: A circuit over a commutative ring, its linearization for ` = {x 2 } (scalar
Figure 3.5: A circuit and its derivative at the point (a, b, c). We have replaced multiplication nodes with linear applications represented by 1 × 2 matrices.
+7

Références

Documents relatifs