Implementing Pairings at the 192-Bit Security Level

DOI10.1007/978-3-642-36334-4_11zbMath1305.94033OpenAlexW119120280MaRDI QIDQ4912495

Francisco Rodríguez-Henríquez, Diego F. Aranha, Laura Fuentes-Castañeda, Edward Knapp, Alfred J. 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

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

Related Items (14)

Faster Ate pairing computation on Selmer's model of elliptic curves ⋮ 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 ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication ⋮ Compact structure-preserving signatures with almost tight security ⋮ Updating key size estimations for pairings ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ 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 ⋮ Adequate Elliptic Curves for Computing the Product of n Pairings

Uses Software

• RELIC

This page was built for publication: Implementing Pairings at the 192-Bit Security Level