sqrti returns two integers (l,b) so that l <= sqrt i <= b.
The implementation is quite naive, use an approximation for the first number
and use a dichotomy algorithm to compute the bound relatively efficiently.
Modulecrypton-1.0.6Haskell2010
Crypto.Number.Basic
- Packagecrypton-1.0.6
- Exports7
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceBasic.hs
Get the extended GCD of two integer using integer divMod
gcde a b find (x,y,gcd(a,b)) where ax + by = d
Check if a list of integer are all even
Compute the binary logarithm of a integer
Compute the number of bits for an integer
Compute the number of bytes for an integer
Express an integer as an odd number and a power of 2