Implementing Cryptographic Pairings over Barreto-Naehrig Curves

DOI10.1007/978-3-540-73489-5_10zbMath1151.94503MaRDI 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

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

Related Items

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