NAME
Alt::Crypt::RSA::BigInt - Rewrite of Crypt::RSA
DESCRIPTION
This is a rework of Crypt::RSA to remove Math::Pari and instead base
all operations on Math::BigInt.
STATUS
Version 2.00 is intended to be a plug-in replacement for Crypt::RSA,
with no user-visible changes. This means some issues will remain
unresolved until future versions.
Math::Pari is completely removed. This includes the two modules:
- Crypt::Primes => Math::Prime::Util
- Crypt::Random => Bytes::Random::Secure
All operations are now performed using Math::BigInt, and prefer the
GMP and Pari backends.
PERFORMANCE
Performance using GMP is 3-10 times faster than the Crypt::RSA 1.99.
Using Math::BigInt::Pari, it is about half the speed at signing, and
on par when verifying.
If neither GMP nor Pari are available, performance is very slow, from
10x to 200x slower. However this is an environment where the original
code could not run.
AUTHOR
Vipul Ved Prakash wrote the original Crypt::RSA.
Dana Jacobsen did the changes to Math::BigInt.
COPYRIGHT AND LICENSE
Copyright (c) 2001 by Vipul Ved Prakash, 2012 by Dana Jacobsen.
This program is free software; you can redistribute it and/or modify it
under the same terms as Perl itself.