Weakness of a Public-Key Cryptosystem Based on Factorizations of Finite Groups. - Simon R. Blackburn; Sean Murphy; Jacques Stern (EUROCRYPT, 1993)

Clock-Controlled Pseudorandom Generators on Finite Groups. - Ulrich Baum; Simon R. Blackburn (FSE, 1994)

Increasing the Rate of Output of m-Sequences. - Simon R. Blackburn (Inf. Process. Lett., 1994)

A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence. - Simon R. Blackburn (IEEE Trans. Inf. Theory, 1994)

The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings. - Simon R. Blackburn; Sean Murphy; Jacques Stern (J. Cryptol., 1995)

Efficient Multiplicative Sharing Schemes. - Simon R. Blackburn; Mike Burmester; Yvo Desmedt; Peter R. Wild (EUROCRYPT, 1996)

A Note on Sequences with the Shift and Add Property. - Simon R. Blackburn (Des. Codes Cryptogr., 1996)

Permutation Polynomials, de Bruijn Sequences, and Linear Complexity. - Simon R. Blackburn; Tuvi Etzion; Kenneth G. Paterson (J. Comb. Theory A, 1996)

Node Bisectors of Cayley Graphs. - Simon R. Blackburn (Math. Syst. Theory, 1996)

Some remarks on an algorithm of Fitzpatrick. - Simon R. Blackburn; William G. Chambers (IEEE Trans. Inf. Theory, 1996)

A Generalization of Rational Interpolation Problem and the Solution of the Welch-Berlekamp Key Equation. - Simon R. Blackburn (Des. Codes Cryptogr., 1997)

Comments on "Theory and Applications of Cellular Automata in Cryptography". - Simon R. Blackburn; Sean Murphy; Kenneth G. Paterson (IEEE Trans. Computers, 1997)

Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences. - Simon R. Blackburn (IEEE Trans. Inf. Theory, 1997)

Optimal Linear Perfect Hash Families. - Simon R. Blackburn; Peter R. Wild (J. Comb. Theory A, 1998)

Cryptanalysis of Two Cryptosystems Based on Group Actions. - Simon R. Blackburn; Steven D. Galbraith (ASIACRYPT, 1999)

Weaknesses in Shared RSA Key Generation Protocols. - Simon R. Blackburn; Simon Blake-Wilson; Mike Burmester; Steven D. Galbraith (IMACC, 1999)

The linear complexity of the self-shrinking generator. - Simon R. Blackburn (IEEE Trans. Inf. Theory, 1999)

Baby-Step Giant-Step Algorithms for Non-uniform Distributions. - Simon R. Blackburn; Edlyn Teske (ANTS, 2000)

Perfect Hash Families: Probabilistic Methods and Explicit Constructions. - Simon R. Blackburn (J. Comb. Theory A, 2000)

Predicting the Inversive Generator. - Simon R. Blackburn; Domingo Gómez-Pérez; Jaime Gutierrez 001; Igor E. Shparlinski (IMACC, 2003)

Perfect Hash Families with Few Functions. - Simon R. Blackburn (IACR Cryptol. ePrint Arch., 2003)

Cryptanalysis of a Cryptosystem based on Drinfeld modules. - Simon R. Blackburn; Carlos Cid; Steven D. Galbraith (IACR Cryptol. ePrint Arch., 2003)

Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. - Simon R. Blackburn; Kenneth G. Paterson (IACR Cryptol. ePrint Arch., 2003)

An upper bound on the size of a code with the k-identifiable parent property. - Simon R. Blackburn (J. Comb. Theory A, 2003)

Products of subsets in an abelian group. - Simon R. Blackburn; Andrew J. Spencer (J. Comb. Theory A, 2003)

Frameproof Codes. - Simon R. Blackburn (SIAM J. Discret. Math., 2003)

Predicting nonlinear pseudorandom number generators. - Simon R. Blackburn; Domingo Gómez-Pérez; Jaime Gutierrez 001; Igor E. Shparlinski (Math. Comput., 2005)

Character sums and nonlinear recurrence sequences. - Simon R. Blackburn; Igor E. Shparlinski (Discret. Math., 2006)

Reconstructing noisy polynomial evaluation in residue rings. - Simon R. Blackburn; Domingo Gómez-Pérez; Jaime Gutierrez 001; Igor E. Shparlinski (J. Algorithms, 2006)

Sets of permutations that generate the symmetric group pairwise. - Simon R. Blackburn (J. Comb. Theory A, 2006)

Two-Dimensional Runlength Constrained Arrays With Equal Horizontal and Vertical Constraints. - Simon R. Blackburn (IEEE Trans. Inf. Theory, 2006)

Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. - Simon R. Blackburn; Igor E. Shparlinski (Discret. Math., 2007)

Cryptanalysis of a homomorphic public-key cryptosystem over a finite group. - Su-Jeong Choi; Simon R. Blackburn; Peter R. Wild (J. Math. Cryptol., 2007)

Efficient Key Predistribution for Grid-Based Wireless Sensor Networks. - Simon R. Blackburn; Tuvi Etzion; Keith M. Martin; Maura B. Paterson (ICITS, 2008)

Key Refreshing in Wireless Sensor Networks. - Simon R. Blackburn; Keith M. Martin; Maura B. Paterson; Douglas R. Stinson (ICITS, 2008)

A bound on the size of separating hash families. - Simon R. Blackburn; Tuvi Etzion; Douglas R. Stinson; Gregory M. Zaverucha (J. Comb. Theory A, 2008)

Prolific Codes with the Identifiable Parent Property. - Simon R. Blackburn; Tuvi Etzion; Siaw-Lynn Ng (SIAM J. Discret. Math., 2008)

Putting Dots in Triangles - Simon R. Blackburn; Maura B. Paterson; Douglas R. Stinson (CoRR, 2009)

Connectivity of the uniform random intersection graph. - Simon R. Blackburn; Stefanie Gerke (Discret. Math., 2009)

Cryptanalysis of the MST3 Public Key Cryptosystem. - Simon R. Blackburn; Carlos Cid; Ciaran Mullan (IACR Cryptol. ePrint Arch., 2009)

Key Predistribution Techniques for Grid-Based Wireless Sensor Networks. - Simon R. Blackburn; Tuvi Etzion; Keith M. Martin; Maura B. Paterson (IACR Cryptol. ePrint Arch., 2009)

Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem. - Simon R. Blackburn (J. Math. Cryptol., 2009)

Cryptanalysis of the MST 3 public key cryptosystem. - Simon R. Blackburn; Carlos Cid; Ciaran Mullan (J. Math. Cryptol., 2009)

Honeycomb Arrays. - Simon R. Blackburn; Anastasia Panoui; Maura B. Paterson; Douglas R. Stinson (Electron. J. Comb., 2010)

Traceability codes. - Simon R. Blackburn; Tuvi Etzion; Siaw-Lynn Ng (J. Comb. Theory A, 2010)

The discrete logarithm problem modulo one: cryptanalysing the Ariffin-Abu cryptosystem. - Simon R. Blackburn (J. Math. Cryptol., 2010)

Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes. - Simon R. Blackburn; Tuvi Etzion; Keith M. Martin; Maura B. Paterson (IEEE Trans. Inf. Theory, 2010)

Distinct difference configurations: multihop paths and key predistribution in sensor networks. - Simon R. Blackburn; Tuvi Etzion; Keith M. Martin; Maura B. Paterson (IEEE Trans. Inf. Theory, 2010)

On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves. - Simon R. Blackburn; Alina Ostafe; Igor E. Shparlinski (IACR Cryptol. ePrint Arch., 2011)

On the complexity of the herding attack and some related attacks on hash functions. - Simon R. Blackburn; Douglas R. Stinson; Jalaj Upadhyay (Des. Codes Cryptogr., 2012)

The existence of k-radius sequences. - Simon R. Blackburn (J. Comb. Theory A, 2012)

The probability that a pair of elements of a finite group are conjugate. - Simon R. Blackburn; John R. Britnell; Mark Wildon (J. Lond. Math. Soc., 2012)

Cryptanalysis of three matrix-based key establishment protocols. - Simon R. Blackburn; Carlos Cid; Ciaran Mullan (J. Math. Cryptol., 2012)

Constructing k-radius sequences. - Simon R. Blackburn; James F. McKee (Math. Comput., 2012)

The Asymptotic Behavior of Grassmannian Codes. - Simon R. Blackburn; Tuvi Etzion (IEEE Trans. Inf. Theory, 2012)

Enumerating Finite Racks, Quandles and Kei. - Simon R. Blackburn (Electron. J. Comb., 2013)

Triangulations of the sphere, bitrades and abelian groups. - Simon R. Blackburn; Thomas A. McCourt (Comb., 2014)

The discrete logarithm problem for exponents of bounded height. - Simon R. Blackburn; Sam Scott (LMS J. Comput. Math., 2014)

A Practical Cryptanalysis of the Algebraic Eraser. - Adi Ben-Zvi; Simon R. Blackburn; Boaz Tsaban (IACR Cryptol. ePrint Arch., 2015)

Non-Overlapping Codes. - Simon R. Blackburn (IEEE Trans. Inf. Theory, 2015)

Probabilistic Existence Results for Separable Codes. - Simon R. Blackburn (IEEE Trans. Inf. Theory, 2015)

PIR Array Codes with Optimal PIR Rate. - Simon R. Blackburn; Tuvi Etzion (CoRR, 2016)

On the Security of the Algebraic Eraser Tag Authentication Protocol. - Simon R. Blackburn; Matthew J. B. Robshaw (IACR Cryptol. ePrint Arch., 2016)

Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch. - Simon R. Blackburn (IEEE Trans. Inf. Theory, 2016)

Pearson Codes. - Jos H. Weber; Kees A. Schouhamer Immink; Simon R. Blackburn (IEEE Trans. Inf. Theory, 2016)

PIR array codes with optimal PIR rates. - Simon R. Blackburn; Tuvi Etzion (ISIT, 2017)

Preface to the special issue on network coding and designs. - Simon R. Blackburn; Marcus Greferath; Camilla Hollanti; Mario-Osvin Pavcevic; Joachim Rosenthal; Leo Storme; Ángeles Vázquez-Castro; Alfred Wassermann (Des. Codes Cryptogr., 2018)

Practical attacks against the Walnut digital signature scheme. - Ward Beullens; Simon R. Blackburn (IACR Cryptol. ePrint Arch., 2018)

Inglenook Shunting Puzzles. - Simon R. Blackburn (Electron. J. Comb., 2019)

The minimum Manhattan distance and minimum jump of permutations. - Simon R. Blackburn; Cheyne Homberger; Peter Winkler 003 (J. Comb. Theory A, 2019)

Finite-Field Matrix Channels for Network Coding. - Simon R. Blackburn; Jessica Claridge (IEEE Trans. Inf. Theory, 2019)

PIR Array Codes With Optimal Virtual Server Rate. - Simon R. Blackburn; Tuvi Etzion (IEEE Trans. Inf. Theory, 2019)

PIR Schemes With Small Download Complexity and Low Storage Requirements. - Simon R. Blackburn; Tuvi Etzion; Maura B. Paterson (IEEE Trans. Inf. Theory, 2020)

Permutations that separate close elements. - Simon R. Blackburn (J. Comb. Theory A, 2023)

Permutations that Separate Close Elements, and Rectangle Packings in the Torus. - Simon R. Blackburn; Tuvi Etzion (Electron. J. Comb., 2024)

Constructions and Bounds for Codes With Restricted Overlaps. - Simon R. Blackburn; Navid Nasr Esfahani; Donald L. Kreher; Douglas R. Stinson (IEEE Trans. Inf. Theory, 2024)

The Capacity of a Finite Field Matrix Channel. - Simon R. Blackburn; Jessica Claridge (IEEE Trans. Inf. Theory, 2025)