Utility Functions

These functions support number theory operations used in cryptographic primitives.

Return a vector of primes in the given integer range.

Compute modular inverse using Fermat's Little Theorem (assumes prime p).

Check if a is a quadratic residue mod p (assumes p is prime).

Check if an integer is prime.