New Software Speed Records for Cryptographic Pairings

By Michael Naehrig, Ruben Niederhagen, Peter Schwabe. 2010

126 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Mariana Raykova
2. Bryan Parno
3. Srinath T. V. Setty
4. Michael Walfish
5. Jon Howell
6. Craig Gentry
7. Andrew Justin Blumberg
8. Eli Ben-Sasson

In Information Systems

1. Mariana Raykova
2. Craig Gentry
3. Bryan Parno
4. Jon Howell
5. Julio César López-Hernández
6. Catherine H. Gebotys
7. Diego F. Aranha
8. Patrick Longa

Citations in the corpus

• Pinocchio: Nearly Practical Verifiable Computation (2013, methodology): “For the cryptographic code, we use a highspeed elliptic curve library [45] with a 256-bit BN-curve [46]”
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves (2011, methodology): “For the clear benefit of direct benchmarking, but also pointing that performance among variants is roughly the same, we restrict the discussion to computing the Optimal Ate pairing defined as in [6]:”