access icon free Constructing Odd-Variable Rotation Symmetric Boolean Functions with Optimal Algebraic Immunity and High Nonlinearity

Rotation symmetric Boolean functions (RSBFs) have attracted widespread attention due to their good cryptographic properties. We present a new construction of RSBFs with optimal algebraic immunity on odd number of variables. The nonlinearity of the new function is much higher than other best known RSBFs with optimal algebraic immunity. The algebraic degree of the constructed n-variable RSBF can achieve the upper bound n-1 when n/2 is odd or when n/2 is a power of 2 for n-11. In addition, the constructed function can possess almost perfect immunity to fast algebraic attacks for n=11, 13, 15

Inspec keywords: cryptography; Boolean functions

Other keywords: n-variable RSBF; fast algebraic attacks; constructed function; odd-variable rotation symmetric Boolean functions; cryptographic properties; perfect immunity; optimal algebraic immunity; algebraic degree

Subjects: Data security; Cryptography theory; Cryptography; Algebra; Algebra

http://iet.metastore.ingenta.com/content/journals/10.1049/cje.2018.01.009
Loading

Related content

content/journals/10.1049/cje.2018.01.009
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading