Patterns of entropy drop of the key in an S-Box of the DES

2Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The S-boxes used in the DES have been looked at in various aspects like non-linearity,propagation characteristics and 1/0 correlation immunity. In the present work we try to make a cryptographic study of these boxes from a new viewpoint, namely,by investigating the way in which the uncertainty of the 6-bit key vector k which controls the work of an S-box diminishes,when a certain set of distinct plaintext vectors.

Cite

CITATION STYLE

APA

Zeng, K. C., Yang, J. H., & Dai, Z. T. (1988). Patterns of entropy drop of the key in an S-Box of the DES. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 293 LNCS, pp. 438–444). Springer Verlag. https://doi.org/10.1007/3-540-48184-2_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free