On the Construction of and Binary Matrices with Good Implementation Properties for Lightweight Block Ciphers and Hash Functions

Muharrem Tolga Sakallı, Sedat Akleylek, Bora Aslan, Ercan Buluş and Fatma Büyüksaraçoğlu Sakallı

Mathematical Problems in Engineering, 2014, vol. 2014, 1-12

Abstract:

We present an algebraic construction based on state transform matrix (companion matrix) for (where , being a positive integer) binary matrices with high branch number and low number of fixed points. We also provide examples for and binary matrices having advantages on implementation issues in lightweight block ciphers and hash functions. The powers of the companion matrix for an irreducible polynomial over with degree 5 and 4 are used in finite field Hadamard or circulant manner to construct and binary matrices, respectively. Moreover, the binary matrices are constructed to have good software and hardware implementation properties. To the best of our knowledge, this is the first study for (where , being a positive integer) binary matrices with high branch number and low number of fixed points.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/540253.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/540253.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:540253

DOI: 10.1155/2014/540253

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().