English
Related papers

Related papers: Weil descent and cryptographic trilinear maps

200 papers

Elliptic curve cryptography (ECC) is foundational to modern secure communication, yet existing standard curves have faced scrutiny for opaque parameter-generation practices. This work introduces a Selmer-inspired framework for constructing…

Cryptography and Security · Computer Science 2025-10-06 Awnon Bhowmik

In this paper, we investigate a class of Collatz-like problems associated with weakly and strongly admissible triplets of integers. This framework extends the classical Collatz mapping, providing a systematic method for generating triplets…

General Mathematics · Mathematics 2026-01-27 Abderrahman Bouhamidi

By a theorem of Wahl, the canonically embedded curves which are hyperplane section of K3 surfaces are distinguished by the non-surjectivity of their Wahl map. In this paper we address the problem of distinguishing hyperplane sections of…

Algebraic Geometry · Mathematics 2010-01-28 Elisabetta Colombo , Paola Frediani , Giuseppe Pareschi

Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…

Number Theory · Mathematics 2011-07-25 A. A. Bruen , J. W. P. Hirschfeld , D. L. Wehlau

This paper presents explicit constructions of bases for Riemann-Roch spaces associated with arbitrary divisors on elliptic curves. In the context of algebraic geometry codes, the knowledge of an explicit basis for arbitrary divisors is…

Information Theory · Computer Science 2025-12-11 Artyom Kuninets , Ekaterina Malygina

There is a well known theorem by Deuring which gives a criterion for when the reduction of an elliptic curve with complex multiplication (CM) by the ring of integers of an imaginary quadratic field has ordinary or supersingular reduction.…

Number Theory · Mathematics 2022-03-17 Yan Bo Ti , Gabriel Verret , Lukas Zobernig

Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…

Algebraic Geometry · Mathematics 2020-06-16 Julia Bernatska , Yaacov Kopeliovich

We present new conditions which obstruct the existence of hyperelliptic Jacobians in isogeny classes of abelian varieties over finite fields of characteristic 2. We show that Weil polynomials of Jacobians cannot have coefficients in certain…

Number Theory · Mathematics 2025-08-26 Matvey Borodin , Liam May

A differential version of the classical Weil descent is established in all characteristics. It yields a theory of differential restriction of scalars for differential varieties over finite differential field extensions. This theory is then…

Algebraic Geometry · Mathematics 2018-07-31 Omar León Sánchez , Marcus Tressl

Consider the jacobian of a hyperelliptic genus two curve defined over a finite field. Under certain restrictions on the endomorphism ring of the jacobian we give an explicit description all non-degenerate, bilinear, anti-symmetric and…

Algebraic Geometry · Mathematics 2007-09-13 Christian Robenhagen Ravnshoj

Generalizing a method of Sutherland and the author for elliptic curves, we design a subexponential algorithm for computing the endomorphism rings of ordinary abelian varieties of dimension two over finite fields. Although its correctness…

Number Theory · Mathematics 2013-10-16 Gaetan Bisson

The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…

Combinatorics · Mathematics 2020-03-02 Ben Barber , Stefan Glock , Daniela Kühn , Allan Lo , Richard Montgomery , Deryk Osthus

Finding surface mappings with least distortion arises from many applications in various fields. Extremal Teichm\"uller maps are surface mappings with least conformality distortion. The existence and uniqueness of the extremal…

Differential Geometry · Mathematics 2013-07-11 Lui Lok Ming , Gu Xianfeng , Yau Shing-Tung

Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full torsion subgroup has rank 2g. In this paper we prove that…

Number Theory · Mathematics 2007-05-23 Steven D. Galbraith , Jordi Pujolàs , Christophe Ritzenthaler , Benjamin Smith

In this paper, we study the problem of sampling random supersingular elliptic curves with unknown endomorphism rings. This problem has recently gained considerable attention as many isogeny-based cryptographic protocols require such…

Quantum Physics · Physics 2026-03-24 Maher Mamah , Jake Doliskani , David Jao

We survey methods to compute three-point branched covers of the projective line, also known as Belyi maps. These methods include a direct approach, involving the solution of a system of polynomial equations, as well as complex analytic…

Number Theory · Mathematics 2018-11-13 Jeroen Sijsling , John Voight

The problem of constructing elliptic curves suitable for pairing applications has received a lot of attention. To solve this, we propose a variant algorithm of a known method by Brezing and Weng. We produce new families of parameters using…

Number Theory · Mathematics 2007-11-14 Tanaka Satoru , Nakamula Ken

We give a description of endomorphism rings of Weil restrictions of abelian varieties with respect to finite Galois extensions. The results are applied to study the isogeny decomposition of Weil restrictions.

Algebraic Geometry · Mathematics 2007-05-23 Claus Diem , N. Naumann

Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a…

Discrete Mathematics · Computer Science 2017-04-04 Zdeněk Dvořák

The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…

Cryptography and Security · Computer Science 2023-02-06 Alessio Caminata , Michela Ceria , Elisa Gorla