int sx_dsa_sign(struct sx_pk_cnx *cnx,
   const sx_op *p, const sx_op *q, const sx_op *g, const sx_op *k,
   const sx_op *privkey, const sx_op *h, sx_op *r, sx_op *s)

DSA signature generation

Computes the following: 1. X = g ^{k mod p 2. r = X mod q 3. if r == 0 the return ::SX_ERR_INVALID_SIGNATURE 4. else w = k} (-1) mod q 5. s = w * (h + x * r) mod q 6. if s == 0 then return ::SX_ERR_INVALID_SIGNATURE 7. (r,s) is the signature

SX_OK SX_ERR_NOT_INVERTIBLE SX_ERR_INVALID_SIGNATURE SX_ERR_INVALID_PARAM SX_ERR_UNKNOWN_ERROR SX_ERR_BUSY SX_ERR_NOT_IMPLEMENTED SX_ERR_OPERAND_TOO_LARGE SX_ERR_PLATFORM_ERROR SX_ERR_EXPIRED

struct sx_pk_dreq sx_async_dsa_ver_go(struct sx_pk_cnx *cnx,
   const sx_op *p, const sx_op *q, const sx_op *g, const sx_op *pubkey,
   const sx_op *h, const sx_op *r, const sx_op *s)

Asynchronous (non-blocking) DSA signature verification

Start an DSA signature verification on the accelerator and return immediately. When the operation finishes on the accelerator, call SX_PK_RELEASE_REQ()

sx_dsa_ver() for a synchronous version

Acquired acceleration request for this operation

int sx_dsa_ver(struct sx_pk_cnx *cnx,
   const sx_op *p, const sx_op *q, const sx_op *g, const sx_op *pubkey,
   const sx_op *h, const sx_op *r, const sx_op *s)

DSA signature verification

Checks if a signature is valid: 1. w = s ^{(-1) mod q 2. u1 = h * w mod q 3. u2 = r * w mod q 4. X = g} (u1) * y ^ (u2) mod p 5. v = X mod q 6. if v == r then signature is valid (::SX_OK) 7. else return ::SX_ERR_INVALID_SIGNATURE

Before launching the operation, verify the domain D(p,q,g) by checking: 1. 2^{1023 < p < 2}1024 \b or 2^{2047 < p < 2}2048 2. 2^{159 < q < 2}160 \b or 2^{223 < q < 2}224 \b or 2^{255 < q < 2}256 3. 1 < g < p

sx_async_dsa_ver_go() for an asynchronous version

SX_OK SX_ERR_NOT_INVERTIBLE SX_ERR_INVALID_SIGNATURE SX_ERR_OUT_OF_RANGE SX_ERR_INVALID_PARAM SX_ERR_UNKNOWN_ERROR SX_ERR_BUSY SX_ERR_NOT_IMPLEMENTED SX_ERR_OPERAND_TOO_LARGE SX_ERR_PLATFORM_ERROR SX_ERR_EXPIRED