On hardware implementation of Tang-maitra Boolean functions

DOI10.1007/978-3-030-05153-2_6MaRDI QIDQ1725940zbMATH OpenOpenAlexFDO

Authors Mustafa Khairallah, A. Chattopadhyay, Bimal Mandal, Subhamoy Maitra

Publication date 15 February 2019

Full work available at URL https://doi.org/10.1007/978-3-030-05153-2_6

zbMATH Keywords

finite fieldsbent functionsBoolean functionsstream ciphercryptologyhardware implementation

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Recommendations

• Modifying Maiorana-McFarland type bent functions for good cryptographic properties and efficient implementation
• A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
• A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
• Concrete Multiplicative Complexity of Symmetric Functions
• The multiplicative complexity of Boolean functions on four and five variables

Cited in

(2)

• Modifying Maiorana-McFarland type bent functions for good cryptographic properties and efficient implementation
• A note on generalization of bent Boolean functions

This page was built for publication: On hardware implementation of Tang-maitra Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725940)