Implementing pairings at the 192-bit security level

DOI10.1007/978-3-642-36334-4_11MaRDI QIDQ4912495zbMATH OpenOpenAlexFDO

Authors Diego F. Aranha, Laura Fuentes-Castañeda, Edward Knapp, Francisco Rodríguez-Henríquez, Alfred Menezes

Publication date 4 April 2013

Published in Pairing-Based Cryptography – Pairing 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36334-4_11

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• Analysis of optimum pairing products at high security levels
• Parallelizing the Weil and Tate pairings
• Algorithmic Number Theory
• Improving the computation of the optimal ate pairing for a high security level
• Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level

Cited in

(29)

• Parallelizing pairings on Hessian elliptic curves
• Efficient optimal ate pairing at 128-bit security level
• Updating key size estimations for pairings
• Dynamic universal accumulator with batch update over bilinear groups
• 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
• Beta Weil pairing revisited
• Improving the computation of the optimal ate pairing for a high security level
• Extended tower number field sieve: a new complexity for the medium prime case
• Faster Ate pairing computation on Selmer's model of elliptic curves
• Analysis of optimum pairing products at high security levels
• Subgroup security in pairing-based cryptography
• An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication
• Parallelizing the Weil and Tate pairings
• Attractive subfamilies of BLS curves for implementing high-security pairings
• Heuristic counting of Kachisa-Schaefer-Scott curves
• Affine pairings on ARM
• Adequate elliptic curves for computing the product of n pairings
• PandA: pairings and arithmetic
• Compact structure-preserving signatures with almost tight security
• Secure and Efficient Pairing at 256-Bit Security Level
• Pairings in rank-1 constraint systems
• Efficient secure multi-party computation for proof of custody in Ethereum sharding
• Optimal ate pairing on elliptic curves with embedding degree 9, 15 and 27
• Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees k=5,7
• Revisiting pairing-friendly curves with embedding degrees 10 and 14
• Special TNFS-secure pairings on ordinary genus 2 hyperelliptic curves
• A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
• Low-cost addition-subtraction sequences for the final exponentiation in pairings

Describes a project that uses

Uses Software

• RELIC

This page was built for publication: Implementing pairings at the 192-bit security level

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