Barreto-Naehrig

swMATH6611MaRDI QIDQ18699FDOQ18699

Author name not available (Why is that?)

Described by source

• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves

Cited In (13)

• Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
• On the Efficient Implementation of Pairing-Based Protocols
• Designing a Code Generator for Pairing Based Cryptographic Functions
• High Speed Flexible Pairing Cryptoprocessor on FPGA Platform
• Storing and Retrieving Secrets on a Blockchain
• Memory-saving computation of the pairing final exponentiation on BN curves
• New Software Speed Records for Cryptographic Pairings
• Beta Weil pairing revisited
• Efficient algorithms for secure outsourcing of bilinear pairings
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• Parallelizing the Weil and Tate Pairings
• Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
• Point Decomposition Problem in Binary Elliptic Curves

This page was built for software: Barreto-Naehrig