Luke O’Connor

639 citations
30 papers · 414 · h-index 11

Impact in

    • 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

Luke O’Connor

30 papers receiving 338 citations

Peers

Luke O’Connor
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
Replace James Donahue with:
James Donahue United States
Sofie Verbaeten Belgium
Javier A. Pinto Chile
Kris Gybels Belgium
Tomoyuki Aotani Japan
Xiaojun Wen China
Aline Gouget France
Benjamin Weder Germany
Zhenghong Wang China
Luke O’Connor relative to James Donahue United States James Donahue's profile →
Citations per field
00.5×5×10×13×
James Donahue · 1×
Citations per year

Countries citing papers authored by Luke O’Connor

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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.

Border = papers with Luke O’Connor Line = papers co-authored together Luke O’Connor links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

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
1999109
2 199551
3 199530
4 200727
5 199521
6 199615
7 199915
8 200215
9 199513
10 200713
11 200512
12 199411
13 199511
14 199410
15
An analysis of product ciphers based on the properties of boolean functions
19929
16 19948
17 20076
18 19935
19 19995
20 20004

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.

Explore authors with similar magnitude of impact