New Characterizations for the Multi-output Correlation-Immune Boolean Functions
Correlation-immune (CI) multi-output Boolean functions have the property of keeping the same output distribution when some input variables are fixed. Recently, a new application of CI functions has appeared in the system of resisting side-channel attacks (SCA). In this paper, three new methods are p...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Chai, Jinjin Wang, Zilong Mesnager, Sihem Gong, Guang |
description | Correlation-immune (CI) multi-output Boolean functions have the property of
keeping the same output distribution when some input variables are fixed.
Recently, a new application of CI functions has appeared in the system of
resisting side-channel attacks (SCA). In this paper, three new methods are
proposed to characterize the $t$ th-order CI multi-output Boolean functions
($n$-input and $m$-output). The first characterization is to regard the
multi-output Boolean functions as the corresponding generalized Boolean
functions. It is shown that a generalized Boolean functions $f_g$ is a $t$
th-order CI function if and only if the Walsh transform of $f_g$ defined here
vanishes at all points with Hamming weights between $1$ and $t$. Compared to
the previous Walsh transforms of component functions, our first method can
reduce the computational complexity from $(2^m-1)\sum^t_{j=1}\binom{n}{j}$ to
$m\sum^t_{j=1}\binom{n}{j}$. The last two methods are generalized from Fourier
spectral characterizations. Especially, Fourier spectral characterizations are
more efficient to characterize the symmetric multi-output CI Boolean functions. |
doi_str_mv | 10.48550/arxiv.1903.05351 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1903_05351</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1903_05351</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-37688dbadafb0a965c41a76b90b4f176b1cdbc05e6ae66ebb2bcc94bc7f4669e3</originalsourceid><addsrcrecordid>eNotj8tOwzAURL1hgQofwAr_gIONH4mXEFGoVOim--jauVYjJXHl2ry-HghdzSzmjHQIuRG8Uo3W_A7S5_BeCctlxbXU4pLs3vCDtgdI4DOm4RvyEOcTDTHRfED6WsY8sFjysWTaxpRwXBZsM01lRvoY44gw03WZ_UJekYsA4wmvz7ki-_XTvn1h293zpn3YMjC1YLI2TdM76CE4DtZorwTUxlnuVBC_Rfjeea7RABqDzt07761yvg7KGItyRW7_bxej7piGCdJX92fWLWbyB7M_Syg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>New Characterizations for the Multi-output Correlation-Immune Boolean Functions</title><source>arXiv.org</source><creator>Chai, Jinjin ; Wang, Zilong ; Mesnager, Sihem ; Gong, Guang</creator><creatorcontrib>Chai, Jinjin ; Wang, Zilong ; Mesnager, Sihem ; Gong, Guang</creatorcontrib><description>Correlation-immune (CI) multi-output Boolean functions have the property of
keeping the same output distribution when some input variables are fixed.
Recently, a new application of CI functions has appeared in the system of
resisting side-channel attacks (SCA). In this paper, three new methods are
proposed to characterize the $t$ th-order CI multi-output Boolean functions
($n$-input and $m$-output). The first characterization is to regard the
multi-output Boolean functions as the corresponding generalized Boolean
functions. It is shown that a generalized Boolean functions $f_g$ is a $t$
th-order CI function if and only if the Walsh transform of $f_g$ defined here
vanishes at all points with Hamming weights between $1$ and $t$. Compared to
the previous Walsh transforms of component functions, our first method can
reduce the computational complexity from $(2^m-1)\sum^t_{j=1}\binom{n}{j}$ to
$m\sum^t_{j=1}\binom{n}{j}$. The last two methods are generalized from Fourier
spectral characterizations. Especially, Fourier spectral characterizations are
more efficient to characterize the symmetric multi-output CI Boolean functions.</description><identifier>DOI: 10.48550/arxiv.1903.05351</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2019-03</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1903.05351$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1903.05351$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Chai, Jinjin</creatorcontrib><creatorcontrib>Wang, Zilong</creatorcontrib><creatorcontrib>Mesnager, Sihem</creatorcontrib><creatorcontrib>Gong, Guang</creatorcontrib><title>New Characterizations for the Multi-output Correlation-Immune Boolean Functions</title><description>Correlation-immune (CI) multi-output Boolean functions have the property of
keeping the same output distribution when some input variables are fixed.
Recently, a new application of CI functions has appeared in the system of
resisting side-channel attacks (SCA). In this paper, three new methods are
proposed to characterize the $t$ th-order CI multi-output Boolean functions
($n$-input and $m$-output). The first characterization is to regard the
multi-output Boolean functions as the corresponding generalized Boolean
functions. It is shown that a generalized Boolean functions $f_g$ is a $t$
th-order CI function if and only if the Walsh transform of $f_g$ defined here
vanishes at all points with Hamming weights between $1$ and $t$. Compared to
the previous Walsh transforms of component functions, our first method can
reduce the computational complexity from $(2^m-1)\sum^t_{j=1}\binom{n}{j}$ to
$m\sum^t_{j=1}\binom{n}{j}$. The last two methods are generalized from Fourier
spectral characterizations. Especially, Fourier spectral characterizations are
more efficient to characterize the symmetric multi-output CI Boolean functions.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAURL1hgQofwAr_gIONH4mXEFGoVOim--jauVYjJXHl2ry-HghdzSzmjHQIuRG8Uo3W_A7S5_BeCctlxbXU4pLs3vCDtgdI4DOm4RvyEOcTDTHRfED6WsY8sFjysWTaxpRwXBZsM01lRvoY44gw03WZ_UJekYsA4wmvz7ki-_XTvn1h293zpn3YMjC1YLI2TdM76CE4DtZorwTUxlnuVBC_Rfjeea7RABqDzt07761yvg7KGItyRW7_bxej7piGCdJX92fWLWbyB7M_Syg</recordid><startdate>20190313</startdate><enddate>20190313</enddate><creator>Chai, Jinjin</creator><creator>Wang, Zilong</creator><creator>Mesnager, Sihem</creator><creator>Gong, Guang</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20190313</creationdate><title>New Characterizations for the Multi-output Correlation-Immune Boolean Functions</title><author>Chai, Jinjin ; Wang, Zilong ; Mesnager, Sihem ; Gong, Guang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-37688dbadafb0a965c41a76b90b4f176b1cdbc05e6ae66ebb2bcc94bc7f4669e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Chai, Jinjin</creatorcontrib><creatorcontrib>Wang, Zilong</creatorcontrib><creatorcontrib>Mesnager, Sihem</creatorcontrib><creatorcontrib>Gong, Guang</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chai, Jinjin</au><au>Wang, Zilong</au><au>Mesnager, Sihem</au><au>Gong, Guang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>New Characterizations for the Multi-output Correlation-Immune Boolean Functions</atitle><date>2019-03-13</date><risdate>2019</risdate><abstract>Correlation-immune (CI) multi-output Boolean functions have the property of
keeping the same output distribution when some input variables are fixed.
Recently, a new application of CI functions has appeared in the system of
resisting side-channel attacks (SCA). In this paper, three new methods are
proposed to characterize the $t$ th-order CI multi-output Boolean functions
($n$-input and $m$-output). The first characterization is to regard the
multi-output Boolean functions as the corresponding generalized Boolean
functions. It is shown that a generalized Boolean functions $f_g$ is a $t$
th-order CI function if and only if the Walsh transform of $f_g$ defined here
vanishes at all points with Hamming weights between $1$ and $t$. Compared to
the previous Walsh transforms of component functions, our first method can
reduce the computational complexity from $(2^m-1)\sum^t_{j=1}\binom{n}{j}$ to
$m\sum^t_{j=1}\binom{n}{j}$. The last two methods are generalized from Fourier
spectral characterizations. Especially, Fourier spectral characterizations are
more efficient to characterize the symmetric multi-output CI Boolean functions.</abstract><doi>10.48550/arxiv.1903.05351</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.1903.05351 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_1903_05351 |
source | arXiv.org |
subjects | Computer Science - Information Theory Mathematics - Information Theory |
title | New Characterizations for the Multi-output Correlation-Immune Boolean Functions |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T12%3A36%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=New%20Characterizations%20for%20the%20Multi-output%20Correlation-Immune%20Boolean%20Functions&rft.au=Chai,%20Jinjin&rft.date=2019-03-13&rft_id=info:doi/10.48550/arxiv.1903.05351&rft_dat=%3Carxiv_GOX%3E1903_05351%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |