Simon R. Blackburn
Citée par
Citée par
Connectivity of the uniform random intersection graph
SR Blackburn, S Gerke
Discrete Mathematics 309 (16), 5130-5140, 2009
Comments on" Theory and applications of cellular automata in cryptography"[with reply]
SR Blackburn, S Murphy, KG Paterson, S Nandi, PP Chaudhuri
IEEE Transactions on Computers 46 (5), 637-639, 1997
Frameproof codes
SR Blackburn
SIAM Journal on Discrete Mathematics 16 (3), 499-510, 2003
Enumeration of finite groups
SR Blackburn, PM Neumann, G Venkataraman
Cambridge University Press, 2007
Efficient multiplicative sharing schemes
SR Blackburn, M Burmester, Y Desmedt, PR Wild
International Conference on the Theory and Applications of Cryptographic …, 1996
Predicting nonlinear pseudorandom number generators
S Blackburn, D Gomez-Perez, J Gutierrez, I Shparlinski
Mathematics of Computation 74 (251), 1471-1494, 2005
The linear complexity of the self-shrinking generator
SR Blackburn
IEEE Transactions on Information Theory 45 (6), 2073-2077, 1999
Optimal linear perfect hash families
SR Blackburn, PR Wild
Journal of Combinatorial Theory, Series A 83 (2), 233-250, 1998
Perfect hash families: probabilistic methods and explicit constructions
SR Blackburn
Journal of Combinatorial Theory, Series A 92 (1), 54-60, 2000
Combinatorics and threshold cryptography
SR Blackburn
Chapman and Hall CRC Research Notes in Mathematics, 49-70, 1999
A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence
SR Blackburn
IEEE transactions on information theory 40 (5), 1702-1704, 1994
Efficient key predistribution for grid-based wireless sensor networks
SR Blackburn, T Etzion, KM Martin, MB Paterson
International conference on information theoretic security, 54-69, 2008
Permutation polynomials, de Bruijn sequences, and linear complexity
SR Blackburn, T Etzion, KG Paterson
journal of combinatorial theory, Series A 76 (1), 55-82, 1996
PIR array codes with optimal virtual server rate
SR Blackburn, T Etzion
IEEE Transactions on Information Theory 65 (10), 6136-6145, 2019
An upper bound on the size of a code with the k-identifiable parent property
SR Blackburn
Journal of Combinatorial Theory, Series A 102 (1), 179-185, 2003
Predicting the inversive generator
SR Blackburn, D Gomez-Perez, J Gutierrez, IE Shparlinski
IMA International Conference on Cryptography and Coding, 264-275, 2003
Groups of prime power order with derived subgroup of prime order
SR Blackburn
Journal of Algebra 219 (2), 625-657, 1999
On the complexity of the herding attack and some related attacks on hash functions
SR Blackburn, DR Stinson, J Upadhyay
Designs, Codes and Cryptography 64 (1-2), 171-193, 2012
Reconstructing noisy polynomial evaluation in residue rings
SR Blackburn, D Gomez-Perez, J Gutierrez, IE Shparlinski
Journal of Algorithms 61 (2), 47-59, 2006
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences
SR Blackburn
IEEE Transactions on Information Theory 43 (2), 537-548, 1997
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20