Simon R. Blackburn

	2012
58		Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay: On the complexity of the herding attack and some related attacks on hash functions. Des. Codes Cryptography 64(1-2): 171-193 (2012)
57		Simon R. Blackburn: The existence of k-radius sequences. J. Comb. Theory, Ser. A 119(1): 212-217 (2012)
	2011
56		Simon R. Blackburn: The existence of k-radius sequences CoRR abs/1101.1172: (2011)
55		Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski: On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves CoRR abs/1102.1053: (2011)
54		Simon R. Blackburn, Carlos Cid, Ciaran Mullan: Cryptanalysis of three matrix-based key establishment protocols CoRR abs/1102.2358: (2011)
53		Simon R. Blackburn, Tuvi Etzion: The asymptotic behavior of Grassmannian codes CoRR abs/1111.2713: (2011)
52		Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski: On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves. IACR Cryptology ePrint Archive 2011: 67 (2011)
51		Simon R. Blackburn, Carlos Cid, Ciaran Mullan: Cryptanalysis of three matrix-based key establishment protocols. IACR Cryptology ePrint Archive 2011: 73 (2011)
	2010
50		Simon R. Blackburn, Anastasia Panoui, Maura B. Paterson, Douglas R. Stinson: Honeycomb Arrays. Electr. J. Comb. 17(1): (2010)
49		Simon R. Blackburn: The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin-Abu cryptosystem. IACR Cryptology ePrint Archive 2010: 114 (2010)
48		Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay: On the Complexity of the Herding Attack and Some Related Attacks on Hash Functions. IACR Cryptology ePrint Archive 2010: 30 (2010)
47		Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson: Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes. IEEE Transactions on Information Theory 56(3): 1216-1229 (2010)
46		Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson: Distinct difference configurations: multihop paths and key predistribution in sensor networks. IEEE Transactions on Information Theory 56(8): 3961-3972 (2010)
45		Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng: Traceability codes. J. Comb. Theory, Ser. A 117(8): 1049-1057 (2010)
	2009
44		Simon R. Blackburn, Maura B. Paterson, Douglas R. Stinson: Putting Dots in Triangles CoRR abs/0910.4325: (2009)
43		Simon R. Blackburn, Stefanie Gerke: Connectivity of the uniform random intersection graph. Discrete Mathematics 309(16): 5130-5140 (2009)
42		Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson: Key Predistribution Techniques for Grid-Based Wireless Sensor Networks. IACR Cryptology ePrint Archive 2009: 14 (2009)
41		Simon R. Blackburn, Carlos Cid, Ciaran Mullan: Cryptanalysis of the MST_3 Public Key Cryptosystem. IACR Cryptology ePrint Archive 2009: 248 (2009)
40		Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng: Traceability Codes. IACR Cryptology ePrint Archive 2009: 46 (2009)
	2008
39		Simon R. Blackburn, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson: Key Refreshing in Wireless Sensor Networks. ICITS 2008: 156-170
38		Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson: Efficient Key Predistribution for Grid-Based Wireless Sensor Networks. ICITS 2008: 54-69
37		Simon R. Blackburn: Cryptanalysing the Critical Group: Efficiently Solving Biggs's Discrete Logarithm Problem. IACR Cryptology ePrint Archive 2008: 170 (2008)
36		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)
35		Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng: Prolific Codes with the Identifiable Parent Property. SIAM J. Discrete Math. 22(4): 1393-1410 (2008)
	2007
34		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)
33		Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng: Prolific Codes with the Identifiable Parent Property. IACR Cryptology ePrint Archive 2007: 276 (2007)
32		Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha: A Bound on the Size of Separating Hash Families. IACR Cryptology ePrint Archive 2007: 304 (2007)
	2006
31		Simon R. Blackburn, Igor Shparlinski: Character sums and nonlinear recurrence sequences. Discrete Mathematics 306(12): 1126-1131 (2006)
30		Su-Jeong Choi, Simon R. Blackburn, Peter R. Wild: Cryptanalysis of a homomorphic public-key cryptosystem over a finite group. IACR Cryptology ePrint Archive 2006: 357 (2006)
29		Simon R. Blackburn: Two-Dimensional Runlength Constrained Arrays With Equal Horizontal and Vertical Constraints. IEEE Transactions on Information Theory 52(7): 3305-3309 (2006)
28		Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms 61(2): 47-59 (2006)
27		Simon R. Blackburn: Sets of permutations that generate the symmetric group pairwise. J. Comb. Theory, Ser. A 113(7): 1572-1581 (2006)
	2005
26		Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Predicting nonlinear pseudorandom number generators. Math. Comput. 74(251): 1471-1494 (2005)
	2004
25		Simon R. Blackburn, Kenneth G. Paterson: Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. FSE 2004: 446-453
	2003
24		Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Predicting the Inversive Generator. IMA Int. Conf. 2003: 264-275
23		Simon R. Blackburn: Perfect Hash Families with Few Functions. IACR Cryptology ePrint Archive 2003: 17 (2003)
22		Simon R. Blackburn, Kenneth G. Paterson: Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. IACR Cryptology ePrint Archive 2003: 199 (2003)
21		Simon R. Blackburn, Carlos Cid, Steven D. Galbraith: Cryptanalysis of a Cryptosystem based on Drinfeld modules. IACR Cryptology ePrint Archive 2003: 223 (2003)
20		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)
19		Simon R. Blackburn, Andrew J. Spencer: Products of subsets in an abelian group. J. Comb. Theory, Ser. A 103(1): 53-68 (2003)
18		Simon R. Blackburn: Frameproof Codes. SIAM J. Discrete Math. 16(3): 499-510 (2003)
	2002
17		Simon R. Blackburn: An Upper Bound on the Size of a Code with the k-Identifiable Parent Property. IACR Cryptology ePrint Archive 2002: 101 (2002)
	2000
16		Simon R. Blackburn, Edlyn Teske: Baby-Step Giant-Step Algorithms for Non-uniform Distributions. ANTS 2000: 153-168
15		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		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		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		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		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		Simon R. Blackburn, Sean Murphy, Jacques Stern: Weakness of a Public-Key Cryptosystem Based on Factorizations of Finite Groups. EUROCRYPT 1993: 50-54

Coauthor Index

1	Ulrich Baum	[3]
2	Simon Blake-Wilson	[13]
3	Mike Burmester	[8] [13]
4	Su-Jeong Choi	[30]
5	Carlos Cid	[21] [41] [51] [54]
6	Yvo Desmedt	[8]
7	Tuvi Etzion	[6] [32] [33] [35] [36] [38] [40] [42] [45] [46] [47] [53]
8	Steven D. Galbraith	[13] [14] [21]
9	Stefanie Gerke	[43]
10	Domingo Gomez-Perez	[24] [26] [28]
11	Jaime Gutierrez	[24] [26] [28]
12	Keith M. Martin	[38] [39] [42] [46] [47]
13	Ciaran Mullan	[41] [51] [54]
14	Sean Murphy	[1] [4] [9]
15	Siaw-Lynn Ng	[33] [35] [40] [45]
16	Alina Ostafe	[52] [55]
17	Anastasia Panoui	[50]
18	Kenneth G. Paterson (Kenny Paterson)	[6] [9] [22] [25]
19	Maura B. Paterson	[38] [39] [42] [44] [46] [47] [50]
20	Igor Shparlinski	[24] [26] [28] [31] [34]
21	Igor E. Shparlinski	[52] [55]
22	Andrew J. Spencer	[19]
23	Jacques Stern	[1] [4]
24	Douglas R. Stinson	[32] [36] [39] [44] [48] [50] [58]
25	Edlyn Teske	[16]
26	Jalaj Upadhyay	[48] [58]
27	Peter R. Wild	[8] [11] [30]
28	Gregory M. Zaverucha	[32] [36]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page