NAME

Crypt::Perl::RSA - RSA in pure Perl (really!)

SYNOPSIS

    my $prkey1 = Crypt::Perl::RSA::Parse::private($pem_or_der);
    my $pbkey1 = Crypt::Perl::RSA::Parse::public($pem_or_der);
    #----------------------------------------------------------------------
    my $prkey = Crypt::Perl::RSA::Generate::generate(2048);
    my $der = $prkey->to_der();
    my $der2 = $prkey->to_pem();
    #----------------------------------------------------------------------
    my $msg = 'My message';
    my $sig = $prkey->sign_RS256($msg);
    die 'Wut' if !$prkey->verify_RS256($msg, $sig);
    die 'Wut' if !$pbkey->verify_RS256($msg, $sig);

DISCUSSION

See the documentation for Crypt::Perl::RSA::PublicKey and Crypt::Perl::RSA::PrivateKey for more on what these interfaces can do.

NOTE: The RSA logic here is ported from Kenji Urushima’s jsrsasign <http://kjur.github.io/jsrsasign/>.

SECURITY

RSA is safe as long as factorization is “hard”. As computers get faster, RSA keys have needed to get bigger and bigger to maintain the “difficulty” of factoring the key’s modulus. RSA will eventually no longer be viable toward this end: as RSA keys get bigger, the security advantage of increasing their size diminishes.

SPEED

Key generation is probably generally useful only with an XS-based backend to Math::BigInt. Once Math::Prime::Util is installable without a compiler I’ll replace Math::ProvablePrime here with Math::Prime::Util, which should speed things up significantly.

TODO

This minimal set of functionality can be augmented as feature requests come in. Ideas:

• Support signature schemes besides PKCS #1 v1.5.
• Use faster prime-number-finder logic if it’s available.