Fast Software Encryption
From MaRDI portal
Publication:5902479
DOI10.1007/B93938zbMath1242.94025OpenAlexW2505253445WikidataQ56387660 ScholiaQ56387660MaRDI QIDQ5902479
Publication date: 5 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b93938
Related Items (12)
Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties ⋮ Investigation of some cryptographic properties of the \(8 \times 8\) S-boxes created by quasigroups ⋮ Analysis of affinely equivalent Boolean functions ⋮ Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables ⋮ Cryptographic properties of modified AES-like S-boxes ⋮ Parameterized hash functions ⋮ Rotation symmetry in algebraically generated cryptographic substitution tables ⋮ Affine equivalence in the AES round function ⋮ Scalable PP-1 block cipher ⋮ Results on rotation-symmetric S-boxes ⋮ Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions ⋮ Results on symmetric S-boxes constructed by concatenation of RSSBs
This page was built for publication: Fast Software Encryption