Name
Abstract | ||
|---|---|---|
In this study, the authors propose new methods using a divide-and-conquer strategy to generate n × n binary matrices (for composite n) with a high/maximum branch number and the same Hamming weight in each row and column. They introduce new types of binary matrices: namely, (BHwC)t, m and (BCwC)q, m types, which are a combination of Hadamard and circulant matrices, and the recursive use of circulan... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1049/iet-ifs.2016.0085 | IET Information Security |
Keywords | Field | DocType |
cryptography,divide and conquer methods,Hadamard matrices,search problems | Bit-length,Discrete mathematics,Logical matrix,Block cipher,Matrix (mathematics),Theoretical computer science,Circulant matrix,Hamming weight,Hadamard transform,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
11 | 4 | 1751-8709 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sedat Akleylek | 1 | 13 | 10.07 |
| Lars R. Knudsen | 2 | 90 | 8.42 |
| Muharrem Tolga Sakalli | 3 | 8 | 1.25 |
| Emir Öztürk | 4 | 0 | 0.68 |