Sonmez Turan, M.
and Peralta, R.
(2021),
On the Multiplicative Complexity of Cubic Boolean Functions, Cryptology ePrint Archive, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=932391, https://eprint.iacr.org/2021/1041
(Accessed April 26, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
On the Multiplicative Complexity of Cubic Boolean Functions
Published
Author(s)
,
Abstract
Multiplicative complexity is a relevant complexity measure for many advanced cryptographic protocols such as multi-party computation, fully homomorphic encryption, and zero-knowledge proofs, where processing AND gates is more expensive than processing XOR gates. For Boolean functions, multiplicative complexity is defined as the minimum number of AND gates that are sufficient to implement a function with a circuit over the basis (AND, XOR, NOT). In this paper, we study the multiplicative complexity of cubic Boolean functions. We propose a method to implement a cubic Boolean function with a small number of AND gates and provide upper bounds on the multiplicative complexity that are better than the known generic bounds.Citation
Cryptology ePrint Archive
Volume
2021
Pub Weblink
Pub Type
Websites
Download Paper
Keywords
secret-key cryptography, Multiplicative Complexity, Cubic Boolean Function
Citation
Created August 11, 2021, Updated November 29, 2022