Paper 2018/667

On Hardware Implementation of Tang-Maitra Boolean Functions

Mustafa Khairallah, Anupam Chattopadhyay, Bimal Mandal, and Subhamoy Maitra


In this paper, we investigate the hardware circuit complexity of the class of Boolean functions recently introduced by Tang and Maitra (IEEE-TIT 64(1): 393 402, 2018). While this class of functions has very good cryptographic properties, the exact hardware requirement is an immediate concern as noted in the paper itself. In this direction, we consider different circuit architectures based on finite field arithmetic and Boolean optimization. An estimation of the circuit complexity is provided for such functions given any input size n. We study different candidate architectures for implementing these functions, all based on the finite field arithmetic. We also show different implementations for both ASIC and FPGA, providing further analysis on the practical aspects of the functions in question and the relation between these implementations and the theoretical bound. The practical results show that the Tang-Maitra functions are quite competitive in terms of area, while still maintaining an acceptable level of throughput performance for both ASIC and FPGA implementations.

Available format(s)
Publication info
Published elsewhere. MINOR revision.Arithmetic of Finite Fields 2018
Boolean FunctionsBent FunctionsCryptologyFinite FieldsHardware ImplementationStream Cipher
Contact author(s)
mustafam001 @ e ntu edu sg
2018-07-13: received
Short URL
Creative Commons Attribution


      author = {Mustafa Khairallah and Anupam Chattopadhyay and Bimal Mandal and Subhamoy Maitra},
      title = {On Hardware Implementation of Tang-Maitra Boolean Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2018/667},
      year = {2018},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.