P-384 is the

elliptic curve In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point . An elliptic curve is defined over a field and describes points in , the Cartesian product of with itself. If the ...

currently specified in

Commercial National Security Algorithm Suite The Commercial National Security Algorithm Suite (CNSA) is a set of cryptographic algorithms Promulgation, promulgated by the National Security Agency as a replacement for NSA Suite B Cryptography algorithms. It serves as the cryptographic base to ...

for the

ECDSA In cryptography, the Elliptic Curve Digital Signature Algorithm (ECDSA) offers a variant of the Digital Signature Algorithm (DSA) which uses elliptic-curve cryptography. Key and signature sizes As with elliptic-curve cryptography in general, the ...

and ECDH algorithms. It is a 384-bit curve over a

finite field In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field (mathematics), field that contains a finite number of Element (mathematics), elements. As with any field, a finite field is a Set (mathematics), s ...

of prime order approximately . Its binary representation has 384 bits, with a simple pattern. The curve is given by the equation , where is given by a certain 384-bit number. The curve has order less than the field size. The bit-length of a key is considered to be that of the order of the curve, which is also 384 bits.

Notes

External links

* FIPS 186-4 standards where the curve is define

* Commercial National Security Algorithm (CNSA) Suite Factshee

Cryptography standards Elliptic curves {{Crypto-stub