Welcome to the resource topic for 2006/018
Title:
Notion of Algebraic Immunity and Its evaluation Related to Fast Algebraic Attacks
Authors: Deepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra
Abstract:It has been noted recently that algebraic (annihilator) immunity
alone does not provide sufficient resistance against algebraic attacks. In this regard, given a Boolean function f, just checking the minimum degree annihilators of f, 1+f is not enough and one should check the relationsips of the form fg = h, and a function f, even if it has very good algebraic immunity, is not necessarily good against fast algebraic attack, if degree of g becomes very low when degree of h
is equal to or little greater than the algebraic immunity of f. In this paper we theoretically study the two currently known constructions
having maximum possible algebraic immunity from this viewpoint. To the end, we also experimentally study some cryptographically significant functions having good algebraic immunity.
ePrint: https://eprint.iacr.org/2006/018
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .