On Sep 22, 9:10 pm, Paul Rubin <http://phr...@NOSPAM.invalid> wrote:
> Certainly xgcd should be in the math library or somewhere similar.

It does feel odd to have modular exponentiation in the core but no
other number-theoretic stuff in core+libraries. Perhaps a proposal on
python-ideas is in order... Though it's not clear what else would be
useful; primality testing and factoring are obvious candidates, but I
don't much fancy writing an MPQS factorization algorithm in Python.
Well okay, I take that back---I wouldn't mind *writing* it; I just
wouldn't expect to get much speed from *running* it. Miller-Rabin
probabilistic primality testing would be easy to implement though.

Anyway, I'm getting way off-topic here... sorry.

>
> Not necessarily. See for example http://trevp.net/tlslite

Interesting. Thanks for the link.

Richard