Implementing Cryptographic Pairings over Barreto-Naehrig Curves

DOI10.1007/978-3-540-73489-5_10zbMath1151.94503OpenAlexW1553314411MaRDI QIDQ5429238

No author found.

Publication date: 29 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73489-5_10

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (17)

Faster Hashing to ${\mathbb G}_2$ ⋮ Memory-saving computation of the pairing final exponentiation on BN curves ⋮ Provably secure and pairing-based strong designated verifier signature scheme with message recovery ⋮ Robust subgroup multi-signatures for consensus ⋮ On Compressible Pairings and Their Computation ⋮ Finite field arithmetic in large characteristic for classical and post-quantum cryptography ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Multiple point compression on elliptic curves ⋮ Comparing two pairing-based aggregate signature schemes ⋮ Updating key size estimations for pairings ⋮ Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field ⋮ Integer Variable χ–Based Ate Pairing ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ A Schnorr-Like Lightweight Identity-Based Signature Scheme ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ On Software Parallel Implementation of Cryptographic Pairings ⋮ Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography

This page was built for publication: Implementing Cryptographic Pairings over Barreto-Naehrig Curves