[−][src]Module jtm::brainpool_p256r1

https://andrea.corbellini.name/2015/05/23/elliptic-curve-cryptography-finite-fields-and-discrete-logarithms

Modules

paramiters	https://tools.ietf.org/html/rfc5639#section-3.4
util

ecdsa_sign	`f(BigUint) -> BigUint` is supposed to be a random number generator. Return a number from 0 to "less than" $1. In rare cases it'll be called multiple times, it's imperative that a diffrent number is returned!
ecdsa_verify
get_a
get_b
get_base_x
get_base_y
get_g
get_int_a
get_int_p
get_int_q
get_p
get_q
mod_floor_int_p
mod_floor_int_q
mod_floor_p
mod_floor_q
on_curve	https://github.com/alexmgr/tinyec/blob/a812431e7881ce9b509e5fe6322b401ce3235299/tinyec/ec.py#L37