Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions

DOI10.1109/TIT.2011.2145690zbMath1365.94445arXiv0910.4632OpenAlexW2128293480MaRDI QIDQ5273575

Meicheng Liu, Pei Dingyi, Dong-Dai Lin

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.4632

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items (13)

Constructing even-variable RSBFs with higher nonlinearity, optimal AI and almost optimal FAI ⋮ Constructions of balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity ⋮ Hamming weights of symmetric Boolean functions ⋮ Balanced \(2p\)-variable rotation symmetric Boolean functions with optimal algebraic immunity ⋮ Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction ⋮ Fast algebraic immunity of Boolean functions ⋮ Open Questions on Nonlinearity and on APN Functions ⋮ A Note on the Optimal Immunity of Boolean Functions Against Fast Algebraic Attacks ⋮ Enhanced Boolean functions suitable for the filter model of pseudo-random generator ⋮ Constructions of even-variable RSBFs with optimal algebraic immunity and high nonlinearity ⋮ Balanced \(2^k\)-variable rotation symmetric Boolean functions with optimal algebraic immunity ⋮ On the immunity of rotation symmetric Boolean functions against fast algebraic attacks ⋮ Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks

This page was built for publication: Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions