Cryptology ePrint Archive: Report 2006/018

Notion of Algebraic Immunity and Its evaluation Related to Fast Algebraic Attacks

Deepak Kumar Dalai and Kishan Chand Gupta and 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.

Category / Keywords: secret-key cryptography /

Date: received 16 Jan 2006, last revised 8 Feb 2006

Contact author: subho at isical ac in

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: A few data in Table 1 are corrected. In Section 3, there are some minor editorial modifications.

Version: 20060208:093056 (All versions of this report)

Short URL: ia.cr/2006/018

Discussion forum: Show discussion | Start new discussion