Algebraic normal form

Known as: ANF, Normal form

In Boolean algebra, the algebraic normal form (ANF), Zhegalkin normal form, or Reed–Muller expansion is a way of writing logical formulas in one of…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

The problem "Given a Boolean function $f$ of $n$ variables by its truth table vector. Find (if exists) a vector $\alpha \in \{0,1…

2018

Abstract Maximally nonlinear Boolean functions in n variables, where n is even, are called bent functions. There are several ways…

2017

Boolean functions are mappings $\{0,1\}^n\rightarrow \{0,1\}$, where n is a nonnegative integer. It is well known that each…

2015

we compute the lower bounds on higherorder nonlinearities of monomial partial-spreads type bent Boolean function ), ( ) ( 1 2 1 2…

2014

This paper was written during an enjoyable visit of S. G. at the Applied Mathematics Department of Naval Postgraduate School in…

2013

The present methods of constructing optimal algebraic immune Boolean functions are mostly based on the support set.The methods by…

2013

An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By…

2012

A function over finite rings is a function from a ring $E_{q}^{n}$ to a ring Er, where Ek is ℤ /k ℤ. These functions are well…

2011

Because of the recent algebraic attacks, a high algebraic immunity is now an absolutely necessary property for Boolean functions…

1972