Please use this identifier to cite or link to this item: http://dspace2020.uniten.edu.my:8080/handle/123456789/6652
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJamil, N.
dc.contributor.authorMahmood, R.
dc.contributor.authorZába, M.R.
dc.contributor.authorZukamaen, Z.A.
dc.contributor.authorUdzir, N.I.
dc.date.accessioned2017-12-08T10:01:35Z-
dc.date.available2017-12-08T10:01:35Z-
dc.date.issued2011
dc.identifier.urihttp://dspace.uniten.edu.my/jspui/handle/123456789/6652-
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.
dc.titleAn observation of cryptographic properties of 256 one-dimensional cellular automata rules
item.fulltextNo Fulltext-
item.grantfulltextnone-
Appears in Collections:CCI Scholarly Publication
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.