Copyright | (c) 2011 Daniel Fischer |
---|---|

License | MIT |

Maintainer | Daniel Fischer <daniel.is.fischer@googlemail.com> |

Safe Haskell | None |

Language | Haskell2010 |

Deprecated: This module will be removed in the next release

Factorisation proving the primality of the found factors.

For large numbers, this will be very slow in general.
Use only if you're paranoid or must be *really* sure.

## Synopsis

- certifiedFactorisation :: Integer -> [(Integer, Word)]
- certificateFactorisation :: Integer -> [((Integer, Word), PrimalityProof)]
- provenFactorisation :: Integer -> [((Integer, Word), PrimalityProof)]

# Documentation

certifiedFactorisation :: Integer -> [(Integer, Word)] Source #

produces the prime factorisation
of `certifiedFactorisation`

n`n`

, proving the primality of the factors, but doesn't report the proofs.

certificateFactorisation :: Integer -> [((Integer, Word), PrimalityProof)] Source #

produces a `certificateFactorisation`

n`provenFactorisation`

.

provenFactorisation :: Integer -> [((Integer, Word), PrimalityProof)] Source #

constructs a the prime factorisation of `provenFactorisation`

n`n`

(which must be positive) together with proofs of primality of the factors,
using trial division up to 2^16 and elliptic curve factorisation for the
remaining factors if necessary.

Construction of primality proofs can take a *very* long time, so this
will usually be slow (but should be faster than using `factorise`

and
proving the primality of the factors from scratch).