Welcome to the resource topic for 2025/468
Title:
Optimized Frobenius and Cyclotomic Cubing for Enhanced Pairing Computation
Authors: Leila Ben Abdelghani, Nadia El Mrabet, Loubna Ghammam, Lina Mortajine
Abstract:Efficient implementation of a pairing-based cryptosystem relies on high-performance arithmetic in finite fields \mathbb{F}_{p} and their extensions \mathbb{F}_{p^k}, where k is the embedding degree. A small embedding degree is crucial because part of the arithmetic for pairing computation occurs in \mathbb{F}_{{p}^k} and includes operations such as squaring, multiplication, and Frobenius operations.
In this paper, we present a fast and efficient method for computing the Frobenius endomorphism and its complexity. Additionally, we introduce an improvement in the efficiency of cyclotomic cubing operations for several pairing-friendly elliptic curves, which are essential for the calculation of Tate pairing and its derivatives.
ePrint: https://eprint.iacr.org/2025/468
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .