论文信息 - The Importance of "Good" Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys)

The Importance of "Good" Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys)

In DES the key scheduling scheme uses mainly shift registers. By modifying this key scheduling, conventional cryptosystems can be designed which are, e.g., strong against exhaustive key search attacks (without increasing the key size), or have public key like properties. Other effects obtainable by modifying the key scheduling and their importance are discussed.

[1] Whitfield Diffie,et al. Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard , 1977, Computer.

[2] Ralph C. Merkle,et al. Secure communications over insecure channels , 1978, CACM.

[3] Martin E. Hellman,et al. A cryptanalytic time-memory trade-off , 1980, IEEE Trans. Inf. Theory.

[4] Alan G. Konheim. Cryptography, a primer , 1981 .

[5] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[6] J. Quisquater,et al. Fast decipherment algorithm for RSA public-key cryptosystem , 1982 .

[7] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[8] Yvo Desmedt,et al. Dependence of Output on Input in DES: Small Avalanche Characteristics , 1985, CRYPTO.

[9] Michael Walker,et al. Key Management for Secure Electronic Funds Transfer in a Retail Environment , 1985, CRYPTO.

[10] Yvo Desmedt,et al. Efficient Hardware Implementation of the DES , 1985, CRYPTO.

[11] Ronald L. Rivest,et al. Is DES a Pure Cipher? (Results of More Cycling Experiments on DES) , 1985, CRYPTO.

[12] Yvo Desmedt,et al. Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences , 1985, CRYPTO.

[13] Ralph Howard,et al. Data encryption standard , 1987 .