Back to Search
Start Over
Multiplicative Complexity of XOR Based Regular Functions.
- Source :
- IEEE Transactions on Computers; Nov2022, Vol. 71 Issue 11, p2927-2939, 13p
- Publication Year :
- 2022
-
Abstract
- XOR-AND Graphs (XAGs) are an enrichment of the classical AND-Inverter Graphs (AIGs) with XOR nodes. In particular, XAGs are networks composed by ANDs, XORs, and inverters. Besides several emerging technologies applications, XAGs are often exploited in cryptography-related applications based on the multiplicative complexity of a Boolean function. The multiplicative complexity of a function is the minimum number of AND gates (i.e., multiplications) that are sufficient to represent the function over the basis {AND, XOR, NOT}. In fact, the minimization of the number of AND gates is important for high-level cryptography protocols such as secure multiparty computation, where processing AND gates is more expensive than processing XOR gates. Moreover, it is an indicator of the degree of vulnerability of the circuit, as a small number of AND gates corresponds to a high vulnerability to algebraic attacks. In this paper we study the multiplicative complexity of Boolean functions characterized by two particular regularities, called autosymmetry and D-reducibility. Moreover, we exploit these regularities for decreasing the number of AND nodes in XAGs. The experimental results validate the proposed approaches. [ABSTRACT FROM AUTHOR]
- Subjects :
- BOOLEAN functions
TECHNOLOGICAL innovations
LOGIC design
LOGIC circuits
Subjects
Details
- Language :
- English
- ISSN :
- 00189340
- Volume :
- 71
- Issue :
- 11
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Computers
- Publication Type :
- Academic Journal
- Accession number :
- 160620857
- Full Text :
- https://doi.org/10.1109/TC.2022.3141249