2018/01/01 by Chuck Easttom · 1 citation
Computer Science · #Cryptographic Implementations and Security #Chaos-based Image/Signal Encryption #Coding theory and cryptography #Symmetric-key algorithm #Computer science #Cryptography #S-box #Cipher #Construct (python library) #Cryptographic primitive #Block cipher #Theoretical computer science #Stream cipher #Variety (cybernetics) #Encryption #Algorithm #Cryptographic protocol #Computer security #Programming language #Public-key cryptography #Artificial intelligence
paper · doi:10.1109/ccwc.2018.8301643
openalex publication_date 2018/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Symmetric ciphers are widely used for a variety of security purposes. These cryptographic primitives are ubiquitous. The primary source of non-linearity in any symmetric cryptographic primitive is the substitution box, or s-box. While there have been many proposals for varying ways to construct s-box's, this paper proposes a generalized methodology that can be used with any symmetric cipher, either in the creation of new s-boxes, during cipher design, the evaluation of the efficacy of existing s-boxes, or in the modification of s-boxes for existing ciphers. The current paper describes a generalized methodology for designing and testing s-boxes for symmetric ciphers. This methodology includes the application of three well-established tests that should be utilized for designing or testing every s-box. The study also indicates that at least some mathematical methods for designing s-boxes, while secure, are no more secure than non-mathematical methods, but are more computationally intensive.