default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Millan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c25]Praveen Gauravaram, William Millan, Ed Dawson
, Kapali Viswanathan:
Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction. ACISP 2006: 407-420- 2005
- [j4]Joanne Fuller, William Millan, Ed Dawson:
Multi-objective Optimisation of Bijective S-Boxes. New Gener. Comput. 23(3): 201-218 (2005) - [c24]William Millan:
New Cryptographic Applications of Boolean Function Equivalence Classes. ACISP 2005: 572-583 - [i4]William Millan, Ed Dawson:
LILI-II is not Broken. IACR Cryptol. ePrint Arch. 2005: 234 (2005) - [i3]Praveen Gauravaram, William Millan, Juanma González Nieto, Ed Dawson:
3C- A Provably Secure Pseudorandom Function and Message Authentication Code.A New mode of operation for Cryptographic Hash Function. IACR Cryptol. ePrint Arch. 2005: 390 (2005) - [i2]Praveen Gauravaram, William Millan, Juanma González Nieto:
Some thoughts on Collision Attacks in the Hash Functions MD5, SHA-0 and SHA-1. IACR Cryptol. ePrint Arch. 2005: 391 (2005) - 2004
- [j3]L. Burnett, William Millan, Ed Dawson, Andrew J. Clark:
Simpler methods for generating better Boolean functions with good cryptographic properties. Australas. J Comb. 29: 231-248 (2004) - [j2]William Millan, Joanne Fuller, Ed Dawson:
New Concepts in Evolutionary Search for Boolean Functions in Cryptology. Comput. Intell. 20(3): 463-474 (2004) - [j1]William Millan, Praveen Gauravaram:
Cryptanalysis of the cellular authentication and voice encryption algorithm. IEICE Electron. Express 1(15): 453-459 (2004) - [c23]Praveen Gauravaram, William Millan:
Improved Attack on the Cellular Authentication and Voice Encryption Algorithm (CAVE). Cryptographic Algorithms and their Uses 2004: 1-13 - [c22]Kevin Chen, William Millan, Leonie Ruth Simpson:
Perspectives on Word Based Stream Ciphers. Cryptographic Algorithms and their Uses 2004: 14-27 - [c21]Praveen Gauravaram, William Millan, Lauren May:
CRUSH: A New Cryptographic Hash Function using Iterated Halving Technique. Cryptographic Algorithms and their Uses 2004: 28-39 - [c20]Joanne Fuller, William Millan, Ed Dawson:
Multi-objective optimisation of bijective s-boxes. IEEE Congress on Evolutionary Computation 2004: 1525-1532 - [c19]Kevin Chen, Matthew Henricksen, William Millan, Joanne Fuller, Leonie Ruth Simpson, Ed Dawson, Hoon-Jae Lee, Sang-Jae Moon:
Dragon: A Fast Word Based Stream Cipher. ICISC 2004: 33-50 - 2003
- [c18]Joanne Fuller, Ed Dawson, William Millan:
Evolutionary generation of bent functions for cryptography. IEEE Congress on Evolutionary Computation 2003: 1655-1661 - [c17]William Millan, Joanne Fuller, Ed Dawson:
New concepts in evolutionary search for Boolean functions in cryptology. IEEE Congress on Evolutionary Computation 2003: 2157-2164 - [c16]Joanne Fuller, William Millan:
Linear Redundancy in S-Boxes. FSE 2003: 74-86 - [c15]Kevin Chen, Leonie Ruth Simpson, Matthew Henricksen, William Millan, Ed Dawson:
A Complete Divide and Conquer Attack on the Alpha1 Stream Cipher. ICISC 2003: 418-431 - 2002
- [c14]Andrew J. Clark, Ed Dawson, Joanne Fuller, Jovan Dj. Golic, Hoon-Jae Lee, William Millan, Sang-Jae Moon, Leonie Simpson:
The LILI-II Keystream Generator. ACISP 2002: 25-39 - [c13]Lauren May, Matthew Henricksen, William Millan, Gary Carter, Ed Dawson:
Strengthening the Key Schedule of the AES. ACISP 2002: 226-240 - [c12]John A. Clark, Jeremy L. Jacob, Susan Stepney, Subhamoy Maitra, William Millan:
Evolving Boolean Functions Satisfying Multiple Criteria. INDOCRYPT 2002: 246-259 - [i1]Joanne Fuller, William Millan:
On Linear Redundancy in the AES S-Box. IACR Cryptol. ePrint Arch. 2002: 111 (2002) - 2000
- [c11]L. Burnett, Gary Carter, Ed Dawson, William Millan:
Efficient Methods for Generating MARS-Like S-Boxes. FSE 2000: 300-314 - [c10]Leonie Ruth Simpson, Ed Dawson, Jovan Dj. Golic, William Millan:
LILI Keystream Generator. Selected Areas in Cryptography 2000: 248-261
1990 – 1999
- 1999
- [c9]William Millan, Andrew J. Clark, Ed Dawson:
Boolean Function Design Using Hill Climbing Methods. ACISP 1999: 1-11 - [c8]William Millan, L. Burnett, Gary Carter, Andrew J. Clark, Ed Dawson:
Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes. ICICS 1999: 263-274 - 1998
- [c7]William Millan:
How to Improve the Nonlinearity of Bijective S-Boxes. ACISP 1998: 181-192 - [c6]William Millan, Andrew J. Clark, Ed Dawson:
Heuristic Design of Cryptographically Strong Balanced Boolean Functions. EUROCRYPT 1998: 489-499 - [c5]William Millan:
Cryptanalysis of the alleged CAVE algorithm. ICISC 1998: 107-119 - [c4]David A. Wagner, Leonie Simpson, Ed Dawson, John Kelsey, William Millan, Bruce Schneier:
Cryptanalysis of ORYX. Selected Areas in Cryptography 1998: 296-305 - 1997
- [c3]William Millan, Ed Dawson:
On the Security of Self-Synchronous Ciphers. ACISP 1997: 159-170 - [c2]William Millan, Andrew J. Clark, Ed Dawson:
An effective genetic algorithm for finding highly nonlinear Boolean Functions. ICICS 1997: 149-158 - 1995
- [c1]William Millan:
Low Order Approximation of Cipher Functions. Cryptography: Policy and Algorithms 1995: 144-155
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
