default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon R. Blackburn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j55]Simon R. Blackburn, Tuvi Etzion:
Permutations that Separate Close Elements, and Rectangle Packings in the Torus. Electron. J. Comb. 31(4) (2024)- [j54]Simon R. Blackburn
, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson:
Constructions and Bounds for Codes With Restricted Overlaps. IEEE Trans. Inf. Theory 70(4): 2479-2490 (2024) - 2023
- [j53]Simon R. Blackburn:
Permutations that separate close elements. J. Comb. Theory A 196: 105734 (2023) - 2022
- [i36]Simon R. Blackburn, Jessica Claridge:
The capacity of a finite field matrix channel. CoRR abs/2210.14100 (2022) - [i35]Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson:
Constructions and bounds for codes with restricted overlaps. CoRR abs/2211.10309 (2022) - 2020
- [j52]Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson:
PIR Schemes With Small Download Complexity and Low Storage Requirements. IEEE Trans. Inf. Theory 66(1): 557-571 (2020)
2010 – 2019
- 2019
- [j51]Simon R. Blackburn:
Inglenook Shunting Puzzles. Electron. J. Comb. 26(2): 2 (2019) - [j50]Simon R. Blackburn, Cheyne Homberger, Peter Winkler:
The minimum Manhattan distance and minimum jump of permutations. J. Comb. Theory A 161: 364-386 (2019) - [j49]Simon R. Blackburn, Jessica Claridge:
Finite-Field Matrix Channels for Network Coding. IEEE Trans. Inf. Theory 65(3): 1614-1625 (2019) - [j48]Simon R. Blackburn, Tuvi Etzion:
PIR Array Codes With Optimal Virtual Server Rate. IEEE Trans. Inf. Theory 65(10): 6136-6145 (2019) - 2018
- [j47]Simon R. Blackburn, Marcus Greferath, Camilla Hollanti, Mario-Osvin Pavcevic, Joachim Rosenthal, Leo Storme, Ángeles Vázquez-Castro, Alfred Wassermann:
Preface to the special issue on network coding and designs. Des. Codes Cryptogr. 86(2): 237-238 (2018) - [c15]Ward Beullens, Simon R. Blackburn:
Practical Attacks Against the Walnut Digital Signature Scheme. ASIACRYPT (1) 2018: 35-61 - [i34]Simon R. Blackburn:
Inglenook Shunting Puzzles. CoRR abs/1810.07970 (2018) - [i33]Ward Beullens, Simon R. Blackburn:
Practical attacks against the Walnut digital signature scheme. IACR Cryptol. ePrint Arch. 2018: 318 (2018) - 2017
- [c14]Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson:
PIR schemes with small download complexity and low storage requirements. ISIT 2017: 146-150 - [c13]Simon R. Blackburn, Tuvi Etzion:
PIR array codes with optimal PIR rates. ISIT 2017: 2658-2662 - 2016
- [j46]Jos H. Weber, Kees A. Schouhamer Immink, Simon R. Blackburn:
Pearson Codes. IEEE Trans. Inf. Theory 62(1): 131-135 (2016) - [j45]Simon R. Blackburn:
Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch. IEEE Trans. Inf. Theory 62(3): 1144-1149 (2016) - [c12]Simon R. Blackburn, Matthew J. B. Robshaw:
On the Security of the Algebraic Eraser Tag Authentication Protocol. ACNS 2016: 3-17 - [c11]Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban:
A Practical Cryptanalysis of the Algebraic Eraser. CRYPTO (1) 2016: 179-189 - [i32]Simon R. Blackburn, Jessica Claridge:
Finite field matrix channels for network coding. CoRR abs/1601.06037 (2016) - [i31]Simon R. Blackburn, Matthew J. B. Robshaw:
On the security of the Algebraic Eraser tag authentication protocol. CoRR abs/1602.00860 (2016) - [i30]Simon R. Blackburn, Tuvi Etzion:
PIR Array Codes with Optimal PIR Rate. CoRR abs/1607.00235 (2016) - [i29]Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson:
PIR schemes with small download complexity and low storage requirements. CoRR abs/1609.07027 (2016) - [i28]Simon R. Blackburn, Tuvi Etzion:
PIR Array Codes with Optimal PIR Rates. CoRR abs/1609.07070 (2016) - [i27]Simon R. Blackburn, Matthew J. B. Robshaw:
On the Security of the Algebraic Eraser Tag Authentication Protocol. IACR Cryptol. ePrint Arch. 2016: 91 (2016) - 2015
- [j44]Simon R. Blackburn:
Non-Overlapping Codes. IEEE Trans. Inf. Theory 61(9): 4890-4894 (2015) - [j43]Simon R. Blackburn:
Probabilistic Existence Results for Separable Codes. IEEE Trans. Inf. Theory 61(11): 5822-5827 (2015) - [i26]Simon R. Blackburn:
Probabilistic existence results for separable codes. CoRR abs/1505.02597 (2015) - [i25]Jos H. Weber, Kees A. Schouhamer Immink, Simon R. Blackburn:
Pearson codes. CoRR abs/1509.00291 (2015) - [i24]Simon R. Blackburn:
Maximum likelihood decoding for multilevel channels with gain and offset mismatch. CoRR abs/1509.02748 (2015) - [i23]Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban:
A Practical Cryptanalysis of the Algebraic Eraser. CoRR abs/1511.03870 (2015) - [i22]Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban:
A Practical Cryptanalysis of the Algebraic Eraser. IACR Cryptol. ePrint Arch. 2015: 1102 (2015) - 2014
- [j42]Simon R. Blackburn, Thomas A. McCourt:
Triangulations of the sphere, bitrades and abelian groups. Comb. 34(5): 527-546 (2014) - [j41]Simon R. Blackburn, Sam Scott:
The discrete logarithm problem for exponents of bounded height. LMS J. Comput. Math. 17(Theory): 148-156 (2014) - 2013
- [j40]Simon R. Blackburn:
Enumerating Finite Racks, Quandles and Kei. Electron. J. Comb. 20(3): 43 (2013) - [e1]Simon R. Blackburn, Stefanie Gerke, Mark Wildon:
Surveys in Combinatorics 2013. London Mathematical Society Lecture Note Series 409, Cambridge University Press 2013, ISBN 9781139506748 [contents] - [i21]Simon R. Blackburn:
Non-overlapping codes. CoRR abs/1303.1026 (2013) - 2012
- [j39]Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay:
On the complexity of the herding attack and some related attacks on hash functions. Des. Codes Cryptogr. 64(1-2): 171-193 (2012) - [j38]Simon R. Blackburn:
The existence of k-radius sequences. J. Comb. Theory A 119(1): 212-217 (2012) - [j37]Simon R. Blackburn, John R. Britnell, Mark Wildon:
The probability that a pair of elements of a finite group are conjugate. J. Lond. Math. Soc. 86(3): 755-778 (2012) - [j36]Simon R. Blackburn, Carlos Cid, Ciaran Mullan:
Cryptanalysis of three matrix-based key establishment protocols. J. Math. Cryptol. 5(2): 159-168 (2012) - [j35]Simon R. Blackburn, James F. McKee:
Constructing k-radius sequences. Math. Comput. 81(280): 2439-2459 (2012) - [j34]Simon R. Blackburn, Tuvi Etzion:
The Asymptotic Behavior of Grassmannian Codes. IEEE Trans. Inf. Theory 58(10): 6605-6609 (2012) - 2011
- [i20]Simon R. Blackburn:
The existence of k-radius sequences. CoRR abs/1101.1172 (2011) - [i19]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) - [i18]Simon R. Blackburn, Carlos Cid, Ciaran Mullan:
Cryptanalysis of three matrix-based key establishment protocols. CoRR abs/1102.2358 (2011) - [i17]Simon R. Blackburn, Tuvi Etzion:
The asymptotic behavior of Grassmannian codes. CoRR abs/1111.2713 (2011) - [i16]Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski:
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves. IACR Cryptol. ePrint Arch. 2011: 67 (2011) - [i15]Simon R. Blackburn, Carlos Cid, Ciaran Mullan:
Cryptanalysis of three matrix-based key establishment protocols. IACR Cryptol. ePrint Arch. 2011: 73 (2011) - 2010
- [j33]Simon R. Blackburn, Anastasia Panoui, Maura B. Paterson, Douglas R. Stinson:
Honeycomb Arrays. Electron. J. Comb. 17(1) (2010) - [j32]Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng:
Traceability codes. J. Comb. Theory A 117(8): 1049-1057 (2010) - [j31]Simon R. Blackburn:
The discrete logarithm problem modulo one: cryptanalysing the Ariffin-Abu cryptosystem. J. Math. Cryptol. 4(2): 193-198 (2010) - [j30]Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson:
Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes. IEEE Trans. Inf. Theory 56(3): 1216-1229 (2010) - [j29]Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson:
Distinct difference configurations: multihop paths and key predistribution in sensor networks. IEEE Trans. Inf. Theory 56(8): 3961-3972 (2010) - [i14]Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay:
On the Complexity of the Herding Attack and Some Related Attacks on Hash Functions. IACR Cryptol. ePrint Arch. 2010: 30 (2010) - [i13]Simon R. Blackburn:
The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin-Abu cryptosystem. IACR Cryptol. ePrint Arch. 2010: 114 (2010)
2000 – 2009
- 2009
- [j28]Simon R. Blackburn, Stefanie Gerke:
Connectivity of the uniform random intersection graph. Discret. Math. 309(16): 5130-5140 (2009) - [j27]Simon R. Blackburn:
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem. J. Math. Cryptol. 3(3): 199-203 (2009) - [j26]Simon R. Blackburn, Carlos Cid, Ciaran Mullan:
Cryptanalysis of the MST 3 public key cryptosystem. J. Math. Cryptol. 3(4): 321-338 (2009) - [i12]Simon R. Blackburn, Maura B. Paterson, Douglas R. Stinson:
Putting Dots in Triangles. CoRR abs/0910.4325 (2009) - [i11]Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson:
Key Predistribution Techniques for Grid-Based Wireless Sensor Networks. IACR Cryptol. ePrint Arch. 2009: 14 (2009) - [i10]Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng:
Traceability Codes. IACR Cryptol. ePrint Arch. 2009: 46 (2009) - [i9]Simon R. Blackburn, Carlos Cid, Ciaran Mullan:
Cryptanalysis of the MST3 Public Key Cryptosystem. IACR Cryptol. ePrint Arch. 2009: 248 (2009) - 2008
- [j25]Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha:
A bound on the size of separating hash families. J. Comb. Theory A 115(7): 1246-1256 (2008) - [j24]Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng:
Prolific Codes with the Identifiable Parent Property. SIAM J. Discret. Math. 22(4): 1393-1410 (2008) - [c10]Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson:
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks. ICITS 2008: 54-69 - [c9]Simon R. Blackburn, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
Key Refreshing in Wireless Sensor Networks. ICITS 2008: 156-170 - [i8]Simon R. Blackburn:
Cryptanalysing the Critical Group: Efficiently Solving Biggs's Discrete Logarithm Problem. IACR Cryptol. ePrint Arch. 2008: 170 (2008) - 2007
- [j23]Simon R. Blackburn, Igor E. Shparlinski:
Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. Discret. Math. 307(9-10): 1218-1219 (2007) - [j22]Su-Jeong Choi, Simon R. Blackburn, Peter R. Wild:
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group. J. Math. Cryptol. 1(4): 351-358 (2007) - [i7]Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng:
Prolific Codes with the Identifiable Parent Property. IACR Cryptol. ePrint Arch. 2007: 276 (2007) - [i6]Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha:
A Bound on the Size of Separating Hash Families. IACR Cryptol. ePrint Arch. 2007: 304 (2007) - 2006
- [j21]Simon R. Blackburn, Igor E. Shparlinski:
Character sums and nonlinear recurrence sequences. Discret. Math. 306(12): 1126-1131 (2006) - [j20]Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski:
Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms 61(2): 47-59 (2006) - [j19]Simon R. Blackburn:
Sets of permutations that generate the symmetric group pairwise. J. Comb. Theory A 113(7): 1572-1581 (2006) - [j18]Simon R. Blackburn:
Two-Dimensional Runlength Constrained Arrays With Equal Horizontal and Vertical Constraints. IEEE Trans. Inf. Theory 52(7): 3305-3309 (2006) - [i5]Su-Jeong Choi, Simon R. Blackburn, Peter R. Wild:
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group. IACR Cryptol. ePrint Arch. 2006: 357 (2006) - 2005
- [j17]Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski:
Predicting nonlinear pseudorandom number generators. Math. Comput. 74(251): 1471-1494 (2005) - 2004
- [c8]Simon R. Blackburn, Kenneth G. Paterson:
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. FSE 2004: 446-453 - 2003
- [j16]Simon R. Blackburn:
An upper bound on the size of a code with the k-identifiable parent property. J. Comb. Theory A 102(1): 179-185 (2003) - [j15]Simon R. Blackburn, Andrew J. Spencer:
Products of subsets in an abelian group. J. Comb. Theory A 103(1): 53-68 (2003) - [j14]Simon R. Blackburn:
Frameproof Codes. SIAM J. Discret. Math. 16(3): 499-510 (2003) - [c7]Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski:
Predicting the Inversive Generator. IMACC 2003: 264-275 - [i4]Simon R. Blackburn:
Perfect Hash Families with Few Functions. IACR Cryptol. ePrint Arch. 2003: 17 (2003) - [i3]Simon R. Blackburn, Kenneth G. Paterson:
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. IACR Cryptol. ePrint Arch. 2003: 199 (2003) - [i2]Simon R. Blackburn, Carlos Cid, Steven D. Galbraith:
Cryptanalysis of a Cryptosystem based on Drinfeld modules. IACR Cryptol. ePrint Arch. 2003: 223 (2003) - 2002
- [i1]Simon R. Blackburn:
An Upper Bound on the Size of a Code with the k-Identifiable Parent Property. IACR Cryptol. ePrint Arch. 2002: 101 (2002) - 2000
- [j13]Simon R. Blackburn:
Perfect Hash Families: Probabilistic Methods and Explicit Constructions. J. Comb. Theory A 92(1): 54-60 (2000) - [c6]Simon R. Blackburn, Edlyn Teske:
Baby-Step Giant-Step Algorithms for Non-uniform Distributions. ANTS 2000: 153-168
1990 – 1999
- 1999
- [j12]Simon R. Blackburn:
The linear complexity of the self-shrinking generator. IEEE Trans. Inf. Theory 45(6): 2073-2077 (1999) - [c5]Simon R. Blackburn, Steven D. Galbraith:
Cryptanalysis of Two Cryptosystems Based on Group Actions. ASIACRYPT 1999: 52-61 - [c4]Simon R. Blackburn, Simon Blake-Wilson, Mike Burmester, Steven D. Galbraith:
Weaknesses in Shared RSA Key Generation Protocols. IMACC 1999: 300-306 - 1998
- [j11]Simon R. Blackburn, Peter R. Wild:
Optimal Linear Perfect Hash Families. J. Comb. Theory A 83(2): 233-250 (1998) - 1997
- [j10]Simon R. Blackburn:
A Generalization of Rational Interpolation Problem and the Solution of the Welch-Berlekamp Key Equation. Des. Codes Cryptogr. 11(3): 223-234 (1997) - [j9]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) - [j8]Simon R. Blackburn:
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences. IEEE Trans. Inf. Theory 43(2): 537-548 (1997) - 1996
- [j7]Simon R. Blackburn:
A Note on Sequences with the Shift and Add Property. Des. Codes Cryptogr. 9(3): 251-256 (1996) - [j6]Simon R. Blackburn, Tuvi Etzion, Kenneth G. Paterson:
Permutation Polynomials, de Bruijn Sequences, and Linear Complexity. J. Comb. Theory A 76(1): 55-82 (1996) - [j5]Simon R. Blackburn:
Node Bisectors of Cayley Graphs. Math. Syst. Theory 29(6): 589-598 (1996) - [j4]Simon R. Blackburn, William G. Chambers:
Some remarks on an algorithm of Fitzpatrick. IEEE Trans. Inf. Theory 42(4): 1269-1271 (1996) - [c3]Simon R. Blackburn, Mike Burmester, Yvo Desmedt, Peter R. Wild:
Efficient Multiplicative Sharing Schemes. EUROCRYPT 1996: 107-118 - 1995
- [j3]Simon R. Blackburn, Sean Murphy, Jacques Stern:
The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings. J. Cryptol. 8(3): 157-166 (1995) - 1994
- [j2]Simon R. Blackburn:
Increasing the Rate of Output of m-Sequences. Inf. Process. Lett. 51(2): 73-77 (1994) - [j1]Simon R. Blackburn:
A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence. IEEE Trans. Inf. Theory 40(5): 1702-1704 (1994) - [c2]Ulrich Baum, Simon R. Blackburn:
Clock-Controlled Pseudorandom Generators on Finite Groups. FSE 1994: 6-21 - 1993
- [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
