c " $c " d " $d " n " $n "
"` date=`date | sed 's\:\_\g' | sed 's\ \_\g'` -#echo $date +echo "date on this server" $date + +echo "" + -# create a bc script to calculate this. -# php5 is sopposed to have bc embedded... -# -cat calc_big_expon.bc > calc_big_expon.$$.$date.bc #echo " calc_big_expon.bc > calc_big_expon.$$.$date.bc "; -echo "r=1;" >> calc_big_expon.$$.$date.bc -echo "t($c,$d,$n);" >> calc_big_expon.$$.$date.bc -echo "r;" >> calc_big_expon.$$.$date.bc +echo "
" +echo "created a custom bash script to run to decode using the secret key using residues" +echo "
" +echo " custom bc script produced " +echo "
" +cat calc_big_expon.bc +echo "r=1;" +echo "t($c,$d,$n);" +echo "r;" +echo "" -#echo "invoking bc " -#more calc_big_expon.$$.$date.bc -#bc < calc_big_expon.$$.$date.bc -#echo "bc invoked " -#ls -l calc_big_expon.$$.$date.bc -result=`bc < calc_big_expon.$$.$date.bc | tail -1` -#echo $args $result -echo $result -rm -rf calc_big_expon.$$.$date.bc +echo "
" +Use the above bc script to decode the message. +echo "
" diff --git a/decode.php b/decode.php index 640c4cb..1ef05f2 100644 --- a/decode.php +++ b/decode.php @@ -1,7 +1,7 @@
Encode integer 'm'
- The number of digits produced by the exponentiation of c^d is greater than 100,0000 "; + echo "The number of digits produced by the exponentiation of c^d is greater than 100,000
"; echo "The resursive (see recursive exponentiation break down ) routines will be applied instead to calculate c^d%n
"; $clear = `./cbe.sh 'A $c B $d C $n D'`; // php is very nasty about sending multiple args to scripts - echo "this gives the 'in clear' result
"; - echo $clear; + echo $clear; + echo "The resursive routines can take some time to run, too long to leave a web page waitng!
"; + echo "If you don't have `bc' on your system, grow up and get a proper operating system.
"; } +$me = `whoami`; $date = `date`; -printf("End Time == %s
\n",$date); +printf("End Time == %s me=%s
\n",$date,$me); printf(" - +@@ -96,7 +96,7 @@ to the power of e, and then applying the modulus for n (i.e. p times q).
- +
The decoding process calculates the value of c ^ d % n. @@ -105,10 +105,10 @@ to the power of e, and then applying the modulus for n (i.e. p times q). The value c ^ d ( ) in this case would produce a number with approx - decimal digits ! + decimal digits !
-Obviously this is unacceptable and would cause memory and processing time problems. @@ -117,11 +117,11 @@ to the power of e, and then applying the modulus for n (i.e. p times q).
Note that for this very large value, the bc script may take up to - minutes to finish this calculation.
- +- -
Find d, the private key
- -> -> -> -> -> -> +> +> +> +> +> +>
diff --git a/find_phi.php b/find_phi.php
index 0b30d54..db1e1da 100644
--- a/find_phi.php
+++ b/find_phi.php
@@ -1,7 +1,7 @@
Generating PHI the secret Modulus- which is the result of (%s-1)*(%s-1) \n", $p,$q); |
- + | - + | -> -> -> -> +> +> +> +>
Web Mastery Course : Assignment Work
+ This web site is a submission for the Web Mastery course held at Brighton University from the 15th of March to the 19th of March 2003. @@ -35,14 +36,20 @@ private key parts may take several minutes to calculate. The assignment web application RSA Work Bench / Simulator- +
+
+p.s. +
+If this software is installed be sure to chmod +x the sh and bc files. +
-
Last updated 16Apr2004 
R.P.Clark.
+Last updated 25JAN2016: 16Apr2004 R.P.Clark.
+ diff --git a/multiply.php b/multiply.php index e6f16c2..c2243d4 100644 --- a/multiply.php +++ b/multiply.php @@ -1,7 +1,7 @@
Public Key 'Modulus' Generation
-",$k-1);| p | - + | - + |