Answer:
Answer for the question:
To compute a19 mod N, the modular exponential algorithms that we studied would do 8 modular multiplications (5 squarings and 3 multiplications by a). What is the minimum number of modular multiplications needed to compute a19 mod N if you are free to use any sequence of modular multiplications.)
is given in the attachment.
Step-by-step explanation:
Answer: B
Step-by-step explanation:
The line is curved which makes it a non-linear function.
I believe the answer would be one eighth or 1/8
Answer:
-3
Step-by-step explanation:
since the 9 in negative you subtract 9 by 6 and you get 3 then you put the negative sign in front of the 3 making it -3
