On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6

By Koray Karabina, Edlyn Teske. 2008

30 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Geometry and Topology, 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. Eli Ben-Sasson
2. Eran Tromer
3. Madars Virza
4. Alessandro Chiesa
5. Dan Boneh
6. Srinath T. V. Setty
7. Michael Walfish
8. Michael Naehrig

In Geometry and Topology

1. Michael Naehrig
2. Edlyn Teske
3. David Mandell Freeman
4. Eli Ben-Sasson
5. Madars Virza
6. Eran Tromer
7. Alessandro Chiesa
8. Markulf Kohlweiss

In Information Systems

1. Eran Tromer
2. Eli Ben-Sasson
3. David Mandell Freeman
4. Alessandro Chiesa
5. Madars Virza
6. Edlyn Teske
7. Michael Naehrig
8. Markulf Kohlweiss

Citations in the corpus

• Geppetto: Versatile Verifiable Computation (2015, background): “Remarkably, Karabina and Teske [35] show that it is possible to generate two MNT curves [45] E and ˜ E that are pairing friendly and, more importantly, ˜ E can be embedded in E , and E can be embedded in ˜ E .”
• Scalable Zero Knowledge Via Cycles of Elliptic Curves (2014, methodology): “We thank Koray Karabina for answering questions about algorithms in [66].”
• A Taxonomy of Pairing-Friendly Elliptic Curves (2010, background): “Karabina and Teske [47, 48] show that if r and q are both primes greater than 3 then there is an elliptic curve E/Fq with embedding degree 6, discriminant D, and #E(Fq) = r if and only if there is an elliptic curve E/Fr with embedding degree 4, discriminant D, and #E(Fr) = q.”