✦ LIBER ✦

Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials

✍ Scribed by Qichun Wang; Jie Peng; Haibin Kan; Xiangyang Xue

Book ID: 114642102
Publisher: IEEE
Year: 2010
Tongue: English
Weight: 190 KB
Volume: 56
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2010.2046195

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on "Constructions of Cryptograp

Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials

✍ Carlet, C. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 248 KB

Enumerating Boolean functions of cryptog

Enumerating Boolean functions of cryptographic significance

✍ Chris Mitchell 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 803 KB

In this paper we describe applications of functions from GF(2) m onto GF(2)" in the design of encryption algorithms. If such a function is to be useful it must satisfy a set of criteria, the actual definition of which depends on the type of encryption technique involved. This in turn means that it i

Algebraic immunity for cryptographically

Algebraic immunity for cryptographically significant Boolean functions: analysis and construction

✍ Carlet, C.; Dalai, D.K.; Gupta, K.C.; Maitra, S. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 443 KB

Further enumerating boolean functions of

Further enumerating boolean functions of cryptographic significance

✍ Yi XianYang; Baoan Guo 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 280 KB

Open problems about enumerating Boolean functions of cryptographic significance are (partially) solved in this paper.

Covering Sequences of Boolean Functions

Covering Sequences of Boolean Functions and Their Cryptographic Significance

✍ C. Carlet; Yu. Tarannikov 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 135 KB

Efficient implementation of cryptographi

Efficient implementation of cryptographically useful "large" Boolean functions

✍ Sarkar, P.; Maitra, S. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 304 KB