{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T19:32:25Z","timestamp":1777404745546,"version":"3.51.4"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/tit.2017.2785773","type":"journal-article","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T21:30:54Z","timestamp":1513891854000},"page":"2962-2968","source":"Crossref","is-referenced-by-count":15,"title":["Weight Recursions for Any Rotation Symmetric Boolean Functions"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0087-8855","authenticated-orcid":false,"given":"Thomas W.","family":"Cusick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"cusick","year":"2017","journal-title":"Cryptographic Boolean functions and Applications"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2193377"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.022"},{"key":"ref13","first-page":"20","article-title":"Rotation-symmetric functions and fast hashing","volume":"5","author":"pieprzyk","year":"1999","journal-title":"J Univ Comput Sci"},{"key":"ref14","author":"su","year":"2015","journal-title":"On the systematic constructions of rotation symmetric bent functions with any possible algebraic degrees"},{"key":"ref15","author":"tang","year":"2015","journal-title":"Two infinite classes of rotation symmetric bent functions with simple representation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-012-0072-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.07.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.09.001"},{"key":"ref5","author":"cusick","year":"2017","journal-title":"Weight recursions for any rotation symmetric Boolean functions"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00354-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2011-0020"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-011-0060-4"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2009.017"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8318411\/08233162.pdf?arnumber=8233162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:22:43Z","timestamp":1642004563000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8233162\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":15,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2785773","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}