256-bit NIST domain Elliptic Curve operation optimization details of the second (fast reduction of the final processing of the modulo operation)

This is the generation formula for the 256-bit NIST prime-domain elliptic curve primes p:

p256 = (2 ^ 256)? (2 ^ 224) + (2 ^ 192) + (2 ^ 96)? 1

The 64-bit section breaks it down into an addition vector as follows:

1 0000000000000001 0000000000000000 0000000100000000 0000000000000000-0000000100000000 0000000000000000 0000000000000000 0000000000000001= ffffffff00000001 0000000000000000 00000000ffffffff ffffffffffffffff

Having a positive integer n, whose value is within the interval [0,16], the n multiples of the prime p can be used as follows

(not to be continued)

256-bit NIST domain Elliptic Curve operation optimization details of the second (fast reduction of the final processing of the modulo operation)