Article
Open Access
Simplified pairing computation and security implications
-
Steven D. Galbraith
Published/Copyright:
August 13, 2007
Published Online: 2007-08-13
Published in Print: 2007-08-21
Copyright 2007, Walter de Gruyter
Articles in the same Issue
- An efficient and secure two-flow zero-knowledge identification protocol
- Probability distributions of correlation and differentials in block ciphers
- Fast genus 2 arithmetic based on Theta functions
- Simplified pairing computation and security implications
- On the k-error linear complexity of cyclotomic sequences
Keywords for this article
Pairings.
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- An efficient and secure two-flow zero-knowledge identification protocol
- Probability distributions of correlation and differentials in block ciphers
- Fast genus 2 arithmetic based on Theta functions
- Simplified pairing computation and security implications
- On the k-error linear complexity of cyclotomic sequences
