2008 |
29 | EE | Simon R. Blackburn,
Keith M. Martin,
Maura B. Paterson,
Douglas R. Stinson:
Key Refreshing in Wireless Sensor Networks.
ICITS 2008: 156-170 |
28 | EE | Simon R. Blackburn,
Tuvi Etzion,
Keith M. Martin,
Maura B. Paterson:
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks.
ICITS 2008: 54-69 |
27 | EE | Simon R. Blackburn,
Tuvi Etzion,
Douglas R. Stinson,
Gregory M. Zaverucha:
A bound on the size of separating hash families.
J. Comb. Theory, Ser. A 115(7): 1246-1256 (2008) |
2007 |
26 | EE | Simon R. Blackburn,
Igor Shparlinski:
Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131].
Discrete Mathematics 307(9-10): 1218-1219 (2007) |
2006 |
25 | EE | Simon R. Blackburn,
Igor Shparlinski:
Character sums and nonlinear recurrence sequences.
Discrete Mathematics 306(12): 1126-1131 (2006) |
24 | EE | Simon R. Blackburn:
Two-Dimensional Runlength Constrained Arrays With Equal Horizontal and Vertical Constraints.
IEEE Transactions on Information Theory 52(7): 3305-3309 (2006) |
23 | EE | Simon R. Blackburn,
Domingo Gomez-Perez,
Jaime Gutierrez,
Igor Shparlinski:
Reconstructing noisy polynomial evaluation in residue rings.
J. Algorithms 61(2): 47-59 (2006) |
22 | EE | Simon R. Blackburn:
Sets of permutations that generate the symmetric group pairwise.
J. Comb. Theory, Ser. A 113(7): 1572-1581 (2006) |
2004 |
21 | EE | Simon R. Blackburn,
Kenneth G. Paterson:
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan.
FSE 2004: 446-453 |
2003 |
20 | EE | Simon R. Blackburn,
Domingo Gomez-Perez,
Jaime Gutierrez,
Igor Shparlinski:
Predicting the Inversive Generator.
IMA Int. Conf. 2003: 264-275 |
19 | EE | Simon R. Blackburn:
An upper bound on the size of a code with the k-identifiable parent property.
J. Comb. Theory, Ser. A 102(1): 179-185 (2003) |
18 | EE | Simon R. Blackburn,
Andrew J. Spencer:
Products of subsets in an abelian group.
J. Comb. Theory, Ser. A 103(1): 53-68 (2003) |
17 | EE | Simon R. Blackburn:
Frameproof Codes.
SIAM J. Discrete Math. 16(3): 499-510 (2003) |
2000 |
16 | | Simon R. Blackburn,
Edlyn Teske:
Baby-Step Giant-Step Algorithms for Non-uniform Distributions.
ANTS 2000: 153-168 |
15 | EE | Simon R. Blackburn:
Perfect Hash Families: Probabilistic Methods and Explicit Constructions.
J. Comb. Theory, Ser. A 92(1): 54-60 (2000) |
1999 |
14 | | Simon R. Blackburn,
Steven D. Galbraith:
Cryptanalysis of Two Cryptosystems Based on Group Actions.
ASIACRYPT 1999: 52-61 |
13 | EE | Simon R. Blackburn,
Simon Blake-Wilson,
Mike Burmester,
Steven D. Galbraith:
Weaknesses in Shared RSA Key Generation Protocols.
IMA Int. Conf. 1999: 300-306 |
12 | | Simon R. Blackburn:
The linear complexity of the self-shrinking generator.
IEEE Transactions on Information Theory 45(6): 2073-2077 (1999) |
1998 |
11 | EE | Simon R. Blackburn,
Peter R. Wild:
Optimal Linear Perfect Hash Families.
J. Comb. Theory, Ser. A 83(2): 233-250 (1998) |
1997 |
10 | | Simon R. Blackburn:
A Generalization of Rational Interpolation Problem and the Solution of the Welch-Berlekamp Key Equation.
Des. Codes Cryptography 11(3): 223-234 (1997) |
9 | | Simon R. Blackburn,
Sean Murphy,
Kenneth G. Paterson:
Comments on "Theory and Applications of Cellular Automata in Cryptography".
IEEE Trans. Computers 46(5): 637-638 (1997) |
1996 |
8 | EE | Simon R. Blackburn,
Mike Burmester,
Yvo Desmedt,
Peter R. Wild:
Efficient Multiplicative Sharing Schemes.
EUROCRYPT 1996: 107-118 |
7 | | Simon R. Blackburn:
A Note on Sequences with the Shift and Add Property.
Des. Codes Cryptography 9(3): 251-256 (1996) |
6 | EE | Simon R. Blackburn,
Tuvi Etzion,
Kenneth G. Paterson:
Permutation Polynomials, de Bruijn Sequences, and Linear Complexity.
J. Comb. Theory, Ser. A 76(1): 55-82 (1996) |
5 | | Simon R. Blackburn:
Node Bisectors of Cayley Graphs.
Mathematical Systems Theory 29(6): 589-598 (1996) |
1995 |
4 | | Simon R. Blackburn,
Sean Murphy,
Jacques Stern:
The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings.
J. Cryptology 8(3): 157-166 (1995) |
1994 |
3 | | Ulrich Baum,
Simon R. Blackburn:
Clock-Controlled Pseudorandom Generators on Finite Groups.
FSE 1994: 6-21 |
2 | | Simon R. Blackburn:
Increasing the Rate of Output of m-Sequences.
Inf. Process. Lett. 51(2): 73-77 (1994) |
1993 |
1 | EE | Simon R. Blackburn,
Sean Murphy,
Jacques Stern:
Weakness of a Public-Key Cryptosystem Based on Factorizations of Finite Groups.
EUROCRYPT 1993: 50-54 |