All Questions

In the Schoof's algorithm we are particularly interested in $char(K)>3$, where $K$ is the field. I know Schoof's algorithm is mostly used over large prime fields. Also, when we are transforming ...

I'm implementing arithmetics for elliptic curves over secp256r1 as a homework assignment. For scalar multiplication, the assignment specifically specifies that $k$ is "any hexidecimal encoded integer"...