arXiv math/06014872006-01-20math.NTcs.CR

Constructing pairing-friendly elliptic curves with embedding degree 10

David Freeman

英文摘要：

We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with embedding degree k = 10, which solves an open problem posed by Boneh, Lynn, and Shacham. We show that our framework incorporates existing constructions for k = 3, 4, 6, and 12, and we give evidence that the method is unlikely to produce infinite families of curves with embedding degree k > 12.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On conditions for ρ-value is 1 or not of complete family of pairing-friendly elliptic curves

We study whether a complete family of pairing friendly elliptic curves has a ρ-value 1 or not. We show that, in some cases, ρ-values are not to be 1.

2012-05-08cs.CRmath.NT

Note on families of pairing-friendly elliptic curves with small embedding degree

Pairing-based cryptographic schemes require so-called pairing-friendly elliptic curves, which have special properties. The set of pairing-friendly elliptic curves that are generated by given polynomials form a complete family. Although a complete family with a $ρ$-value of 1 is the ideal case, there is only one such example that is known, this was given by Barreto and Naehrig. We prove that there are no ideal families with embedding degree 3, 4, or 6 and that many complete families with embedding degree 8 or 12 are nonideal, even if we chose noncyclotomic families.

2016-05-08cs.CRmath.NT

Heuristics on pairing-friendly abelian varieties

We discuss heuristic asymptotic formulae for the number of pairing-friendly abelian varieties over prime fields, generalizing previous work of one of the authors arXiv:math1107.0307

2013-10-10math.NT

More constructing pairing-friendly elliptic curves for cryptography

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 our algorithm for pairing-friendly elliptic curves of embedding degree 8, and we actually compute some explicit curves as numerical examples.

2007-11-13math.NT

Heuristics on pairing-friendly elliptic curves

We present a heuristic asymptotic formula as $x\to \infty$ for the number of isogeny classes of pairing-friendly elliptic curves with fixed embedding degree $k\geq 3$, with fixed discriminant, with rho-value bounded by a fixed $ρ_0$ such that $1<ρ_0<2$, and with prime subgroup order at most $x$.

2012-04-01math.NT

On the non-idealness of cyclotomic families of pairing-friendly elliptic curves

Let $k=2^mp^n$ for an odd prime $p$ and integers $m\ge 0$ and $n\ge 0$. We obtain lower bounds for the $ρ$-values of cyclotomic families of pairing-friendly elliptic curves with embedding degree $k$ and $r(x)=Φ_k(x)$. Our bounds imply that none of these families are ideal.

2014-04-17math.NT

更多相关论文收起更多论文

On cycles of pairing-friendly elliptic curves

A cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next, in a cyclic way. We study cycles of elliptic curves in which every curve is pairing-friendly. These have recently found notable applications in pairing-based cryptography, for instance in improving the scalability of distributed ledger technologies. We construct a new cycle of length 4 consisting of MNT curves, and characterize all the possibilities for cycles consisting of MNT curves. We rule out cycles of length 2 …

2018-11-02math.AGmath.NT

非素数阶的MNT椭圆曲线

MNT Elliptic Curves with Non-Prime Order

本文提出了一种生成非素数阶MNT曲线的方法，该曲线的阶为两个素数的乘积。

2025-12-25cs.CRmath.NT

Heuristics of the Cocks-Pinch method

We heuristically analyze the Cocks-Pinch method by using the Bateman-Horn conjecture. Especially, we present the first known heuristic which suggests that any efficient construction of pairing-friendly elliptic curves can efficiently generate such curves over pairing-friendly fields, naturally including the Cocks-Pinch method. Finally, some numerical evidence is given.

2014-01-19math.NT

基于配对的证明系统的超奇异椭圆曲线循环

Cycles of supersingular elliptic curves for pairing-based proof systems

Queensland University of Technology（昆士兰科技大学）；University of Arizona（亚利桑那大学）

该研究针对无界递归基于配对的证明系统，构造了超奇异椭圆曲线循环，其可通过Bröker算法高效生成无限个循环，还可与小有限域上的配对友好型曲线连接。

2026-08-18math.NT

Pairings on hyperelliptic curves

We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many directions for further research.

2009-09-23cs.CRmath.AGmath.NT

Faster computation of the Tate pairing

This paper proposes new explicit formulas for the doubling and addition step in Miller's algorithm to compute the Tate pairing. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric interpretation of the group law on Edwards curves by presenting the functions which arise in the addition and doubling. Computing the coefficients of the functions and the sum or double of the points is faster than with all previously proposed formulas for pairings on Edwards curves. They are even competitive with all published formulas for pairing computation on…

2010-05-27math.AGmath.NT

Beilinson高度配对的性质

Properties of the Beilinson Height Pairing

本文研究了Beilinson高度配对的高维推广，通过构造新高度配对将其与相交积相联系，并证明其满足与相交积一致的投影公式。

2025-08-12math.AGmath.NT

More Discriminants with the Brezing-Weng Method

The Brezing-Weng method is a general framework to generate families of pairing-friendly elliptic curves. Here, we introduce an improvement which can be used to generate more curves with larger discriminants. Apart from the number of curves this yields, it provides an easy way to avoid endomorphism rings with small class number.

2008-06-12math.NT

Genus 2 Curves with Complex Multiplication

Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve constructing genus 2 curves with complex multiplication via computing their three Igusa class polynomials. These polynomials have rational coefficients and require extensive computation and precision to compute. Both the computation and the complexity analysis of these algorithms can be improved by a more precise understanding of the denominators of the coeffi…

2010-03-24math.NT