Efficient Algorithms for Analysis of Cryptographic Boolean Functions
Dawson, Edward, Fuller, Joanne, & Millan, William (2002) Efficient Algorithms for Analysis of Cryptographic Boolean Functions. In Billington, Donovan, & Khodkar (Eds.) 13th Australasian Workshop on Combinatorial Algorithms (AWOCA 2002), 7-10 July, 2002, Fraser Island, Queensland.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Conference Paper|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Deposited On:||17 Jun 2009 14:43|
|Last Modified:||17 Jun 2009 14:43|
Repository Staff Only: item control page