Cryptology ePrint Archive: Report 2021/1041

Available versions in chronological order


On the Multiplicative Complexity of Cubic Boolean Functions
Meltem Sonmez Turan and Rene Peralta


[ Cryptology ePrint archive ]