Secure and Efficient Pairing at 256-Bit Security Level

DOI10.1007/978-3-319-61204-1_4zbMATH Open1521.9405MaRDI QIDQ6487201FDOQ6487201

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

Publication date: 1 July 2022

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

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)