Secure and Efficient Pairing at 256-Bit Security Level

DOI10.1007/978-3-319-61204-1_4MaRDI QIDQ6487201zbMATH OpenFDO

Authors Yutaro Kiyomura, Akiko Inoue, Yuto Kawahara, Masaya Yasuda, Tsuyoshi Takagi, Tetsutaro Kobayashi

Publication date 1 July 2022

Full work available at URL https://doi.org/10.1007/978-3-319-61204-1_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Implementing pairings at the 192-bit security level
• Cryptography and Coding
• Efficient optimal ate pairing at 128-bit security level
• On the efficient implementation of pairing-based protocols
• Efficient implementation of pairing-based cryptosystems
• Algorithmic Number Theory
• Simplified pairing computation and security implications
• Pairings in Trusted Computing
• Analysis of optimum pairing products at high security levels

Cites work

• scientific article; zbMATH DE number 1952905 (Why is no real title available?)
• scientific article; zbMATH DE number 2081059 (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?)
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• A Kilobit Special Number Field Sieve Factorization
• A taxonomy of pairing-friendly elliptic curves
• Adequate elliptic curves for computing the product of n pairings
• Affine pairings on ARM
• Attractive subfamilies of BLS curves for implementing high-security pairings
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Exponentiating in pairing groups
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• Extended tower number field sieve: a new complexity for the medium prime case
• Faster explicit formulas for computing pairings over ordinary curves
• Faster squaring in the cyclotomic subgroup of sixth degree extensions
• Fully secure functional encryption with general relations from the decisional linear assumption
• Fuzzy Identity-Based Encryption
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Implementing pairings at the 192-bit security level
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• Monte Carlo Methods for Index Computation (mod p)
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• On the efficient implementation of pairing-based protocols
• Optimal Pairings
• Pseudo 8–Sparse Multiplication for Efficient Ate–Based Pairing on Barreto–Naehrig Curve
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• Subgroup security in pairing-based cryptography
• The Eta Pairing Revisited
• The Number Field Sieve in the Medium Prime Case
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• The Weil pairing, and its efficient calculation
• The development of the number field sieve
• The tower number field sieve
• Using number fields to compute logarithms in finite fields
• Virtual logarithms

Cited in

(2)

• Efficient optimal ate pairing at 128-bit security level
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation

This page was built for publication: Secure and Efficient Pairing at 256-Bit Security Level

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