Luke O’Connor
Impact in
- Artificial Intelligence top 5%
- Cryptographic Implementations and Security
- Coding theory and cryptography
- Internet Traffic Analysis and Secure E-voting
- Cryptography and Data Security
-
- Cryptography and Residue Arithmetic
- Information and Cyber Security
Papers in
-
- Cryptographic Implementations and Security 15
- Coding theory and cryptography 10
- Advanced Software Engineering Methodologies 1
- Internet Traffic Analysis and Secure E-voting 1
- Algorithms and Data Compression 1
-
- Cryptography and Residue Arithmetic 3
- Co-authors
- Jovan Dj. Golić (3 shared papers)Philip Hawkes (2 shared papers)Mohammad Peyravian (1 shared paper)David R. Safford (1 shared paper)Charanjit S. Jutla (1 shared paper)Rosario Gennaro (1 shared paper)Stephen M. Matyas (1 shared paper)Don Coppersmith (1 shared paper)
- Journals
- Journal of Cryptology (3 papers)Lecture notes in computer science (11 papers)Discrete Mathematics (1 paper)Discrete Applied Mathematics (1 paper)Designs Codes and Cryptography (1 paper)
- Partner nations
- AustraliaCanadaSwitzerland
In The Last Decade
Luke O’Connor
30 papers receiving 338 citations
Peers
Comparison fields: 5 of 26
- Artificial Intelligence 363
- Information Systems 26
- Discrete Mathematics and Combinatorics 4
- Computer Networks and Communications 17
- Management Information Systems 8
Countries citing papers authored by Luke O’Connor
This map shows the geographic impact of Luke O’Connor's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Luke O’Connor with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luke O’Connor more than expected).
Fields of papers citing papers by Luke O’Connor
This network shows the impact of papers produced by Luke O’Connor. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Luke O’Connor. The network helps show where Luke O’Connor may publish in the future.
Co-authors
The 22 scholars most cited alongside Luke O’Connor, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 30 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | MARS - a candidate cipher for AES | 1999 | 109 |
| 2 | 1995 | 51 | |
| 3 | 1995 | 30 | |
| 4 | 2007 | 27 | |
| 5 | 1995 | 21 | |
| 6 | 1996 | 15 | |
| 7 | 1999 | 15 | |
| 8 | 2002 | 15 | |
| 9 | 1995 | 13 | |
| 10 | 2007 | 13 | |
| 11 | 2005 | 12 | |
| 12 | 1994 | 11 | |
| 13 | 1995 | 11 | |
| 14 | 1994 | 10 | |
| 15 | An analysis of product ciphers based on the properties of boolean functions | 1992 | 9 |
| 16 | 1994 | 8 | |
| 17 | 2007 | 6 | |
| 18 | 1993 | 5 | |
| 19 | 1999 | 5 | |
| 20 | 2000 | 4 |
About Luke O’Connor
Luke O’Connor is a scholar working on Artificial Intelligence, Information Systems, Discrete Mathematics and Combinatorics, Sociology and Political Science and Computer Networks and Communications, having authored 30 papers that have together received 414 indexed citations. Recurring topics across this work include Cryptographic Implementations and Security (15 papers), Coding theory and cryptography (10 papers), Cryptography and Residue Arithmetic (3 papers), Access Control and Trust (2 papers), Advanced Software Engineering Methodologies (1 paper), Advanced Combinatorial Mathematics (1 paper), Internet Traffic Analysis and Secure E-voting (1 paper) and Algorithms and Data Compression (1 paper). The work is most often cited by research in Artificial Intelligence (363 citations), Information Systems (26 citations), Discrete Mathematics and Combinatorics (4 citations), Computer Networks and Communications (17 citations) and Management Information Systems (8 citations). Luke O’Connor has collaborated with scholars based in Australia, Canada and Switzerland. Frequent co-authors include Jovan Dj. Golić, Philip Hawkes, Mohammad Peyravian, David R. Safford, Charanjit S. Jutla, Rosario Gennaro, Stephen M. Matyas, Don Coppersmith, Shai Halevi and Andrew Klapper. Their work appears in journals such as Journal of Cryptology, Lecture notes in computer science, Discrete Mathematics, Discrete Applied Mathematics and Designs Codes and Cryptography.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.