AbstractAn Artin–Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp−X−α. Following Cantor and Couveignes, we give algorithms with quasi-linear time complexity for arithmetic operations in such towers. As an application, we present an implementation of Couveignes’ algorithm for computing isogenies between elliptic curves using the p-torsion
International audienceInspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we...
International audienceNowadays, asymptotically fast algorithms are widely used in computer algebra f...
International audienceNowadays, asymptotically fast algorithms are widely used in computer algebra f...
International audienceAn Artin-Schreier tower over the finite field Fp is a tower of field extension...
International audienceAn Artin-Schreier tower over the finite field $Fp$ is a tower of field extensi...
International audienceAn Artin-Schreier tower over the finite field Fp is a tower of field extension...
International audienceAn Artin-Schreier tower over the finite field Fp is a tower of field extension...
International audienceAn Artin-Schreier tower over the finite field F_p is a tower of field extensio...
International audienceAn Artin-Schreier tower over the finite field F_p is a tower of field extensio...
International audienceAn Artin-Schreier tower over the finite field F_p is a tower of field extensio...
AbstractAn Artin–Schreier tower over the finite field Fp is a tower of field extensions generated by...
In this thesis we apply techniques from computer algebra and language theory to speed up the element...
In this thesis we apply techniques from computer algebra and language theory to speed up the element...
In this thesis we apply techniques from computer algebra and language theory to speed up the element...
International audienceInspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we...
International audienceInspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we...
International audienceNowadays, asymptotically fast algorithms are widely used in computer algebra f...
International audienceNowadays, asymptotically fast algorithms are widely used in computer algebra f...
International audienceAn Artin-Schreier tower over the finite field Fp is a tower of field extension...
International audienceAn Artin-Schreier tower over the finite field $Fp$ is a tower of field extensi...
International audienceAn Artin-Schreier tower over the finite field Fp is a tower of field extension...
International audienceAn Artin-Schreier tower over the finite field Fp is a tower of field extension...
International audienceAn Artin-Schreier tower over the finite field F_p is a tower of field extensio...
International audienceAn Artin-Schreier tower over the finite field F_p is a tower of field extensio...
International audienceAn Artin-Schreier tower over the finite field F_p is a tower of field extensio...
AbstractAn Artin–Schreier tower over the finite field Fp is a tower of field extensions generated by...
In this thesis we apply techniques from computer algebra and language theory to speed up the element...
In this thesis we apply techniques from computer algebra and language theory to speed up the element...
In this thesis we apply techniques from computer algebra and language theory to speed up the element...
International audienceInspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we...
International audienceInspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we...
International audienceNowadays, asymptotically fast algorithms are widely used in computer algebra f...
International audienceNowadays, asymptotically fast algorithms are widely used in computer algebra f...