Most cryptography operations happen inside a prime field and require efficient modular multiplication (reduction). This is difficult to implement in a normal BigUint since that would involve expensive division operations.
An alternate way is to represent elements in Montgomery form (https://en.wikipedia.org/wiki/Montgomery_modular_multiplication) which is what most crypto libraries do
Most cryptography operations happen inside a prime field and require efficient modular multiplication (reduction). This is difficult to implement in a normal
BigUintsince that would involve expensive division operations. An alternate way is to represent elements in Montgomery form (https://en.wikipedia.org/wiki/Montgomery_modular_multiplication) which is what most crypto libraries do