Choosing and generating parameters for pairing implementation on BN curves

DOI10.1007/s00200-017-0334-yzbMath1401.94151OpenAlexW2725570675MaRDI QIDQ1745896

Sylvain Duquesne, Franck Rondepierre, Nadia El Mrabet, Safia Haloui

Publication date: 18 April 2018

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-017-0334-y

zbMATH Keywords

elliptic curvesfinite fieldscryptographypairing

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (2)

Finite field arithmetic in large characteristic for classical and post-quantum cryptography ⋮ Updating key size estimations for pairings

Uses Software

• MSR ECCLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Memory-saving computation of the pairing final exponentiation on BN curves
• The Weil pairing, and its efficient calculation
• Efficient pairing computation on supersingular abelian varieties
• Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
• Point Decomposition Problem in Binary Elliptic Curves
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Faster Hashing to ${\mathbb G}_2$
• Subgroup Security in Pairing-Based Cryptography
• The Realm of the Pairings
• A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• An Analysis of Affine Coordinates for Pairing Computation
• FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
• Modular Multiplication Without Trial Division
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Efficient Implementation of Bilinear Pairings on ARM Processors
• The Eta Pairing Revisited
• Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
• Faster Pairing Computations on Curves with High-Degree Twists
• New Software Speed Records for Cryptographic Pairings
• Pairing Lattices
• Integer Variable χ–Based Ate Pairing
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Affine Pairings on ARM
• Speeding Up Ate Pairing Computation in Affine Coordinates
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Optimal Pairings
• Efficient Pairings and ECC for Embedded Systems
• Advances in Cryptology – CRYPTO 2004
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Pairing-Friendly Elliptic Curves of Prime Order
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Optimised Versions of the Ate and Twisted Ate Pairings
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Cryptography and Coding

This page was built for publication: Choosing and generating parameters for pairing implementation on BN curves