Open AccessLow multiplicative complexity logic minimisation over the basis (AND, XOR, NOT)
Author(s) -
Tay J.J.,
Wong M.L.D.,
Wong M.M.,
Zhang C.,
Hijazin I.
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2016.2123
Subject(s) - minimisation (clinical trials) , multiplicative function , heuristic , computer science , cryptography , algorithm , mathematics , theoretical computer science , artificial intelligence , statistics , mathematical analysis
Logic minimisation over the basis (AND, XOR, NOT) has received much attention in recent years. Heuristic logic minimisation methods based on the notion of multiplicative complexity c ∧ ( f ) have reported impressive results for well‐explored applications such as cryptographic S‐Boxes. However, the heuristic involves randomised selections in part of its algorithm. Studying the heuristic from a consistency perspective is carried out here. Enhancements to improve different aspects of the algorithm are proposed. The benefits of the proposed enhancements are demonstrated through experimental results in comparison with the original algorithm.