Construction and count of resilient rotation symmetric Boolean functions with prime number variables
Tongxin xuebao, 2013 The characteristic matrix of the resilient rotation symmetric Boolean functions(RSBF) with prime number va-riables were explored. Some properties about character ic matrix of them were given.
Jiao DU +3 more
doaj +2 more sources
A Note on “On the Construction of Boolean Functions with Optimal Algebraic Immunity”
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011 In this note, we go further on the "basis exchange" idea presented in \cite{LiNa1} by using Mobious inversion. We show that the matrix $S_1(f)S_0(f)^{-1}$ has a nice form when $f$ is chosen to be the majority function, where $S_1(f)$ is the matrix with row vectors $\upsilon_k(α)$ for all $α\in 1_f$ and $S_0(f)=S_1(f\oplus1)$.
Yuan Li 0001 +2 more
openaire +2 more sources
Some New Conclusions on Orthomorphisms
工程科学与技术, 2013 :Orthomorphism plays an important role in the design of symmetric cryptography. To analyze its construction, counting and properties further, a problem in a conclusion about linear orthomorphism was pointed out and corrected.
童言 +4 more
doaj
Tight bound between nonlinearity and algebraic immunity [PDF]
, 2013 We obtain tight bound between nonlinearity and algebraic immunity of a Boolean function and construct balanced functions that achive this bound for all possible values of ...
Mikhail Lobanov
core
Notion of Algebraic Immunity and Its evaluation Related to Fast Algebraic Attacks [PDF]
, 2006 It has been noted recently that algebraic (annihilator) immunity alone does not provide sufficient resistance against algebraic attacks.
Subhamoy Maitra +3 more
core
On the Higher Order Nonlinearities of Algebraic Immune Functions [PDF]
, 2006 One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always well adapted to the concrete situation in which Boolean functions are used in symmetric cryptography, since changing one or several output bits of a Boolean function considerably ...
openaire +1 more source
Balanced Boolean Functions with Optimum Algebraic Immunity and High Nonlinearity [PDF]
, 2010 In this paper, three constructions of balanced Boolean functions with optimum algebraic immunity are proposed. The cryptographical properties such as algebraic degree and nonlinearity of the constructed functions are also ...
Lei Hu +3 more
core
Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity [PDF]
, 2010 Algebraic immunity is a recently introduced cryptographic parameter for Boolean functions used in stream ciphers. If pAI(f) and pAI(f⊕1) are the minimum degree of all annihilators of f and f⊕1 respectively, the algebraic immunity AI(f) is defined as the ...
Panagiotis Rizomiliotis +1 more
core +1 more source
Modification of the Peterson algebraic decoder
Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie ŚrodowiskaThe aim of the study is to increase the reliability of data transmission based on the modification of the Peterson algorithm. The modification of the Peterson algorithm is based on the control of the correctness of the error locator polynomial.
Dmytro Mogylevych +4 more
doaj +1 more source
Tight bounds between algebraic immunity and nonlinearities of high orders [PDF]
, 2007 Among cryptographically significant characteristics of Boolean functions used in symmetric ciphers the algebraic immunity and the nonlinearities of high orders play the important role. Some bounds on the nonlinearities of high orders of Boolean functions
Lobanov Mikhail
core