Pairings in Cryptography
From SIAG-AG
(Difference between revisions)
| Revision as of 16:42, 17 February 2015 (edit) Blekherman (Talk | contribs) (New page: Pairings on elliptic and hyperelliptic curves have many applications in cryptography, including identity based cryptography, cryptographic key agreement, digital signatures, and others. Wh...) ← Previous diff |
Current revision (16:42, 17 February 2015) (edit) (undo) Blekherman (Talk | contribs) (New page: Pairings on elliptic and hyperelliptic curves have many applications in cryptography, including identity based cryptography, cryptographic key agreement, digital signatures, and others. Wh...) |
Current revision
Pairings on elliptic and hyperelliptic curves have many applications in cryptography, including identity based cryptography, cryptographic key agreement, digital signatures, and others. While recent advances in discrete logarithm computations over fields of small characteristic have had a significant impact on this area, pairings over fields of large characteristic continue to be of widespread interest.
Speakers:
- Diego Aranha, University of Campinas (Sao Paolo, Brazil)
- Sorina Ionica, University of Bordeaux (France)
- Koray Karabina, Florida Atlantic University (USA)
- Eunjeong Lee, North Carolina State (USA)
- Patrick Longa, Microsoft Research (Redmond, USA)
- Michael Naehrig, Microsoft Research (Redmond, USA)
- Francisco Rodríguez-Henríquez, CINVESTAV-IPN (Mexico)
- Peter Schwabe, University of Eindhoven (The Netherlands)
- Mehdi Tibouchi, NTT Tokyo (Japan)
