Reference on LZW is the handout 320dir/lz.cc .
Notation on RSA is as in 320/rsa.mpl .
Exercises due Wednesday, 5/4/99
-
Give the 12 bit codeunits produced by the Limpel-Zev compaction of the
string "aaaaaaaaaa".
-
Give the encryption of those 12 bit codeunits using the RSA method
and keys generated by rsa.mpl (with maple) when p := 103 and q := 53.
-
Then verify correctness by decrypting and uncompressing.
[show your work]
-
In building RSA keys, what
is bad about it turning out that d is the square of a prime number
(for example when p := 101 and q := 103)?
You may use maple and the script 320/rsa.mpl (modified
as you wish) as tools while working this assignment.
Note that the Limpel-Zev implementation in lz.cc is incomplete,
so compression/decompression must be done by hand (but following the
procedures in lz.cc).
saunders@cis.udel.edu