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
• Memory-saving computation of the pairing final exponentiation on BN curves
• New Software Speed Records for Cryptographic 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
• Beta Weil pairing revisited
• Storing and retrieving secrets on a blockchain
• Efficient algorithms for secure outsourcing of bilinear pairings
• 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
• Point Decomposition Problem in Binary Elliptic Curves

This page was built for software: Barreto-Naehrig