Abstract
This paper discusses the chosen-plaintext attack and the known-plaintext attack on a graphical encryption method for encryption of computer data proposed by Charles Schwartz of the University of California at Berkeley in 1991. In cracking the Schwartz encryption method, this paper proposes what we call a mask approach. Using this approach, both chosen-plaintext attack and known-plaintext attack can break the Schwartz method. The mask approach is successful because the Schwartz method uses (1) exclusive-or (xor) operations, and (2) a process that is plaintext-independent.
| Original language | English |
|---|---|
| Pages (from-to) | 301-304 |
| Number of pages | 4 |
| Journal | Cryptologia |
| Volume | 17 |
| Issue number | 3 |
| DOIs | |
| State | Published - 07 1993 |
| Externally published | Yes |
Keywords
- Chosen-plaintext attack
- Exclusive-or operations
- Known-plaintext attack
- Mask
- Plaintext dependent/independent