Simon R. Blackburn

From MaRDI portal
Person:396880

Available identifiers

zbMath Open blackburn.simon-rWikidataQ102203685 ScholiaQ102203685MaRDI QIDQ396880

List of research outcomes





PublicationDate of PublicationType
Permutations that separate close elements, and rectangle packings in the torus2024-11-09Paper
Constructions and bounds for codes with restricted overlaps2024-07-22Paper
Block‐avoiding point sequencings2024-02-02Paper
Subsets of free groups with distinct differences2023-07-07Paper
Permutations that separate close elements, and rectangle packings in the torus2023-06-06Paper
Permutations that separate close elements2023-03-06Paper
Constructions and bounds for codes with restricted overlaps2022-11-18Paper
The capacity of a finite field matrix channel2022-10-25Paper
Permutations that separate close elements2022-07-20Paper
The enumeration of finite rings2021-07-28Paper
PIR Array Codes With Optimal Virtual Server Rate2020-01-28Paper
PIR Schemes With Small Download Complexity and Low Storage Requirements2020-01-28Paper
Inglenook shunting puzzles2019-04-30Paper
Finite-Field Matrix Channels for Network Coding2019-03-28Paper
Practical attacks against the walnut digital signature scheme2018-12-20Paper
The minimum Manhattan distance and minimum jump of permutations2018-11-08Paper
Counting additive decompositions of quadratic residues in finite fields2018-04-20Paper
Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes2017-07-27Paper
Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks2017-07-27Paper
The Asymptotic Behavior of Grassmannian Codes2017-06-08Paper
Probabilistic Existence Results for Separable Codes2017-04-28Paper
Non-Overlapping Codes2017-04-28Paper
Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch2017-04-28Paper
Pearson Codes2017-04-28Paper
A Practical Cryptanalysis of the Algebraic Eraser2016-11-30Paper
Triangulations of the sphere, bitrades and abelian groups2015-01-07Paper
The discrete logarithm problem for exponents of bounded height2014-09-05Paper
Efficient Multiplicative Sharing Schemes2014-08-20Paper
Enumerating finite racks, quandles and kei2014-08-14Paper
Constructing \(k\)-radius sequences2013-07-17Paper
The probability that a pair of elements of a finite group are conjugate2012-12-06Paper
On the distribution of the subset sum pseudorandom number generator on elliptic curves2012-06-20Paper
On the complexity of the herding attack and some related attacks on hash functions2012-05-22Paper
Group theory in cryptography2011-11-22Paper
Cryptanalysis of three matrix-based key establishment protocols2011-11-15Paper
The existence of \(k\)-radius sequences2011-11-11Paper
https://portal.mardi4nfdi.de/entity/Q30891732011-08-24Paper
Honeycomb arrays2010-12-16Paper
The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem2010-11-12Paper
Traceability codes2010-09-27Paper
Cryptanalysis of the MST 3 public key cryptosystem2010-05-06Paper
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem2010-02-05Paper
Connectivity of the uniform random intersection graph2009-12-15Paper
Prolific Codes with the Identifiable Parent Property2009-11-27Paper
A mathematical walk in Surrey2009-03-10Paper
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks2009-01-09Paper
Key Refreshing in Wireless Sensor Networks2009-01-09Paper
Two-dimensional runlength constrained arrays with equal horizontal and vertical constraints2008-12-21Paper
A bound on the size of separating hash families2008-12-08Paper
https://portal.mardi4nfdi.de/entity/Q53858412008-05-07Paper
On the average energy of circulant graphs2008-03-26Paper
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group2008-02-21Paper
Cryptography and Coding2007-11-28Paper
Reconstructing noisy polynomial evaluation in residue rings2007-01-09Paper
A comment on "A new public-key cipher system based upon the Diophantine equations"2007-01-09Paper
Sets of permutations that generate the symmetric group pairwise.2006-12-07Paper
Character sums and nonlinear recurrence sequences2006-08-04Paper
Fast Software Encryption2005-12-27Paper
Predicting nonlinear pseudorandom number generators2005-04-27Paper
Frameproof Codes2004-01-08Paper
https://portal.mardi4nfdi.de/entity/Q44322072003-10-22Paper
Products of subsets in an Abelian group2003-07-30Paper
An upper bound on the size of a code with the \(k\)-identifiable parent property2003-05-27Paper
https://portal.mardi4nfdi.de/entity/Q27394412002-12-01Paper
https://portal.mardi4nfdi.de/entity/Q49453782002-03-18Paper
Perfect hash families: Probabilistic methods and explicit constructions2000-11-14Paper
https://portal.mardi4nfdi.de/entity/Q45024852000-09-12Paper
The linear complexity of the self-shrinking generator2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q44848772000-06-05Paper
https://portal.mardi4nfdi.de/entity/Q49347282000-02-01Paper
Groups of prime power order with derived subgroup of prime order1999-11-14Paper
Orthogonal sequences of polynomials over arbitrary fields1999-07-07Paper
https://portal.mardi4nfdi.de/entity/Q42405601999-06-13Paper
Optimal linear perfect hash families1998-10-18Paper
https://portal.mardi4nfdi.de/entity/Q43361991998-06-07Paper
A generalized rational interpolation problem and the solution of the Welch-Berlekamp key equation1998-05-18Paper
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences1998-02-23Paper
Permutation polynomials, de Bruijn sequences, and linear complexity1997-10-01Paper
A note on sequences with the shift and add property1997-08-17Paper
https://portal.mardi4nfdi.de/entity/Q43493181997-08-17Paper
Node bisectors of Cayley graphs1996-12-01Paper
Some remarks on an algorithm of Fitzpatrick1996-07-28Paper
The cryptanalysis of a public-key implementation of finite group mappings1995-09-26Paper
A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence1995-03-01Paper
Enumeration within Isoclinism Classes of Groups of Prime Power Order1994-12-18Paper
Increasing the rate of output of \(m\)-sequences1994-10-19Paper
Exponent-Critical GroupsN/APaper

Research outcomes over time

This page was built for person: Simon R. Blackburn