Boolean functions with maximum algebraic immunity: further extensions of the Carlet–Feng construction

Boolean functions with maximum algebraic immunity: further extensions of the Carlet–Feng... The algebraic immunity of Boolean functions is studied in this paper. More precisely, having the prominent Carlet–Feng construction as a starting point, we propose a new method to construct a large number of functions with maximum algebraic immunity. The new method is based on deriving new properties of minimal codewords of the punctured Reed–Muller code $$\mathrm{RM}^{\star }(\lfloor \frac{n-1}{2}\rfloor ,n)$$ RM ⋆ ( ⌊ n - 1 2 ⌋ , n ) for any n, allowing—if n is odd—for efficiently generating large classes of new functions that cannot be obtained by other known constructions. It is shown that high nonlinearity, as well as good behavior against fast algebraic attacks, is also attainable. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Designs, Codes and Cryptography Springer Journals

Boolean functions with maximum algebraic immunity: further extensions of the Carlet–Feng construction

Loading next page...
 
/lp/springer_journal/boolean-functions-with-maximum-algebraic-immunity-further-extensions-QSEThxi0n0
Publisher
Springer Journals
Copyright
Copyright © 2017 by Springer Science+Business Media, LLC
Subject
Mathematics; Combinatorics; Coding and Information Theory; Data Structures, Cryptology and Information Theory; Data Encryption; Discrete Mathematics in Computer Science; Information and Communication, Circuits
ISSN
0925-1022
eISSN
1573-7586
D.O.I.
10.1007/s10623-017-0418-5
Publisher site
See Article on Publisher Site

Abstract

The algebraic immunity of Boolean functions is studied in this paper. More precisely, having the prominent Carlet–Feng construction as a starting point, we propose a new method to construct a large number of functions with maximum algebraic immunity. The new method is based on deriving new properties of minimal codewords of the punctured Reed–Muller code $$\mathrm{RM}^{\star }(\lfloor \frac{n-1}{2}\rfloor ,n)$$ RM ⋆ ( ⌊ n - 1 2 ⌋ , n ) for any n, allowing—if n is odd—for efficiently generating large classes of new functions that cannot be obtained by other known constructions. It is shown that high nonlinearity, as well as good behavior against fast algebraic attacks, is also attainable.

Journal

Designs, Codes and CryptographySpringer Journals

Published: Oct 10, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off