Lines Matching full:compute
99 *| UF 1. Compute h = H(m). If |h| > bitlen(q), set h to bitlen(q)
101 *| F 2. Compute e = - OS2I(h) mod q
103 *| F 4. Compute W = (W_x,W_y) = kG
104 *| F 5. Compute r = W_x mod q
106 *| F 7. Compute s = x(kr + e) mod q
172 /* 1. Compute h = H(m) */ in _ecgdsa_sign_update()
241 /* 1. Compute h = H(m) */ in _ecgdsa_sign_finalize()
265 * 2. Convert h to an integer and then compute e = -h mod q, in _ecgdsa_sign_finalize()
266 * i.e. compute e = - OS2I(h) mod q in _ecgdsa_sign_finalize()
268 * Because we only support positive integers, we compute in _ecgdsa_sign_finalize()
295 /* 4. Compute W = kG = (Wx, Wy) */ in _ecgdsa_sign_finalize()
307 /* 5. Compute r = Wx mod q */ in _ecgdsa_sign_finalize()
325 /* 7. Compute s = x(kr + e) mod q */ in _ecgdsa_sign_finalize()
397 *| UF 2. Compute h = H(m). If |h| > bitlen(q), set h to bitlen(q)
399 *| F 3. Compute e = OS2I(h) mod q
400 *| F 4. Compute u = ((r^-1)e mod q)
401 *| F 5. Compute v = ((r^-1)s mod q)
402 *| F 6. Compute W' = uG + vY
403 *| F 7. Compute r' = W'_x mod q
490 /* 2. Compute h = H(m) */ in _ecgdsa_verify_update()
540 /* 2. Compute h = H(m) */ in _ecgdsa_verify_finalize()
562 /* 3. Compute e by converting h to an integer and reducing it mod q */ in _ecgdsa_verify_finalize()
565 /* 4. Compute u = (r^-1)e mod q */ in _ecgdsa_verify_finalize()
570 /* 5. Compute v = (r^-1)s mod q */ in _ecgdsa_verify_finalize()
574 /* 6. Compute W' = uG + vY */ in _ecgdsa_verify_finalize()
577 /* 7. Compute r' = W'_x mod q */ in _ecgdsa_verify_finalize()