The Data Encryption Standard is used as the basis for the UNIX password encryption scheme. Some of the security of that scheme depends on the speed of the implementation. This paper presents a mathematical formulation of a fast implementation of the DES in software, discusses how the mathematics can be translated into code, and then analyzes the UNIX password scheme to show how these results can be used to implement it. Experimental results are provided for several computers to show that the given method speeds up the computation of a password by roughly 20 times (depending on the specific computer).
[1]
Alan G. Konheim.
Cryptography, a primer
,
1981
.
[2]
Ralph Howard,et al.
Data encryption standard
,
1987
.
[3]
Yvo Desmedt,et al.
Efficient Hardware Implementation of the DES
,
1985,
CRYPTO.
[4]
Yvo Desmedt,et al.
Efficient Hardware and Software Implementations for the DES
,
1985,
CRYPTO.
[5]
Ken Thompson,et al.
Password security: a case history
,
1979,
CACM.
[6]
Joos Vandewalle,et al.
Analytical Characteristics of the DES
,
1983,
CRYPTO.