High Security Pairing-Based Cryptography Revisited
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 480-494
- https://doi.org/10.1007/11792086_34
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Pairing-Friendly Elliptic Curves of Prime OrderLecture Notes in Computer Science, 2006
- Elliptic Curves Suitable for Pairing Based CryptographyDesigns, Codes and Cryptography, 2005
- Practical Cryptography in High Dimensional ToriLecture Notes in Computer Science, 2005
- Pairing-Based Cryptography at High Security LevelsLecture Notes in Computer Science, 2005
- Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic StructuresLecture Notes in Computer Science, 2004
- A Comparison of CEILIDH and XTRLecture Notes in Computer Science, 2004
- Identity-Based Encryption from the Weil PairingSIAM Journal on Computing, 2003
- XTR Extended to GF(p 6m)Lecture Notes in Computer Science, 2001
- The XTR Public Key SystemLecture Notes in Computer Science, 2000
- Elliptic Curves in CryptographyPublished by Cambridge University Press (CUP) ,1999