Results 1 
5 of
5
An Application of a Fast Data Encryption Standard Implementation
 Computing Systems
, 1988
"... ABSTRACT: 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 mathe ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
ABSTRACT: 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 specifrc computer).
Key Scheduling in DES Type Cryptosystems
 in Advances in Cryptology: Auscrypt '90 (Lecture Notes in Computer Science
, 1990
"... This paper reviews some possible design criteria for the key schedule in a DES style cryptosystem. The key schedule involves a Key Rotation component, and the permutation PC2. Together these provide for a diffusion of dependency ofciphertext bits on key bits. Some empirical rules which seem to accou ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
This paper reviews some possible design criteria for the key schedule in a DES style cryptosystem. The key schedule involves a Key Rotation component, and the permutation PC2. Together these provide for a diffusion of dependency ofciphertext bits on key bits. Some empirical rules which seem to account for the derivation of the key schedule used in the DES are first presented. Anumber of trials were run with various key schedules, and some further design rules were derived. An alternative form of key schedule was then tested. This used either a null PC2, or one in which permutations only occurred within the inputs to a given Sbox, and a much larger rotation schedule than used in the DES. This was found to be as effective as the key schedule used in the current DES, and is proposed for use in new cryptosystems. 1.
On the Design of Permutation P in DES Type Cryptosystems
 Advances in Cryptology: Proceedings of EUROCRYPT ’89
, 1990
"... This paper reviews some possible design criteria for the permutation P in a DES style cryptosystem. These permutations provide the diffusion component in a substitutionpermutation network. Some empirical rules which seem to account for the derivation of the permutation used in the DES are first pre ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This paper reviews some possible design criteria for the permutation P in a DES style cryptosystem. These permutations provide the diffusion component in a substitutionpermutation network. Some empirical rules which seem to account for the derivation of the permutation used in the DES are first presented. Then it is noted that these permutations may be regarded as latinsquares which link the outputs of Sboxes to their inputs at the next stage. A subset of these with an extremely regular structure, and which perform well in a dependency analysis are then presented and suggested for use in future schemes of both current and extended versions of the DES. 1.
A HighSpeed Software DES Implementation
 Computer Communications Research Group
, 1989
"... This paper describes a highspeed software implementation of the Data Encryption Standard (DES) cipher algorithm and the design tradeoffs necessary for highspeed operation. Many of the techniques presented in this paper may be applicable to other product ciphers. 1 Introduction Data security is be ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes a highspeed software implementation of the Data Encryption Standard (DES) cipher algorithm and the design tradeoffs necessary for highspeed operation. Many of the techniques presented in this paper may be applicable to other product ciphers. 1 Introduction Data security is becoming more important as more information is sent across networks. Once information is injected into the network, it may be intercepted in any number of locations. One way to protect information, whether it is transmitted or remains on a host computer, is to encrypt it. A popular form of encryption is the Data Encryption Standard or DES. This paper describes a highspeed software implementation of the DES encryption algorithm. The encryption rate on a DEC 3100 or a Sun 4 is about 1.1 megabits per second. The implementation and the design tradeoffs necessary for highspeed encryption are described. Many of the techniques used in this paper may be applicable to other product ciphers. The first...
unknown title
"... The literature of cryptography has a curious history. Secrecy, of course, has always played a central role, but until the First World War, important developments appeared in print in a more or less timely fashion and the field moved forward in much the same way as other specialized disciplines. As l ..."
Abstract
 Add to MetaCart
The literature of cryptography has a curious history. Secrecy, of course, has always played a central role, but until the First World War, important developments appeared in print in a more or less timely fashion and the field moved forward in much the same way as other specialized disciplines. As late as 1918, one of the most influential cryptanalytic papers of the twentieth century, William F. Friedman’s monograph The Index of Coincidence and Its Applications in Cryptography, appeared as a research report of the private Riverbank Laboratories [577]. And this, despite the fact that the work had been done as part of the war effort. In the same year Edward H. Hebern of Oakland, California filed the first patent for a rotor machine [710], the device destined to be a mainstay of military cryptography for nearly 50 years. After the First World War, however, things began to change. U.S. Army and Navy organizations, working entirely in secret, began to make fundamental advances in cryptography. During the thirties and forties a few basic papers did appear in the open literature and several treatises on the subject were published, but the latter were farther and farther behind the state of the art. By the end of the war the transition was complete. With one notable exception, the public literature had died. That exception was Claude Shannon’s paper “The Communication Theory of Secrecy Systems, ” which