IACR Transactions on Symmetric Cryptology · 2016 · 44 citations · 4 references
ComputingComputer EngineeringComputer ScienceAlgorithmsComputer ArchitectureCryptographyBlock CiphersCryptographic ArchitectureCryptographic ComplexityHomomorphic EncryptionMatrix ComputationBlock Cipher DesignDiffusion Layer TheoryDiffusion LayersImplementation Cost AnalysisLightweight Block CiphersLightweight CryptographyLower Bound ComputationMds Codes
MDS matrices are used as building blocks of diffusion layers in block ciphers, and XOR count is a metric that estimates the hardware implementation cost. In this paper we report the minimum value of XOR counts of 4 × 4 MDS matrices over F24 and F28 , respectively. We give theoretical constructions of Toeplitz MDS matrices and show that they achieve the minimum XOR count. We also prove that Toeplitz matrices cannot be both MDS and involutory. Further we give theoretical constructions of 4 × 4 involutory MDS matrices over F24 and F28 that have the best known XOR counts so far: for F24 our construction gives an involutory MDS matrix that actually improves the existing lower bound of XOR count, whereas for F28 , it meets the known lower bound.
4