Publication:
An observation of cryptographic properties of 256 one-dimensional cellular automata rules

Simple item page
dc.citedby3
dc.contributor.authorJamil N.en_US
dc.contributor.authorMahmood R.en_US
dc.contributor.authorZ�ba M.R.en_US
dc.contributor.authorZukamaen Z.A.en_US
dc.contributor.authorUdzir N.I.en_US
dc.contributor.authorid36682671900en_US
dc.contributor.authorid6506085008en_US
dc.contributor.authorid24726154700en_US
dc.contributor.authorid54421732900en_US
dc.contributor.authorid8662597200en_US
dc.date.accessioned2023-12-29T07:47:51Z
dc.date.available2023-12-29T07:47:51Z
dc.date.issued2011
dc.description.abstractThe robustness of a cryptographic system substantially depends on its underlying elements. Boolean functions are the most frequently used elements in various cryptographic systems, be it block ciphers, stream ciphers and hash functions. However, constructing Boolean functions satisfying all fundamental cryptographic properties are not trivial. We study the cryptographic properties of Boolean functions of biological system namely one-dimensional Cellular Automata (CA) and show that some of its Boolean functions satisfy all mentioned properties on levels very close to optimal and therefore can be recommended as cryptographically strong Boolean function. � 2011 Springer-Verlag.en_US
dc.description.natureFinalen_US
dc.identifier.doi10.1007/978-3-642-25327-0_35
dc.identifier.epage420
dc.identifier.issuePART 1
dc.identifier.scopus2-s2.0-82955173767
dc.identifier.spage409
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-82955173767&doi=10.1007%2f978-3-642-25327-0_35&partnerID=40&md5=9bd0d32983df6f26fb05b0d882929864
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/30439
dc.identifier.volume251 CCIS
dc.pagecount11
dc.sourceScopus
dc.sourcetitleCommunications in Computer and Information Science
dc.subjectbalanced functions
dc.subjectBoolean functions
dc.subjectcorrelation immunity
dc.subjectcryptographic properties
dc.subjecthigh algebraic degree
dc.subjectnon-linearity
dc.subjectpropagation criteria
dc.subjectCellular automata
dc.subjectHash functions
dc.subjectInformation science
dc.subjectAlgebraic degrees
dc.subjectBalanced functions
dc.subjectcorrelation immunity
dc.subjectcryptographic properties
dc.subjectNon-Linearity
dc.subjectBoolean functions
dc.titleAn observation of cryptographic properties of 256 one-dimensional cellular automata rulesen_US
dc.typeConference paperen_US
dspace.entity.typePublication
Files
Collections
SCOPUS