Biextensions in pairing-based cryptography

DOI10.1007/S10623-025-01762-1MaRDI QIDQ6881083zbMATH OpenFDO

Authors Jianming Lin, Damien Robert, Chang-An Zhao, Yuhao Zheng

Publication date 18 December 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-025-01762-1

zbMATH Keywords

biextensioncubical arithmeticMiller's algorithmpairing computationsuper-optimal ate pairing

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite ground fields in algebraic geometry (14G15) Elliptic curves (14H52) Computational aspects of algebraic curves (14Q05)

Cites work

• x-superoptimal pairings on elliptic curves with odd prime embedding degrees: BW13-P310 and BW19-P286
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• A survey of elliptic curves for proof systems
• A taxonomy of pairing-friendly elliptic curves
• Advances in Cryptology - ASIACRYPT 2003
• An Improvement of the Elliptic Net Algorithm
• Arithmetic on abelian and Kummer varieties
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Efficient pairing computation on supersingular abelian varieties
• Elliptic curves. Number theory and cryptography
• Families of SNARK-friendly 2-chains of elliptic curves
• Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
• Geometry of numbers. In two parts, II (last part).
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 2086895 (Why is no real title available?)
• scientific article; zbMATH DE number 1842492 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• scientific article; zbMATH DE number 3343795 (Why is no real title available?)
• Optimal Pairings
• Optimised Versions of the Ate and Twisted Ate Pairings
• Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
• Pairing Lattices
• Revisiting pairing-friendly curves with embedding degrees 10 and 14
• The Eta Pairing Revisited
• The Tate Pairing Via Elliptic Nets
• The Weil pairing, and its efficient calculation

Cited in

(1)

• Computing pairings on elliptic curves with embedding degree two via biextensions

This page was built for publication: Biextensions in pairing-based cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6881083)