Nothing Special   »   [go: up one dir, main page]

Fieker et al., 2021 - Google Patents

On the computation of the endomorphism rings of abelian surfaces

Fieker et al., 2021

Document ID
789315594629961759
Author
Fieker C
Hofmann T
Sanon S
Publication year
Publication venue
Journal of Number Theory

External Links

Snippet

We extend the result of Bisson [4] to compute the endomorphism rings of principally polarized, absolutely simple, and ordinary abelian surfaces defined over finite fields in subexponential time in the size of the base field. The abelian surfaces covered here were …
Continue reading at www.sciencedirect.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/725—Finite field arithmetic over elliptic curves
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G06F17/12—Simultaneous equations, e.g. systems of linear equations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
    • G06F2207/7209—Calculation via subfield, i.e. the subfield being GF(q) with q a prime power, e.g. GF ((2**m)**n) via GF(2**m)

Similar Documents

Publication Publication Date Title
Hoyer Efficient quantum transforms
Bhargava et al. The average size of the 5-Selmer group of elliptic curves is 6, and the average rank is less than 1
US20180107939A1 (en) Exact quantum circuits and circuit syntheses for qudit and multiple qubit circuits
Gaudry et al. Counting points on genus 2 curves with real multiplication
Couveignes et al. Fast construction of irreducible polynomials over finite fields
Giesbrecht et al. Computing the Hermite form of a matrix of Ore polynomials
Baran An exceptional isomorphism between modular curves of level 13
Couveignes et al. Action of modular correspondences around CM points
Amadori et al. On the discrete logarithm problem for prime-field elliptic curves
Ionica et al. Isogeny graphs with maximal real multiplication
Fieker et al. On the computation of the endomorphism rings of abelian surfaces
Furukawa et al. Counting points for hyperelliptic curves of type y 2= x 5+ ax over finite prime fields
Gaudry Index calculus for abelian varieties and the elliptic curve discrete logarithm problem.
Rötteler Quantum algorithms for highly non-linear Boolean functions
Boe et al. Complexity for modules over the classical Lie superalgebra
Shoup Factoring polynomials over finite fields: asymptotic complexity vs. reality
Bisson Computing endomorphism rings of abelian varieties of dimension two
Brooksbank Constructive recognition of classical groups in their natural representation
Blomer On the central value of symmetric square L-functions
Couveignes Isomorphisms between Artin-Schreier towers
Krovi et al. An efficient quantum algorithm for the hidden subgroup problem over Weyl-Heisenberg groups
Moore et al. The hidden subgroup problem in affine groups: Basis selection in Fourier sampling
Couveignes et al. The equivariant complexity of multiplication in finite field extensions
Gevorgyan Towards the standard Majorana representations of 3-transposition groups
Ivanyos On solving systems of random linear disequations