From: Harvie <tomas@mudrunka.cz>
Date: Sun, 7 Nov 2010 23:01:39 +0000 (+0100)
Subject: TODO: Reimplement RSA.pl using chinese remainder theorem (too slow right now)
X-Git-Url: https://git.harvie.cz/?a=commitdiff_plain;h=7189c931e5db356ca29fb34d0ccd376357f54446;p=mirrors%2FPrograms.git

TODO: Reimplement RSA.pl using chinese remainder theorem (too slow right now)
---

diff --git a/perl/rsa.pl b/perl/rsa.pl
index 522be22..7c8b316 100755
--- a/perl/rsa.pl
+++ b/perl/rsa.pl
@@ -5,7 +5,7 @@ use bignum; #We'll need bignum for real messages
 
 sub rsa { #RSA (de)crypt function (message,modulus,exponent)
 	my ($msg,$m,$e) = @_;
-	($msg**$e)%($m);
+	($msg**$e)%($m); #TODO: reimplement using chinese remainder theorem (this is too slow!!!)
 }
 
 sub isprime { #Tell if number is prime or not (suboptimal)
@@ -40,6 +40,7 @@ print "\t[[[ Harvie's simple RSA demo ]]]\nfor study & testing purposes only (IN
 print "=== KEYS ===\nPUB: ($n,$e)\nPRV: ($n,$d)\n";
 
 my $msg=1337;
+$msg=$n-1;
 	print "=== TEST ===\nMSG: $msg\n";
 my $enc=rsa($msg,$n,$e); #encrypt
 	print "ENC: $enc\n";