A Fast New DES Implementation in Software

A Fast New DES Implementation in Software (1997)

by Eli Biham

Citations:

54 - 2 self

Datum	Value	Source
TITLE	A Fast New DES Implementation in Software	SVM HeaderParse 0.1
AUTHOR NAME	Eli Biham	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science Department; Technion-- Israel Institute of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Haifa 32000, Israel	SVM HeaderParse 0.1
ABSTRACT	. In this paper we describe a fast new DES implementation. This implementation is about five times faster than the fastest known DES implementation on a (64-bit) Alpha computer, and about three times faster than than our new optimized DES implementation on 64-bit computers. This implementation uses a non-standard representation, and view the processor as a SIMD computer, i.e., as 64 parallel one-bit processors computing the same instruction. We also discuss the application of this implementation to other ciphers. We describe a new optimized standard implementation of DES on 64-bit processors, which is about twice faster than the fastest known standard DES implementation on the same processor. Our implementations can also be used for fast exhaustive search in software, which can find a key in only a few days or a few weeks on existing parallel computers and computer networks. 1 Introduction In this paper we describe a new implementation of DES[4], which can be very efficiently executed ...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	260--272	INFERENCE
CITATIONS	9 found	ParsCit 1.0