Lightweight Dynamic Linear Components for Symmetric Cryptography

S. M. Dehnavi; M. R. Mirzaee Shamsabad

Paper 2024/1188

Lightweight Dynamic Linear Components for Symmetric Cryptography

S. M. Dehnavi

M. R. Mirzaee Shamsabad

Abstract

‎In this paper‎, ‎using the concept of equivalence of mappings we characterize all of the one-XOR matrices which are used in hardware applications and propose a family of lightweight linear mappings for software-oriented applications in symmetric cryptography‎. ‎Then‎, ‎we investigate interleaved linear mappings and based upon this study‎, ‎we present generalized dynamic primitive LFSRs along with dynamic linear components for construction of diffusion layers. ‎From the mathematical viewpoint‎, ‎this paper presents involutive sparse binary matrices as well as sparse binary matrices with sparse inverses‎. ‎Another interesting result of our investigation is that‎, ‎by our characterization of one-XOR matrices‎, ‎the search space for finding a $k$ such that $x^n+x^k+1$ is a primitive trinomial could be reduced‎.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
Keywords: One-XOR matrix‎‎Linear Dynamic Component‎‎Hardware implementation‎‎Software implementation‎‎Generalized LFSR‎
Contact author(s): dehnavism @ ipm ir
mmirzaeishams @ gmail com
History: 2024-07-25: approved; 2024-07-23: received; See all versions
Short URL: https://ia.cr/2024/1188
License: CC0

BibTeX

@misc{cryptoeprint:2024/1188,
      author = {S. M. Dehnavi and M. R. Mirzaee Shamsabad},
      title = {Lightweight Dynamic Linear Components for Symmetric Cryptography},
      howpublished = {Cryptology ePrint Archive, Paper 2024/1188},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/1188}},
      url = {https://eprint.iacr.org/2024/1188}
}