Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms
It has been proved that the set of rotation symmetric Boolean functions (RSBFs) is abundant in cryptographically strong functions with multiple criteria. In this study, we design two genetic algorithms and apply them to search for balanced RSBFs with high nonlinearity. The experimental results show...
Gespeichert in:
| Veröffentlicht in: | Security and communication networks 2022-03, Vol.2022, p.1-6 |
|---|---|
| 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 | 6 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | Security and communication networks |
| container_volume | 2022 |
| creator | Wang, Yongjuan Gao, Guangpu Yuan, Qingjun |
| description | It has been proved that the set of rotation symmetric Boolean functions (RSBFs) is abundant in cryptographically strong functions with multiple criteria. In this study, we design two genetic algorithms and apply them to search for balanced RSBFs with high nonlinearity. The experimental results show that our methods can generate cryptographically strong Boolean functions with high nonlinearity, 1-resilient functions, and optimal algebraic immunity. It shows that these functions have superiority from the view point of practical application in cryptosystems compared with known ones which are obtained by other heuristics. |
| doi_str_mv | 10.1155/2022/8188533 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2646640350</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2646640350</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1823-3d9c1642c2ccb7731b6512842693ee26fbd3a47f9a3c1caa688446bdfcf38ce63</originalsourceid><addsrcrecordid>eNp9kF1LwzAUhosoOKd3_oCAl1qXr6bp5ZzOCQPB6XVJ06TLaJuapEj_vS0bXnp1zuE85z3wRNEtgo8IJckCQ4wXHHGeEHIWzVBGshgijM__ekQvoyvvDxAyRFM6i9xOCSf3pq2Atg6s3NAFWznR7Y0UdT2Analao8ehDeDDBhGMbcFuaBoVnJHgydpaiRas-1ZOKw-KATwrP12NmRvVO-PDCC7ryjoT9o2_ji60qL26OdV59LV--Vxt4u3769tquY0l4pjEpMwkYhRLLGWRpgQVLEGYU8wyohRmuiiJoKnOBJFICsE4p5QVpZaacKkYmUd3x9zO2e9e-ZAfbO_a8WWOGWWMQpLAkXo4UtJZ753SeedMI9yQI5hPVvPJan6yOuL3R3xUVoof8z_9C9yBeMg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2646640350</pqid></control><display><type>article</type><title>Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Wiley Online Library (Open Access Collection)</source><source>Alma/SFX Local Collection</source><creator>Wang, Yongjuan ; Gao, Guangpu ; Yuan, Qingjun</creator><contributor>Wang, Qichun ; Qichun Wang</contributor><creatorcontrib>Wang, Yongjuan ; Gao, Guangpu ; Yuan, Qingjun ; Wang, Qichun ; Qichun Wang</creatorcontrib><description>It has been proved that the set of rotation symmetric Boolean functions (RSBFs) is abundant in cryptographically strong functions with multiple criteria. In this study, we design two genetic algorithms and apply them to search for balanced RSBFs with high nonlinearity. The experimental results show that our methods can generate cryptographically strong Boolean functions with high nonlinearity, 1-resilient functions, and optimal algebraic immunity. It shows that these functions have superiority from the view point of practical application in cryptosystems compared with known ones which are obtained by other heuristics.</description><identifier>ISSN: 1939-0114</identifier><identifier>EISSN: 1939-0122</identifier><identifier>DOI: 10.1155/2022/8188533</identifier><language>eng</language><publisher>London: Hindawi</publisher><subject>Algebra ; Boolean ; Boolean algebra ; Boolean functions ; Codes ; Computer systems ; Cryptography ; Genetic algorithms ; Heuristic methods ; Multiple criterion ; Mutation ; Nonlinearity ; Orbits ; Rotation ; Spread spectrum ; Variables</subject><ispartof>Security and communication networks, 2022-03, Vol.2022, p.1-6</ispartof><rights>Copyright © 2022 Yongjuan Wang et al.</rights><rights>Copyright © 2022 Yongjuan Wang et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1823-3d9c1642c2ccb7731b6512842693ee26fbd3a47f9a3c1caa688446bdfcf38ce63</citedby><cites>FETCH-LOGICAL-c1823-3d9c1642c2ccb7731b6512842693ee26fbd3a47f9a3c1caa688446bdfcf38ce63</cites><orcidid>0000-0001-9819-404X ; 0000-0002-6598-8190 ; 0000-0001-9292-5745</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785,27929,27930</link.rule.ids></links><search><contributor>Wang, Qichun</contributor><contributor>Qichun Wang</contributor><creatorcontrib>Wang, Yongjuan</creatorcontrib><creatorcontrib>Gao, Guangpu</creatorcontrib><creatorcontrib>Yuan, Qingjun</creatorcontrib><title>Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms</title><title>Security and communication networks</title><description>It has been proved that the set of rotation symmetric Boolean functions (RSBFs) is abundant in cryptographically strong functions with multiple criteria. In this study, we design two genetic algorithms and apply them to search for balanced RSBFs with high nonlinearity. The experimental results show that our methods can generate cryptographically strong Boolean functions with high nonlinearity, 1-resilient functions, and optimal algebraic immunity. It shows that these functions have superiority from the view point of practical application in cryptosystems compared with known ones which are obtained by other heuristics.</description><subject>Algebra</subject><subject>Boolean</subject><subject>Boolean algebra</subject><subject>Boolean functions</subject><subject>Codes</subject><subject>Computer systems</subject><subject>Cryptography</subject><subject>Genetic algorithms</subject><subject>Heuristic methods</subject><subject>Multiple criterion</subject><subject>Mutation</subject><subject>Nonlinearity</subject><subject>Orbits</subject><subject>Rotation</subject><subject>Spread spectrum</subject><subject>Variables</subject><issn>1939-0114</issn><issn>1939-0122</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kF1LwzAUhosoOKd3_oCAl1qXr6bp5ZzOCQPB6XVJ06TLaJuapEj_vS0bXnp1zuE85z3wRNEtgo8IJckCQ4wXHHGeEHIWzVBGshgijM__ekQvoyvvDxAyRFM6i9xOCSf3pq2Atg6s3NAFWznR7Y0UdT2Analao8ehDeDDBhGMbcFuaBoVnJHgydpaiRas-1ZOKw-KATwrP12NmRvVO-PDCC7ryjoT9o2_ji60qL26OdV59LV--Vxt4u3769tquY0l4pjEpMwkYhRLLGWRpgQVLEGYU8wyohRmuiiJoKnOBJFICsE4p5QVpZaacKkYmUd3x9zO2e9e-ZAfbO_a8WWOGWWMQpLAkXo4UtJZ753SeedMI9yQI5hPVvPJan6yOuL3R3xUVoof8z_9C9yBeMg</recordid><startdate>20220327</startdate><enddate>20220327</enddate><creator>Wang, Yongjuan</creator><creator>Gao, Guangpu</creator><creator>Yuan, Qingjun</creator><general>Hindawi</general><general>Hindawi Limited</general><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><orcidid>https://orcid.org/0000-0001-9819-404X</orcidid><orcidid>https://orcid.org/0000-0002-6598-8190</orcidid><orcidid>https://orcid.org/0000-0001-9292-5745</orcidid></search><sort><creationdate>20220327</creationdate><title>Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms</title><author>Wang, Yongjuan ; Gao, Guangpu ; Yuan, Qingjun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1823-3d9c1642c2ccb7731b6512842693ee26fbd3a47f9a3c1caa688446bdfcf38ce63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algebra</topic><topic>Boolean</topic><topic>Boolean algebra</topic><topic>Boolean functions</topic><topic>Codes</topic><topic>Computer systems</topic><topic>Cryptography</topic><topic>Genetic algorithms</topic><topic>Heuristic methods</topic><topic>Multiple criterion</topic><topic>Mutation</topic><topic>Nonlinearity</topic><topic>Orbits</topic><topic>Rotation</topic><topic>Spread spectrum</topic><topic>Variables</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Yongjuan</creatorcontrib><creatorcontrib>Gao, Guangpu</creatorcontrib><creatorcontrib>Yuan, Qingjun</creatorcontrib><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</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>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Security and communication networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Yongjuan</au><au>Gao, Guangpu</au><au>Yuan, Qingjun</au><au>Wang, Qichun</au><au>Qichun Wang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms</atitle><jtitle>Security and communication networks</jtitle><date>2022-03-27</date><risdate>2022</risdate><volume>2022</volume><spage>1</spage><epage>6</epage><pages>1-6</pages><issn>1939-0114</issn><eissn>1939-0122</eissn><abstract>It has been proved that the set of rotation symmetric Boolean functions (RSBFs) is abundant in cryptographically strong functions with multiple criteria. In this study, we design two genetic algorithms and apply them to search for balanced RSBFs with high nonlinearity. The experimental results show that our methods can generate cryptographically strong Boolean functions with high nonlinearity, 1-resilient functions, and optimal algebraic immunity. It shows that these functions have superiority from the view point of practical application in cryptosystems compared with known ones which are obtained by other heuristics.</abstract><cop>London</cop><pub>Hindawi</pub><doi>10.1155/2022/8188533</doi><tpages>6</tpages><orcidid>https://orcid.org/0000-0001-9819-404X</orcidid><orcidid>https://orcid.org/0000-0002-6598-8190</orcidid><orcidid>https://orcid.org/0000-0001-9292-5745</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1939-0114 |
| ispartof | Security and communication networks, 2022-03, Vol.2022, p.1-6 |
| issn | 1939-0114 1939-0122 |
| language | eng |
| recordid | cdi_proquest_journals_2646640350 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Wiley Online Library (Open Access Collection); Alma/SFX Local Collection |
| subjects | Algebra Boolean Boolean algebra Boolean functions Codes Computer systems Cryptography Genetic algorithms Heuristic methods Multiple criterion Mutation Nonlinearity Orbits Rotation Spread spectrum Variables |
| title | Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T20%3A14%3A45IST&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=Searching%20for%20Cryptographically%20Significant%20Rotation%20Symmetric%20Boolean%20Functions%20by%20Designing%20Heuristic%20Algorithms&rft.jtitle=Security%20and%20communication%20networks&rft.au=Wang,%20Yongjuan&rft.date=2022-03-27&rft.volume=2022&rft.spage=1&rft.epage=6&rft.pages=1-6&rft.issn=1939-0114&rft.eissn=1939-0122&rft_id=info:doi/10.1155/2022/8188533&rft_dat=%3Cproquest_cross%3E2646640350%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=2646640350&rft_id=info:pmid/&rfr_iscdi=true |