Constructive and computational aspects of cryptographic pairings
By Michael Naehrig. 2009
26 citations recorded by the source corpus.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Peter Schwabe
- Ruben Niederhagen
- Michael Naehrig
- Bryan Parno
- Miran Kim
- Dan Boneh
- Craig Gentry
- Joppe W. Bos
Citations in the corpus
- New Software Speed Records for Cryptographic Pairings (2010, background): “The reason for this is that for BN curves Q1 −Q2 +Q3 + [6u+ 2]Q = O, which can be easily derived from Lemma 2.17 in [ 30 ].”