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

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60Methods 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/72Methods 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/724Finite field arithmetic
    • G06F7/726Inversion; Reciprocal calculation; Division of elements of a finite field
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60Methods 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/72Methods 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/724Finite field arithmetic
    • G06F7/725Finite field arithmetic over elliptic curves
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/11Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/16Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/18Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50Computer-aided design
    • G06F17/5009Computer-aided design using simulation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/72Indexing scheme relating to groups G06F7/72 - G06F7/729
    • G06F2207/7219Countermeasures against side channel or fault attacks
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/70Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds
    • G06F19/708Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds for data visualisation, e.g. molecular structure representations, graphics generation, display of maps or networks or other visual representations
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
Ben-Sasson et al. Subspace polynomials and cyclic subspace codes
US6766342B2 (en) System and method for computing and unordered Hadamard transform
Hallgren et al. The hidden subgroup problem and quantum computation using group representations
US10496931B2 (en) Exact quantum circuits and circuit syntheses for qudit and multiple qubit circuits
Couveignes et al. Fast construction of irreducible polynomials over finite fields
US20080084997A1 (en) Computing Endomorphism Rings of Abelian Surfaces over Finite Fields
Cohen et al. Primitive normal bases with prescribed trace
Nakajima Geometric construction of representations of affine algebras
Couveignes et al. Action of modular correspondences around CM points
Adleman et al. Counting points on curves and abelian varieties over finite fields
Fieker et al. On the computation of the endomorphism rings of abelian surfaces
González–Jiménez et al. An algorithm for determining torsion growth of elliptic curves
Dai et al. Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
Gaudry Index calculus for abelian varieties and the elliptic curve discrete logarithm problem.
Huang et al. Interpolation of sparse multivariate polynomials over large finite fields with applications
Douglas et al. Closed subsets of root systems and regular subalgebras
Karemaker et al. Isomorphism classes of Drinfeld modules over finite fields
Cho et al. A refinement of Müller's cube root algorithm
Bekaert et al. Gauge invariants and Killing tensors in higher-spin gauge theories
Křivka et al. On the computation of characteristic polynomial of a chemical graph
Stillman et al. Using SAGBI bases to compute invariants
Springer Computing the endomorphism ring of an ordinary abelian surface over a finite field
Harasawa et al. Fast Jacobian group arithmetic on C ab curves
Ivanyos et al. Solving systems of diagonal polynomial equations over finite fields
Tafazolian et al. On certain maximal hyperelliptic curves related to Chebyshev polynomials