next up previous
Up: Math 65S Home Page

Assignment #9, Due 15 Nov

1.
Bitstorm: A problem in steganography, by Stephen Greenfield
 
\includegraphics {bitstorm2.eps}

BITSTORM, copyright 1999, Stephen Greenfield

Describe carefully at least 3 ways to hide 20 bits in the picture below, without harming its artistic integrity or quality [*]. 20 bits is enough to encode more than a million distinct numbers since 220 is 1,048,576.

2.
Make a steganographic picture of your own. Explain how you would use it to send a message. Does your system have a key? Or can anyone who finds the message read it?

About this document ...

Assignment #9, Due 15 Nov

This document was generated using the LaTeX2HTML translator Version 97.1 (release) (July 13th, 1997)

Copyright © 1993, 1994, 1995, 1996, 1997, Nikos Drakos, Computer Based Learning Unit, University of Leeds.

The command line arguments were:
latex2html -link 0 -split +0 bitstorm.tex.

The translation was initiated by Joshua Holden on 11/13/2000


Footnotes

...quality
Assuming there is any.



Joshua Holden
11/13/2000