Lines Matching full:compute
64 Compute montgomery coeff r, r^2 and mpinv. pbitlen is the size
75 Compute division coeffs p_normalized, p_shift and p_reciprocal.
479 # *| UF 1. Compute h = H(m)
484 # *| F 5. Compute W = (W_x,W_y) = kG
485 # *| F 6. Compute r = W_x mod q
488 # *| F 9. Compute s = k^-1 * (xr + e) mod q
500 # Compute the hash
527 # *| UF 2. Compute h = H(m)
530 # *| F 4. Compute e = OS2I(h) mod q
531 # *| F 5. Compute u = (s^-1)e mod q
532 # *| F 6. Compute v = (s^-1)r mod q
533 # *| F 7. Compute W' = uG + vY
535 # *| F 9. Compute r' = W'_x mod q
553 # Compute the hash
575 # *| IUF 1. Compute h = H(z||m)
579 # *| F 4. Compute W = (W_x,W_y) = kG
580 # *| F 5. Compute r = h(FE2OS(W_x)).
583 # *| F 7. Compute e = OS2I(r XOR h) mod q
584 # *| F 8. Compute s = x(k - e) mod q
596 # Compute the certificate data
606 # Compute the hash
634 # *| IUF 3. Compute h = H(z||m)
637 # *| F 5. Compute e = OS2I(r XOR h) mod q
638 # *| F 6. Compute W' = sY + eG, where Y is the public key
639 # *| F 7. Compute r' = h(FE2OS(W'x))
662 # Compute the certificate data
671 # Compute the hash
687 # *| I 2. Compute W = (W_x,W_y) = kG
688 # *| I 3. Compute r = FE2OS(W_x)||FE2OS(W_y)
690 # *| IUF 5. Compute h = H(r||m)
691 # *| F 6. Compute e = OS2I(h) mod q
692 # *| F 7. Compute s = (k + ex) mod q
726 # *| IUF 3. Compute h = H(r||m)
727 # *| F 4. Convert h to an integer and then compute e = -h mod q
728 # *| F 5. compute W' = sG + eY, where Y is the public key
729 # *| F 6. Compute r' = FE2OS(W'_x)||FE2OS(W'_y)
777 # *| UF 1. Compute h = H(m)
779 # *| F 3. Compute W = (W_x,W_y) = kG
780 # *| F 4. Compute r = W_x mod q
782 # *| F 6. Compute e = OS2I(h) mod q. If e is 0, set e to 1.
786 # *| F 7. Compute s = (rx + ke) mod q
823 # *| F 2. Compute h = H(m)
824 # *| F 3. Compute e = OS2I(h)^-1 mod q
828 # *| F 4. Compute u = es mod q
829 # *| F 4. Compute v = -er mod q
830 # *| F 5. Compute W' = uG + vY = (W'_x, W'_y)
831 # *| F 6. Let's now compute r' = W'_x mod q
867 # *| UF 1. Compute h = H(m). If |h| > bitlen(q), set h to bitlen(q)
871 # *| F 4. Compute W = (W_x,W_y) = kG
872 # *| F 5. Compute r = W_x mod q
874 # *| F 7. Compute s = x(kr + e) mod q
909 # *| UF 2. Compute h = H(m). If |h| > bitlen(q), set h to bitlen(q)
911 # *| F 3. Compute e = OS2I(h) mod q
912 # *| F 4. Compute u = ((r^-1)e mod q)
913 # *| F 5. Compute v = ((r^-1)s mod q)
914 # *| F 6. Compute W' = uG + vY
915 # *| F 7. Compute r' = W'_x mod q
952 # *| I 2. Compute W = kG = (Wx, Wy)
953 # *| IUF 3. Compute r = H(Wx [|| Wy] || m)
956 # *| F 4. Compute e = OS2I(r) mod q
958 # *| F 6. Compute s = (k + ex) mod q.
998 # *| I 2. Compute e = -r mod q
1000 # *| I 4. Compute W' = sG + eY
1001 # *| IUF 5. Compute r' = H(W'x [|| W'y] || m)
1453 # Compute the rounded word size for each word size
1466 # Compute some parameters
1470 # Compute p_reciprocal for each word size
1474 # Compute the number of points on the curve
1568 " * Compute max bit length of all curves for p and q\n"+\
1593 " * Compute and adapt max name and oid length\n"+\