| License | BSD-style |
|---|---|
| Maintainer | Vincent Hanquez <vincent@snarc.org> |
| Stability | experimental |
| Portability | Good |
| Safe Haskell | None |
| Language | Haskell2010 |
Crypto.Number.Basic
Description
Documentation
sqrti :: Integer -> (Integer, Integer) #
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.
gcde :: Integer -> Integer -> (Integer, Integer, Integer) #
Get the extended GCD of two integer using integer divMod
gcde a b find (x,y,gcd(a,b)) where ax + by = d
asPowerOf2AndOdd :: Integer -> (Int, Integer) #
Express an integer as an odd number and a power of 2