I'm implementing ECDSA for NIST P-256 curve. I just want to know if the same implementation will also work for SECP curves? If it doesn't, can you point me to one or more references of algorithms for SECP 256?

To clarify: I specifically want to know if there are any differences in algorithms for point addition and point scalar multiplication. For the current NIST implementation I'm using projective coordinates for point addition and multiplication.

  • $\begingroup$ Since Secp curves are prime field curves, the algorithms you run on NIST p-256 should work on those too. $\endgroup$
    – Makif
    Feb 23, 2016 at 14:58

1 Answer 1


Please check https://tools.ietf.org/search/rfc4492 - espessially, the "Appendix A. Equivalent Curves (Informative)" part.

For example: NIST P-256 is refered to as secp256r1 and prime256v1. Different names, but they are all the same.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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