Crypt

Easy

For those who want to be free from messy calculations in Cryptography.

Solving multiple congruence equations using Chinese remainder theorem

Calculate all the points of a non singular elliptic curve using a,b and p(p == 4k - 1)

Elliptic curve points addition. Also elliptic curve point scalar multiplication