Improving bounds for the number of correlation immune Boolean functions
In this paper, we enumerate correlation immune functions by suggesting a novel method of constructing those functions. We obtain lower and upper bounds for the number of correlation immune functions, which improve the previously known results.
Gespeichert in:
| Veröffentlicht in: | Information processing letters 1997-02, Vol.61 (4), p.209-212 |
|---|---|
| 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 | 212 |
|---|---|
| container_issue | 4 |
| container_start_page | 209 |
| container_title | Information processing letters |
| container_volume | 61 |
| creator | Park, Sung Mo Lee, Sangjin Sung, Soo Hak Kim, Kwangjo |
| description | In this paper, we enumerate correlation immune functions by suggesting a novel method of constructing those functions. We obtain lower and upper bounds for the number of correlation immune functions, which improve the previously known results. |
| doi_str_mv | 10.1016/S0020-0190(97)00010-0 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237277126</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019097000100</els_id><sourcerecordid>11474519</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-7a29ffde3cd92818f1dcc8cbf7d9068dd973771ddae335bb2218cf43b755137c3</originalsourceid><addsrcrecordid>eNqFkEtLAzEUhYMoWKs_QQjiQhejeXQmk5Vo0VoouFDXIZOHpswkNZkp-O9NH3Tr6nIv3zn33gPAJUZ3GOHq_h0hggqEObrh7BYhhHN3BEa4ZqSoMObHYHRATsFZSssMVRPKRmA271YxrJ3_gk0YvE7Qhgj7bwP90DUmwmChCjGaVvYueOi6bvAGPoXQGumhHbzazNM5OLGyTeZiX8fg8-X5Y_paLN5m8-njolC0on3BJOHWakOV5qTGtcVaqVo1lmmOqlprzihjWGtpKC2bhhBcKzuhDStLTJmiY3C1881X_wwm9WIZhujzSkEoI1lLqgyVO0jFkFI0Vqyi62T8FRiJTWRiG5nY5CE4E9vIBMq66725TEq2NkqvXDqIs3NJOM7Yww4z-dG1M1Ek5YxXRrtoVC90cP8s-gPGVH_S</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237277126</pqid></control><display><type>article</type><title>Improving bounds for the number of correlation immune Boolean functions</title><source>Access via ScienceDirect (Elsevier)</source><creator>Park, Sung Mo ; Lee, Sangjin ; Sung, Soo Hak ; Kim, Kwangjo</creator><creatorcontrib>Park, Sung Mo ; Lee, Sangjin ; Sung, Soo Hak ; Kim, Kwangjo</creatorcontrib><description>In this paper, we enumerate correlation immune functions by suggesting a novel method of constructing those functions. We obtain lower and upper bounds for the number of correlation immune functions, which improve the previously known results.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/S0020-0190(97)00010-0</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Boolean ; Boolean function ; Codes ; Computer science; control theory; systems ; Correlation immune function ; Cryptography ; Enumeration ; Exact sciences and technology ; Functions ; Information processing ; Information, signal and communications theory ; Logical, boolean and switching functions ; Signal and communications theory ; Stream cipher ; Studies ; Telecommunications and information theory ; Theoretical computing</subject><ispartof>Information processing letters, 1997-02, Vol.61 (4), p.209-212</ispartof><rights>1997</rights><rights>1997 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Feb 28, 1997</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-7a29ffde3cd92818f1dcc8cbf7d9068dd973771ddae335bb2218cf43b755137c3</citedby><cites>FETCH-LOGICAL-c363t-7a29ffde3cd92818f1dcc8cbf7d9068dd973771ddae335bb2218cf43b755137c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0020-0190(97)00010-0$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2635291$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Park, Sung Mo</creatorcontrib><creatorcontrib>Lee, Sangjin</creatorcontrib><creatorcontrib>Sung, Soo Hak</creatorcontrib><creatorcontrib>Kim, Kwangjo</creatorcontrib><title>Improving bounds for the number of correlation immune Boolean functions</title><title>Information processing letters</title><description>In this paper, we enumerate correlation immune functions by suggesting a novel method of constructing those functions. We obtain lower and upper bounds for the number of correlation immune functions, which improve the previously known results.</description><subject>Applied sciences</subject><subject>Boolean</subject><subject>Boolean function</subject><subject>Codes</subject><subject>Computer science; control theory; systems</subject><subject>Correlation immune function</subject><subject>Cryptography</subject><subject>Enumeration</subject><subject>Exact sciences and technology</subject><subject>Functions</subject><subject>Information processing</subject><subject>Information, signal and communications theory</subject><subject>Logical, boolean and switching functions</subject><subject>Signal and communications theory</subject><subject>Stream cipher</subject><subject>Studies</subject><subject>Telecommunications and information theory</subject><subject>Theoretical computing</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNqFkEtLAzEUhYMoWKs_QQjiQhejeXQmk5Vo0VoouFDXIZOHpswkNZkp-O9NH3Tr6nIv3zn33gPAJUZ3GOHq_h0hggqEObrh7BYhhHN3BEa4ZqSoMObHYHRATsFZSssMVRPKRmA271YxrJ3_gk0YvE7Qhgj7bwP90DUmwmChCjGaVvYueOi6bvAGPoXQGumhHbzazNM5OLGyTeZiX8fg8-X5Y_paLN5m8-njolC0on3BJOHWakOV5qTGtcVaqVo1lmmOqlprzihjWGtpKC2bhhBcKzuhDStLTJmiY3C1881X_wwm9WIZhujzSkEoI1lLqgyVO0jFkFI0Vqyi62T8FRiJTWRiG5nY5CE4E9vIBMq66725TEq2NkqvXDqIs3NJOM7Yww4z-dG1M1Ek5YxXRrtoVC90cP8s-gPGVH_S</recordid><startdate>19970228</startdate><enddate>19970228</enddate><creator>Park, Sung Mo</creator><creator>Lee, Sangjin</creator><creator>Sung, Soo Hak</creator><creator>Kim, Kwangjo</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19970228</creationdate><title>Improving bounds for the number of correlation immune Boolean functions</title><author>Park, Sung Mo ; Lee, Sangjin ; Sung, Soo Hak ; Kim, Kwangjo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-7a29ffde3cd92818f1dcc8cbf7d9068dd973771ddae335bb2218cf43b755137c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Applied sciences</topic><topic>Boolean</topic><topic>Boolean function</topic><topic>Codes</topic><topic>Computer science; control theory; systems</topic><topic>Correlation immune function</topic><topic>Cryptography</topic><topic>Enumeration</topic><topic>Exact sciences and technology</topic><topic>Functions</topic><topic>Information processing</topic><topic>Information, signal and communications theory</topic><topic>Logical, boolean and switching functions</topic><topic>Signal and communications theory</topic><topic>Stream cipher</topic><topic>Studies</topic><topic>Telecommunications and information theory</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Park, Sung Mo</creatorcontrib><creatorcontrib>Lee, Sangjin</creatorcontrib><creatorcontrib>Sung, Soo Hak</creatorcontrib><creatorcontrib>Kim, Kwangjo</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Park, Sung Mo</au><au>Lee, Sangjin</au><au>Sung, Soo Hak</au><au>Kim, Kwangjo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improving bounds for the number of correlation immune Boolean functions</atitle><jtitle>Information processing letters</jtitle><date>1997-02-28</date><risdate>1997</risdate><volume>61</volume><issue>4</issue><spage>209</spage><epage>212</epage><pages>209-212</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>In this paper, we enumerate correlation immune functions by suggesting a novel method of constructing those functions. We obtain lower and upper bounds for the number of correlation immune functions, which improve the previously known results.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0020-0190(97)00010-0</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 1997-02, Vol.61 (4), p.209-212 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_237277126 |
| source | Access via ScienceDirect (Elsevier) |
| subjects | Applied sciences Boolean Boolean function Codes Computer science control theory systems Correlation immune function Cryptography Enumeration Exact sciences and technology Functions Information processing Information, signal and communications theory Logical, boolean and switching functions Signal and communications theory Stream cipher Studies Telecommunications and information theory Theoretical computing |
| title | Improving bounds for the number of 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=2024-12-28T19%3A54%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improving%20bounds%20for%20the%20number%20of%20correlation%20immune%20Boolean%20functions&rft.jtitle=Information%20processing%20letters&rft.au=Park,%20Sung%20Mo&rft.date=1997-02-28&rft.volume=61&rft.issue=4&rft.spage=209&rft.epage=212&rft.pages=209-212&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/S0020-0190(97)00010-0&rft_dat=%3Cproquest_cross%3E11474519%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=237277126&rft_id=info:pmid/&rft_els_id=S0020019097000100&rfr_iscdi=true |