Simon R. Blackburn

According to our database1, Simon R. Blackburn authored at least 75 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Permutations that separate close elements.
J. Comb. Theory, Ser. A, May, 2023

2022
Constructions and bounds for codes with restricted overlaps.
CoRR, 2022

The capacity of a finite field matrix channel.
CoRR, 2022

2020
PIR Schemes With Small Download Complexity and Low Storage Requirements.
IEEE Trans. Inf. Theory, 2020

2019
PIR Array Codes With Optimal Virtual Server Rate.
IEEE Trans. Inf. Theory, 2019

Finite-Field Matrix Channels for Network Coding.
IEEE Trans. Inf. Theory, 2019

The minimum Manhattan distance and minimum jump of permutations.
J. Comb. Theory, Ser. A, 2019

Inglenook Shunting Puzzles.
Electron. J. Comb., 2019

2018
Practical attacks against the Walnut digital signature scheme.
IACR Cryptol. ePrint Arch., 2018

Preface to the special issue on network coding and designs.
Des. Codes Cryptogr., 2018

2017
PIR array codes with optimal PIR rates.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Pearson Codes.
IEEE Trans. Inf. Theory, 2016

Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch.
IEEE Trans. Inf. Theory, 2016

On the Security of the Algebraic Eraser Tag Authentication Protocol.
IACR Cryptol. ePrint Arch., 2016

PIR Array Codes with Optimal PIR Rate.
CoRR, 2016

2015
Probabilistic Existence Results for Separable Codes.
IEEE Trans. Inf. Theory, 2015

Non-Overlapping Codes.
IEEE Trans. Inf. Theory, 2015

A Practical Cryptanalysis of the Algebraic Eraser.
IACR Cryptol. ePrint Arch., 2015

2014
Triangulations of the sphere, bitrades and abelian groups.
Comb., 2014

2013
Enumerating Finite Racks, Quandles and Kei.
Electron. J. Comb., 2013

2012
The Asymptotic Behavior of Grassmannian Codes.
IEEE Trans. Inf. Theory, 2012

Constructing k-radius sequences.
Math. Comput., 2012

The probability that a pair of elements of a finite group are conjugate.
J. Lond. Math. Soc., 2012

The existence of k-radius sequences.
J. Comb. Theory, Ser. A, 2012

On the complexity of the herding attack and some related attacks on hash functions.
Des. Codes Cryptogr., 2012

2011
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves.
IACR Cryptol. ePrint Arch., 2011

Cryptanalysis of three matrix-based key establishment protocols.
IACR Cryptol. ePrint Arch., 2011

2010
Distinct difference configurations: multihop paths and key predistribution in sensor networks.
IEEE Trans. Inf. Theory, 2010

Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes.
IEEE Trans. Inf. Theory, 2010

The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin-Abu cryptosystem.
IACR Cryptol. ePrint Arch., 2010

Honeycomb Arrays.
Electron. J. Comb., 2010

2009
Cryptanalysis of the MST 3 public key cryptosystem.
J. Math. Cryptol., 2009

Traceability Codes.
IACR Cryptol. ePrint Arch., 2009

Key Predistribution Techniques for Grid-Based Wireless Sensor Networks.
IACR Cryptol. ePrint Arch., 2009

Cryptanalysis of the MST<sub>3</sub> Public Key Cryptosystem.
IACR Cryptol. ePrint Arch., 2009

Connectivity of the uniform random intersection graph.
Discret. Math., 2009

Putting Dots in Triangles
CoRR, 2009

2008
Prolific Codes with the Identifiable Parent Property.
SIAM J. Discret. Math., 2008

Cryptanalysing the Critical Group: Efficiently Solving Biggs's Discrete Logarithm Problem.
IACR Cryptol. ePrint Arch., 2008

Key Refreshing in Wireless Sensor Networks.
Proceedings of the Information Theoretic Security, Third International Conference, 2008

Efficient Key Predistribution for Grid-Based Wireless Sensor Networks.
Proceedings of the Information Theoretic Security, Third International Conference, 2008

2007
A Bound on the Size of Separating Hash Families.
IACR Cryptol. ePrint Arch., 2007

Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131].
Discret. Math., 2007

2006
Two-Dimensional Runlength Constrained Arrays With Equal Horizontal and Vertical Constraints.
IEEE Trans. Inf. Theory, 2006

Sets of permutations that generate the symmetric group pairwise.
J. Comb. Theory, Ser. A, 2006

Reconstructing noisy polynomial evaluation in residue rings.
J. Algorithms, 2006

Cryptanalysis of a homomorphic public-key cryptosystem over a finite group.
IACR Cryptol. ePrint Arch., 2006

Character sums and nonlinear recurrence sequences.
Discret. Math., 2006

2005
Predicting nonlinear pseudorandom number generators.
Math. Comput., 2005

2003
Frameproof Codes.
SIAM J. Discret. Math., 2003

Products of subsets in an abelian group.
J. Comb. Theory, Ser. A, 2003

Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan.
IACR Cryptol. ePrint Arch., 2003

Cryptanalysis of a Cryptosystem based on Drinfeld modules.
IACR Cryptol. ePrint Arch., 2003

Perfect Hash Families with Few Functions.
IACR Cryptol. ePrint Arch., 2003

Predicting the Inversive Generator.
Proceedings of the Cryptography and Coding, 2003

2002
An Upper Bound on the Size of a Code with the k-Identifiable Parent Property.
IACR Cryptol. ePrint Arch., 2002

2000
Perfect Hash Families: Probabilistic Methods and Explicit Constructions.
J. Comb. Theory, Ser. A, 2000

Baby-Step Giant-Step Algorithms for Non-uniform Distributions.
Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1999
The linear complexity of the self-shrinking generator.
IEEE Trans. Inf. Theory, 1999

Weaknesses in Shared RSA Key Generation Protocols.
Proceedings of the Cryptography and Coding, 1999

Cryptanalysis of Two Cryptosystems Based on Group Actions.
Proceedings of the Advances in Cryptology, 1999

1998
Optimal Linear Perfect Hash Families.
J. Comb. Theory, Ser. A, 1998

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

Comments on "Theory and Applications of Cellular Automata in Cryptography".
IEEE Trans. Computers, 1997

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

1996
Some remarks on an algorithm of Fitzpatrick.
IEEE Trans. Inf. Theory, 1996

Node Bisectors of Cayley Graphs.
Math. Syst. Theory, 1996

Permutation Polynomials, de Bruijn Sequences, and Linear Complexity.
J. Comb. Theory, Ser. A, 1996

A Note on Sequences with the Shift and Add Property.
Des. Codes Cryptogr., 1996

Efficient Multiplicative Sharing Schemes.
Proceedings of the Advances in Cryptology, 1996

1995
The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings.
J. Cryptol., 1995

1994
A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence.
IEEE Trans. Inf. Theory, 1994

Increasing the Rate of Output of m-Sequences.
Inf. Process. Lett., 1994

Clock-Controlled Pseudorandom Generators on Finite Groups.
Proceedings of the Fast Software Encryption: Second International Workshop. Leuven, 1994

1993
Weakness of a Public-Key Cryptosystem Based on Factorizations of Finite Groups.
Proceedings of the Advances in Cryptology, 1993


  Loading...