Home Heuristics on pairing-friendly elliptic curves
Article Open Access

Heuristics on pairing-friendly elliptic curves

  • John Boxall EMAIL logo
Published/Copyright: October 5, 2012
Download Article (PDF)
Become an author with De Gruyter Brill
Submit Manuscript Author Information
Journal of Mathematical Cryptology
From the journal Journal of Mathematical Cryptology Volume 6 Issue 2

Received: 2011-07-19
Revised: 2012-07-19
Accepted: 2012-08-06
Published Online: 2012-10-05
Published in Print: 2012-10-01

© 2012 by Walter de Gruyter Berlin Boston

Articles in the same Issue

  1. Masthead
  2. Heuristics on pairing-friendly elliptic curves
  3. Recursive weights for some Boolean functions
  4. The effectiveness of the linear hull effect
  5. Compact McEliece keys based on quasi-dyadic Srivastava codes
  6. The discrete logarithm problem in Bergman's non-representable ring
https://doi.org/10.1515/jmc-2011-0004
Keywords for this article
Elliptic curves; finite fields; pairing-based cryptography
Creative Commons
BY-NC-ND 3.0

Articles in the same Issue

  1. Masthead
  2. Heuristics on pairing-friendly elliptic curves
  3. Recursive weights for some Boolean functions
  4. The effectiveness of the linear hull effect
  5. Compact McEliece keys based on quasi-dyadic Srivastava codes
  6. The discrete logarithm problem in Bergman's non-representable ring
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 6.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jmc-2011-0004/html
Scroll to top button