Linear Ciphers - Introduction to Cryptography with Java Applets - page 107

-143 ? -144 ? -145 ? -146 ? -147 ? -148 ? -149 ? -150 ? -151 ? -152 ?

-153 ? -154 ? -155 ? -156 ? -157 ? -158 ? -159 ? -160 á -161 í -162 ó

-163 ú -164 ñ -165 Ñ -166 ª -167 º -168 ¿ -169 ⌐ -170 ¬ -171 ½ -172 ¼

-173 ¡ -174 « -175 » -176 ░ -177 ▒ -178 ▓ -179 -180 -181 ╡ -182 ╢

-183 ╖ -184 ╕ -185 ╣ -186 ║ -187 ╗ -188 ╝ -189 ╜ -190 ╛ -191 -192

-193 -194 -195 -196 -197 -198 ╞ -199 ╟ -200 ╚ -201 ╔ -202 ╩

-203 ╦ -204 ╠ -205 ═ -206 ╬ -207 ╧ -208 ╨ -209 ╤ -210 ╥ -211 ╙ -212 ╘

-213 ╒ -214 ╓ -215 ╫ -216 ╪ -217 -218 -219 █ -220 ▄ -221 ▌ -222 ▐

-223 ▀ -224 α -225 ß -226 Γ -227 π -228 Σ -229 σ -230 µ -231 τ -232 Φ

-233 Θ -234 Ω -235 δ -236 -237 φ -238 ε -239 -240 -241 ± -242 ≥

-243 ≤ -244 ⌠ -245 ⌡ -246 ÷ -247 ≈ -248 ° -249 · -250 · -251 -252 ⁿ

-253 ² -254 -255 -

Java Algorithm. Writing a program to encipher and decipher using shift transforma-
tions is very easy. In our Java programs, we will map bytes to bytes. The following is a pro-
gram to encipher with shift transformations in Java. The modulus, however, is now 256.
This is because the numeric range of a single byte is 0 through 255.
I have written an applet called TestCaesarCipherApplet which shows how the Caesar
cipher operates. It can be found on, and run from. Two pictures are
shown in Figures 5.1 and 5.2.

FIGURE 5.1