Bitwise Linear Mappings with Good Cryptographic Properties and Efficient Implementation

S.  M.  Dehnavi; A.  Mahmoodi Rishakani; M.  R.  Mirzaee Shamsabad

Paper 2015/225

Bitwise Linear Mappings with Good Cryptographic Properties and Efficient Implementation

S. M. Dehnavi, A. Mahmoodi Rishakani, and M. R. Mirzaee Shamsabad

Abstract

Linear mappings are crucial components of symmetric ciphers. A special type of linear mappings are (0,1)-matrices which have been used in symmetric ciphers such as ARIA, E2 and Camellia as diffusion layers with efficient implementation. Bitwise linear maps are also used in symmetric ciphers such as SHA family of hash functions and HC family of stream ciphers. In this article, we investigate a special kind of linear mappings: based upon this study, we propose several linear mappings with only XOR and rotation operations. The corresponding matrices of these mappings can be used in either the former case as (0,1)-matrices of maximal branch number or in the latter case as linear mappings with good cryptographic properties. The proposed mappings and their corresponding matrices can be efficiently implemented both in software and hardware.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint. MINOR revision.
Contact author(s): std_dehnavism @ khu ac ir
History: 2016-05-07: last of 5 revisions; 2015-03-09: received; See all versions
Short URL: https://ia.cr/2015/225
License: CC BY

BibTeX

@misc{cryptoeprint:2015/225,
      author = {S.  M.  Dehnavi and A.  Mahmoodi Rishakani and M.  R.  Mirzaee Shamsabad},
      title = {Bitwise Linear Mappings with Good Cryptographic Properties and Efficient Implementation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/225},
      year = {2015},
      url = {https://eprint.iacr.org/2015/225}
}