On Chains of Pairing-Friendly Elliptic Curves

会议论文
发表日期：

2025年

查看全文

Maciej Grześkowiak

摘要

Recently, many constructions of curves aim to implement different kinds of proof systems efficiently. For the protocol to be efficient, one must generate particular forms of prime numbers. This article presents an algorithm that finds desired prime numbers in polynomial time.

Recently, many constructions of curves aim to implement different kinds of proof systems efficiently. For the protocol to&#xa0;be efficient, one must generate particular forms of prime numbers.&#xa0;This article presents an algorithm that finds desired prime numbers&#xa0;in polynomial time.

On Chains of Pairing-Friendly Elliptic Curves

摘要

Recently, many constructions of curves aim to implement different kinds of proof systems efficiently. For the protocol to be efficient, one must generate particular forms of prime numbers. This article presents an algorithm that finds desired prime numbers in polynomial time.