Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2)

Published

April 21, 2018

Author(s)

Andrea Visconti, Chiara V. Schiavo, Rene Peralta

Abstract

Minimizing the Boolean circuit implementation of a given cryptographic function is an important issue. A number of papers only consider cancellation-free straight-line programs for producing short circuits over GF(2). The Boyar-Peralta (BP) heuristic yields a valuable tool for practical applications such as building fast software and low-power circuits for cryptographic applications, e.g. AES, HMAC-SHA-1, PRESENT, GOST, and so on. However, the BP heuristic does not take into account the matrix density. In a dense linear system the rows can be computed by adding or removing a few elements from a "common path" that is "close" to almost all rows. The new heuristic described in this paper will merge the ideas of "cancellation" and "common path". An extensive testing activity has been performed. Experimental results of the new and the BP heuristic were compared. They show that the Boyar-Peralta bounds are not tight on dense systems.

Citation

Information Processing Letters

Volume

137

Pub Type

Journals

Download Paper

https://doi.org/10.1016/j.ipl.2018.04.010

Local Download

Keywords

Gate complexity, linear systems, dense matrices, circuit depth, XOR gates.

Citation

Visconti, A. , Schiavo, C. and Peralta, R. (2018), Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2), Information Processing Letters, [online], https://doi.org/10.1016/j.ipl.2018.04.010, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=925478 (Accessed May 10, 2024)