The following pages link to Simon R. Blackburn (Q396880):
Displaying 50 items.
- Enumerating finite racks, quandles and kei (Q396881) (← links)
- On the complexity of the herding attack and some related attacks on hash functions (Q420639) (← links)
- Triangulations of the sphere, bitrades and abelian groups (Q484547) (← links)
- Honeycomb arrays (Q612962) (← links)
- The existence of \(k\)-radius sequences (Q645973) (← links)
- A note on sequences with the shift and add property (Q676916) (← links)
- Sets of permutations that generate the symmetric group pairwise. (Q855853) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- Connectivity of the uniform random intersection graph (Q1044989) (← links)
- Optimal linear perfect hash families (Q1269893) (← links)
- Groups of prime power order with derived subgroup of prime order (Q1305446) (← links)
- Increasing the rate of output of \(m\)-sequences (Q1332771) (← links)
- A generalized rational interpolation problem and the solution of the Welch-Berlekamp key equation (Q1358662) (← links)
- Orthogonal sequences of polynomials over arbitrary fields (Q1385267) (← links)
- Products of subsets in an Abelian group (Q1399908) (← links)
- Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
- The minimum Manhattan distance and minimum jump of permutations (Q1621428) (← links)
- Practical attacks against the walnut digital signature scheme (Q1633439) (← links)
- Inglenook shunting puzzles (Q1740366) (← links)
- Counting additive decompositions of quadratic residues in finite fields (Q1744826) (← links)
- An upper bound on the size of a code with the \(k\)-identifiable parent property (Q1873820) (← links)
- The cryptanalysis of a public-key implementation of finite group mappings (Q1895964) (← links)
- Permutation polynomials, de Bruijn sequences, and linear complexity (Q1924236) (← links)
- Traceability codes (Q1957960) (← links)
- On the average energy of circulant graphs (Q2479511) (← links)
- Character sums and nonlinear recurrence sequences (Q2497490) (← links)
- Permutations that separate close elements (Q2689006) (← links)
- Baby-step giant-step algorithms for non-uniform distributions (Q2739441) (← links)
- A Practical Cryptanalysis of the Algebraic Eraser (Q2835587) (← links)
- Constructing \(k\)-radius sequences (Q2840025) (← links)
- Efficient Multiplicative Sharing Schemes (Q2876891) (← links)
- The discrete logarithm problem for exponents of bounded height (Q2878833) (← links)
- On the distribution of the subset sum pseudorandom number generator on elliptic curves (Q2893492) (← links)
- Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch (Q2976949) (← links)
- Pearson Codes (Q2977040) (← links)
- Probabilistic Existence Results for Separable Codes (Q2977095) (← links)
- Non-Overlapping Codes (Q2977285) (← links)
- The Asymptotic Behavior of Grassmannian Codes (Q2989750) (← links)
- The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem (Q3056342) (← links)
- (Q3089173) (← links)
- Cryptanalysis of three matrix-based key establishment protocols (Q3096953) (← links)
- Group theory in cryptography (Q3101047) (← links)
- The probability that a pair of elements of a finite group are conjugate (Q3143917) (← links)
- Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem (Q3400063) (← links)
- Reconstructing noisy polynomial evaluation in residue rings (Q3414545) (← links)
- A comment on "A new public-key cipher system based upon the Diophantine equations" (Q3417021) (← links)
- Two-dimensional runlength constrained arrays with equal horizontal and vertical constraints (Q3546579) (← links)
- Cryptanalysis of the MST 3 public key cryptosystem (Q3558750) (← links)
- A mathematical walk in Surrey (Q3612733) (← links)
- Prolific Codes with the Identifiable Parent Property (Q3648505) (← links)
