Skip to main content
Conference ProceedingsOPEN ACCESS

Good s-boxes are easy to find

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1990) 435 LNCS 612-615
DOI: 10.1007/0-387-34805-0_56
85Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We describe an efficient design methodology for the s-boxes of DES-like cryptosystems. Our design guarantees that the resulting s-boxes will be bijective and nonlinear and will exhibit the strict avalanche criterion and the output bit independence criterion.

Cite

CITATION STYLE

APA

Adams, C., & Tavares, S. (1990). Good s-boxes are easy to find. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 435 LNCS, pp. 612–615). Springer Verlag. https://doi.org/10.1007/0-387-34805-0_56

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