An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial

DOI10.1515/DMA.2007.041MaRDI QIDQ5439072zbMATH OpenOpenAlexFDO

Authors V. V. Bayev

Publication date 8 February 2008

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/dm/v19/i4/p132

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Level structure of Zhegalkin polynomials, properties of test sets, and an annihilator search algorithm
• On some algorithms for constructing low-degree annihilators for Boolean functions
• Reducing the Number of Homogeneous Linear Equations in Finding Annihilators
• On the annihilators of Boolean polynomials
• On Algebraic Immunity and Annihilators

Cites work

• Computing the Algebraic Immunity Efficiently
• On some algorithms for constructing low-degree annihilators for Boolean functions

Cited in

(3)

• On some algorithms for constructing low-degree annihilators for Boolean functions
• Level structure of Zhegalkin polynomials, properties of test sets, and an annihilator search algorithm
• Multiaffine polynomials over a finite field

This page was built for publication: An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5439072)