default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuke O'Connor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[i2]Luke O'Connor:
Entropy Bounds for Traffic Confirmation. IACR Cryptol. ePrint Arch. 2008: 365 (2008)- 2005
- [c17]Luke O'Connor:
On Blending Attacks for Mixes with Memory. Information Hiding 2005: 39-52 - [i1]Luke O'Connor:
On the Entropy of Arcfour Keys. IACR Cryptol. ePrint Arch. 2005: 233 (2005) - 2001
- [j9]Luke O'Connor:
On String Replacement Exponentiation. Des. Codes Cryptogr. 23(2): 173-184 (2001) - 2000
- [c16]Luke O'Connor, Günter Karjoth:
Efficient Downloading and Updating Applications on Portable Devices Using Authentication Trees. CARDIS 2000: 327-344 - [c15]Heiko Ludwig, Luke O'Connor, Simon Kramer:
MIERA: Method for Inter-Enterprise Role-Based Authorization. EC-Web 2000: 133-144
1990 – 1999
- 1999
- [c14]Philip Hawkes, Luke O'Connor:
XOR and Non-XOR Differential Probabilities. EUROCRYPT 1999: 272-285 - [c13]Luke O'Connor:
An Analysis of Exponentiation Based on Formal Languages. EUROCRYPT 1999: 375-388 - 1997
- [j8]Luke O'Connor:
Nondegenerate Functions and Permutations. Discret. Appl. Math. 73(1): 41-57 (1997) - 1996
- [c12]Philip Hawkes, Luke O'Connor:
On Applying Linear Cryptanalysis to IDEA. ASIACRYPT 1996: 105-115 - [c11]Zoran Milosevic, David Arnold, Luke O'Connor:
Inter-enterprise contract architecture for open distributed systems: security requirements. WETICE 1996: 68-73 - 1995
- [j7]Luke O'Connor:
A New Lower Bound on the Expected Size of Irredundant Forms for Boolean Functions. Inf. Process. Lett. 53(6): 347-353 (1995) - [j6]Luke O'Connor:
On the Distribution of Characteristics in Bijective Mappings. J. Cryptol. 8(2): 67-86 (1995) - [j5]Luke O'Connor:
A Differential Cryptananlysis of Tree-Structured Substitution-Permutation Networks. IEEE Trans. Computers 44(9): 1150-1152 (1995) - [c10]Jovan Dj. Golic, Luke O'Connor:
A Cryptanalysis of Clock-Controlled Shift Registers with Multiple Steps. Cryptography: Policy and Algorithms 1995: 174-185 - [c9]Luke O'Connor:
Convergence in Differential Distributions. EUROCRYPT 1995: 13-23 - 1994
- [j4]Luke O'Connor:
An Upper Bound on the Number of Functions Satisfying the Strict Avalanche Criterion. Inf. Process. Lett. 52(6): 325-327 (1994) - [j3]Luke O'Connor:
An Analysis of a Class of Algorithms for S-Box Construction. J. Cryptol. 7(3): 133-151 (1994) - [j2]Luke O'Connor, Andrew Klapper:
Algebraic Nonlinearity and Its Applications to Cryptography. J. Cryptol. 7(4): 213-227 (1994) - [c8]Luke O'Connor, Jovan Dj. Golic:
A Unified Markow Approach to Differential and Linear Cryptanalysis. ASIACRYPT 1994: 387-397 - [c7]Jovan Dj. Golic, Luke O'Connor:
Embedding and Probabilistic Correlation Attacks on Clock-Controlled Shift Registers. EUROCRYPT 1994: 230-243 - [c6]Chris Charnes, Luke O'Connor, Josef Pieprzyk, Reihaneh Safavi-Naini, Yuliang Zheng:
Comments on Soviet Encryption Algorithm. EUROCRYPT 1994: 433-438 - [c5]Luke O'Connor:
Properties of Linear Approximation Tables. FSE 1994: 131-136 - 1993
- [j1]William J. Caelli, Ian G. Graham, Luke O'Connor:
Cryptographic Application Programming Interfaces (APIs). Comput. Secur. 12(7): 640-645 (1993) - [c4]Luke O'Connor:
On the Distribution of Characteristics in Composite Permutations. CRYPTO 1993: 403-412 - [c3]Luke O'Connor:
On the Distribution of Characteristics in Bijective Mappings. EUROCRYPT 1993: 360-370 - 1992
- [c2]Luke O'Connor, Tim Snider:
Suffix Tree and String Complexity. EUROCRYPT 1992: 138-152 - 1991
- [c1]Luke O'Connor:
Enumerating Nondegenerate Permutations. EUROCRYPT 1991: 368-377
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 2025-01-20 23:03 CET 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:
