We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Generating binary diffusion layers with maximum/high branch numbers and low search complexity.
- Authors
Akleylek, Sedat; Sakallı, Muharrem Tolga; Öztürk, Emir; Mesut, Andaç Şahin; Tuncay, Gökhan
- Abstract
In this paper, we propose a new method to generate n × n binary matrices (for n = k·2 t where k and t are positive integers) with a maximum/high of branch numbers and a minimum number of fixed points by using 2 t×2 t Hadamard (almost) maximum distance separable matrices and k × k cyclic binary matrix groups. By using the proposed method, we generate n × n (for n = 6, 8, 12, 16, and 32) binary matrices with a maximum of branch numbers, which are efficient in software implementations. The proposed method is also applicable with m × m circulant matrices to generate n × n(for n = k· m) binary matrices with a maximum/high of branch numbers. For this case, some examples for 16 × 16, 48 × 48, and 64 × 64 binary matrices with branch numbers of 8, 15, and 18, respectively, are presented. Copyright © 2016 John Wiley & Sons, Ltd.
- Subjects
DIFFUSION coefficients; BLOCK ciphers; BINARY codes; MATRICES (Mathematics); COMPUTER software development
- Publication
Security & Communication Networks, 2016, Vol 9, Issue 16, p3558
- ISSN
1939-0114
- Publication type
Article
- DOI
10.1002/sec.1561