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:
Veröffentlicht in: | arXiv.org 2019-08 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
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. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2280882058</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2280882058</sourcerecordid><originalsourceid>FETCH-proquest_journals_22808820583</originalsourceid><addsrcrecordid>eNqNi0sKwjAUAIMgWLR3CLgOxBerWVssulA37ksor7Qlzav5IHh6RTyAq1nMzIxloNRG6C3AguUhDFJK2O2hKFTGbld88rIz3jQRff8ysScXeEuexw75JdnYC0pxSpGX5D3abyHO45gc8gORReN4lVzzPVds3hobMP9xydbV8V6exOTpkTDEeqDk3UfVAFpqDbLQ6r_qDWhjPzY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2280882058</pqid></control><display><type>article</type><title>New Characterizations for the Multi-output Correlation-Immune Boolean Functions</title><source>Free E- Journals</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>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Boolean algebra ; Boolean functions ; Codes ; Walsh transforms</subject><ispartof>arXiv.org, 2019-08</ispartof><rights>2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>776,780</link.rule.ids></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><title>arXiv.org</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>Boolean algebra</subject><subject>Boolean functions</subject><subject>Codes</subject><subject>Walsh transforms</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNi0sKwjAUAIMgWLR3CLgOxBerWVssulA37ksor7Qlzav5IHh6RTyAq1nMzIxloNRG6C3AguUhDFJK2O2hKFTGbld88rIz3jQRff8ysScXeEuexw75JdnYC0pxSpGX5D3abyHO45gc8gORReN4lVzzPVds3hobMP9xydbV8V6exOTpkTDEeqDk3UfVAFpqDbLQ6r_qDWhjPzY</recordid><startdate>20190825</startdate><enddate>20190825</enddate><creator>Chai, Jinjin</creator><creator>Wang, Zilong</creator><creator>Mesnager, Sihem</creator><creator>Gong, Guang</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20190825</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-proquest_journals_22808820583</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Boolean algebra</topic><topic>Boolean functions</topic><topic>Codes</topic><topic>Walsh transforms</topic><toplevel>online_resources</toplevel><creatorcontrib>Chai, Jinjin</creatorcontrib><creatorcontrib>Wang, Zilong</creatorcontrib><creatorcontrib>Mesnager, Sihem</creatorcontrib><creatorcontrib>Gong, Guang</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chai, Jinjin</au><au>Wang, Zilong</au><au>Mesnager, Sihem</au><au>Gong, Guang</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>New Characterizations for the Multi-output Correlation-Immune Boolean Functions</atitle><jtitle>arXiv.org</jtitle><date>2019-08-25</date><risdate>2019</risdate><eissn>2331-8422</eissn><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><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2019-08 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2280882058 |
source | Free E- Journals |
subjects | Boolean algebra Boolean functions Codes Walsh transforms |
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-03T12%3A11%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=New%20Characterizations%20for%20the%20Multi-output%20Correlation-Immune%20Boolean%20Functions&rft.jtitle=arXiv.org&rft.au=Chai,%20Jinjin&rft.date=2019-08-25&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2280882058%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2280882058&rft_id=info:pmid/&rfr_iscdi=true |