Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees \(k=5,7\)
From MaRDI portal
Publication:6637057
DOI10.1142/s1793830923500544MaRDI QIDQ6637057
Emmanuel Fouotsa, Senegue Gomez Nyamsi, Calvin Tcheka
Publication date: 13 November 2024
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster Ate pairing computation on Selmer's model of elliptic curves
- Geometry of numbers. In two parts, II (last part).
- Generating pairing-friendly elliptic curve parameters using sparse families
- Efficient optimal ate pairing at 128-bit security level
- Short signatures from the Weil pairing
- Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Guide to pairing-based cryptography
- Analysis of Optimum Pairing Products at High Security Levels
- Efficient Multiplication in Finite Field Extensions of Degree 5
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Improved proxy re-encryption schemes with applications to secure distributed storage
- On vectorial addition chains
- Implementing Pairings at the 192-Bit Security Level
- Optimal Pairings
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Curves with Fast Computations in the First Pairing Group
This page was built for publication: Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees \(k=5,7\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637057)
