Using Content-Addressable Search Engines To Encrypt and Break DES (1993)
| Venue: | In Advances in Cryptology: CRYPTO ’92 Proceedings |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Wayner93usingcontent-addressable,
author = {Peter C. Wayner},
title = {Using Content-Addressable Search Engines To Encrypt and Break DES},
booktitle = {In Advances in Cryptology: CRYPTO ’92 Proceedings},
year = {1993},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A very simple parallel architecture using a modified version of content-addressable memory can be used to cheaply and efficiently encipher and decipher data with DES-like systems. The paper will describe how to implement DES on these modified content-addressable memories at speeds approaching some of the best specialized hardware. The chips can also be used to build a large scale engine for exhaustively searching the entire keyspace of DES. The original DES system was designed to be easily implemented in hardware [NBS77] and the current silicon manifestations of the cipher use modern processor design techniques to encipher and decipher information at about 1 to 20 megabits per second. Implementations of DES in software for standard CPUs, however, are markedly slower than specialized chips because many of the operations involved in DES are bit-level manipulations. As a result, many of the DES-like systems such as Merkle's Khufu [Mer90] were designed as replacements that could be easily...
