Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I know that the algorithm used to generate the Brainpool curves and the NIST curves is published. The algorithm should be this one (RFC5639 Appendix A). From what it looks like it's rather slow to find secure parameters.

After some research I've also found "Efficient Algorithms for Generating Elliptic Curves over Finite Fields Suitable for Use in Cryptography" by Harald Baier (in fact it's a PhD thesis I think) on the generation of secure elliptic curves. I've also googled around and found a tool that actually generates such curves (using this algorithm I think). From an efficiency point of view this algorithm looks faster than the NIST's one.

Now my question:
Are the above two algorithms the only ones (published) for generating safe elliptic curves or are there other ones?

share|improve this question
up vote 3 down vote accepted

Of course there are others. Of interest might be the paper 'Efficient ephemeral elliptic curve cryptographic keys' by Mieli and Lenstra, which claims to generate fresh Elliptic Curves sufficiently quickly that they can be created on the fly for a single ECDH exchange, and then discarded.

share|improve this answer
really nice and recent paper :) May I ask if this was pre-Logjam? – SEJPM Jun 16 '15 at 19:01
@SOJPM: I suspect that the ideas within the paper predated Logjam; however the paper itself is obviously recent (it references a paper published on ePrint in April). – poncho Jun 17 '15 at 2:59

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.