| Publication | Date of Publication | Type |
|---|
Permutations that separate close elements, and rectangle packings in the torus
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
Constructions and bounds for codes with restricted overlaps
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Block‐avoiding point sequencings
Journal of Combinatorial Designs | 2024-02-02 | Paper |
Subsets of free groups with distinct differences
| 2023-07-07 | Paper |
Permutations that separate close elements, and rectangle packings in the torus
| 2023-06-06 | Paper |
Permutations that separate close elements
Journal of Combinatorial Theory. Series A | 2023-03-06 | Paper |
Constructions and bounds for codes with restricted overlaps
| 2022-11-18 | Paper |
The capacity of a finite field matrix channel
| 2022-10-25 | Paper |
Permutations that separate close elements
| 2022-07-20 | Paper |
The enumeration of finite rings
| 2021-07-28 | Paper |
PIR Array Codes With Optimal Virtual Server Rate
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
PIR Schemes With Small Download Complexity and Low Storage Requirements
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Inglenook shunting puzzles
The Electronic Journal of Combinatorics | 2019-04-30 | Paper |
Finite-Field Matrix Channels for Network Coding
IEEE Transactions on Information Theory | 2019-03-28 | Paper |
Practical attacks against the walnut digital signature scheme
| 2018-12-20 | Paper |
The minimum Manhattan distance and minimum jump of permutations
Journal of Combinatorial Theory. Series A | 2018-11-08 | Paper |
Counting additive decompositions of quadratic residues in finite fields
Functiones et Approximatio. Commentarii Mathematici | 2018-04-20 | Paper |
Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
The Asymptotic Behavior of Grassmannian Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Probabilistic Existence Results for Separable Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Non-Overlapping Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Pearson Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A practical cryptanalysis of the Algebraic Eraser
Advances in Cryptology – CRYPTO 2016 | 2016-11-30 | Paper |
Triangulations of the sphere, bitrades and abelian groups
Combinatorica | 2015-01-07 | Paper |
The discrete logarithm problem for exponents of bounded height
LMS Journal of Computation and Mathematics | 2014-09-05 | Paper |
Efficient Multiplicative Sharing Schemes
Advances in Cryptology — EUROCRYPT ’96 | 2014-08-20 | Paper |
Enumerating finite racks, quandles and kei
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Constructing \(k\)-radius sequences
Mathematics of Computation | 2013-07-17 | Paper |
The probability that a pair of elements of a finite group are conjugate.
Journal of the London Mathematical Society | 2012-12-06 | Paper |
On the distribution of the subset sum pseudorandom number generator on elliptic curves
Uniform Distribution Theory | 2012-06-20 | Paper |
On the complexity of the herding attack and some related attacks on hash functions
Designs, Codes and Cryptography | 2012-05-22 | Paper |
Group theory in cryptography
| 2011-11-22 | Paper |
Cryptanalysis of three matrix-based key establishment protocols
Journal of Mathematical Cryptology | 2011-11-15 | Paper |
The existence of \(k\)-radius sequences
Journal of Combinatorial Theory. Series A | 2011-11-11 | Paper |
Putting dots in triangles
| 2011-08-24 | Paper |
Honeycomb arrays
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
The discrete logarithm problem modulo one: cryptanalysing the Ariffin-Abu cryptosystem
Journal of Mathematical Cryptology | 2010-11-12 | Paper |
Traceability codes
Journal of Combinatorial Theory. Series A | 2010-09-27 | Paper |
Cryptanalysis of the \(MST_{3}\) public key cryptosystem
Journal of Mathematical Cryptology | 2010-05-06 | Paper |
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
Journal of Mathematical Cryptology | 2010-02-05 | Paper |
Connectivity of the uniform random intersection graph
Discrete Mathematics | 2009-12-15 | Paper |
Prolific Codes with the Identifiable Parent Property
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
A mathematical walk in Surrey
BSHM Bulletin: Journal of the British Society for the History of Mathematics | 2009-03-10 | Paper |
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
Lecture Notes in Computer Science | 2009-01-09 | Paper |
Key Refreshing in Wireless Sensor Networks
Lecture Notes in Computer Science | 2009-01-09 | Paper |
Two-dimensional runlength constrained arrays with equal horizontal and vertical constraints
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A bound on the size of separating hash families
Journal of Combinatorial Theory. Series A | 2008-12-08 | Paper |
scientific article; zbMATH DE number 5272192 (Why is no real title available?)
| 2008-05-07 | Paper |
On the average energy of circulant graphs
Linear Algebra and its Applications | 2008-03-26 | Paper |
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
Journal of Mathematical Cryptology | 2008-02-21 | Paper |
Cryptography and Coding
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Reconstructing noisy polynomial evaluation in residue rings
Journal of Algorithms | 2007-01-09 | Paper |
A comment on "A new public-key cipher system based upon the Diophantine equations"
IEEE Transactions on Computers | 2007-01-09 | Paper |
Sets of permutations that generate the symmetric group pairwise.
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
Character sums and nonlinear recurrence sequences
Discrete Mathematics | 2006-08-04 | Paper |
Fast Software Encryption
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Predicting nonlinear pseudorandom number generators
Mathematics of Computation | 2005-04-27 | Paper |
Frameproof Codes
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
scientific article; zbMATH DE number 1996248 (Why is no real title available?)
| 2003-10-22 | Paper |
Products of subsets in an Abelian group
Journal of Combinatorial Theory. Series A | 2003-07-30 | Paper |
An upper bound on the size of a code with the \(k\)-identifiable parent property
Journal of Combinatorial Theory. Series A | 2003-05-27 | Paper |
scientific article; zbMATH DE number 1643924 (Why is no real title available?)
| 2002-12-01 | Paper |
scientific article; zbMATH DE number 1424181 (Why is no real title available?)
| 2002-03-18 | Paper |
Perfect hash families: Probabilistic methods and explicit constructions
Journal of Combinatorial Theory. Series A | 2000-11-14 | Paper |
scientific article; zbMATH DE number 1504539 (Why is no real title available?)
| 2000-09-12 | Paper |
The linear complexity of the self-shrinking generator
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
scientific article; zbMATH DE number 1455083 (Why is no real title available?)
| 2000-06-05 | Paper |
scientific article; zbMATH DE number 1394312 (Why is no real title available?)
| 2000-02-01 | Paper |
Groups of prime power order with derived subgroup of prime order
Journal of Algebra | 1999-11-14 | Paper |
Orthogonal sequences of polynomials over arbitrary fields
Journal of Number Theory | 1999-07-07 | Paper |
scientific article; zbMATH DE number 1284201 (Why is no real title available?)
| 1999-06-13 | Paper |
Optimal linear perfect hash families
Journal of Combinatorial Theory. Series A | 1998-10-18 | Paper |
scientific article; zbMATH DE number 1008447 (Why is no real title available?)
| 1998-06-07 | Paper |
A generalized rational interpolation problem and the solution of the Welch-Berlekamp key equation
Designs, Codes and Cryptography | 1998-05-18 | Paper |
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences
IEEE Transactions on Information Theory | 1998-02-23 | Paper |
Permutation polynomials, de Bruijn sequences, and linear complexity
Journal of Combinatorial Theory. Series A | 1997-10-01 | Paper |
A note on sequences with the shift and add property
Designs, Codes and Cryptography | 1997-08-17 | Paper |
scientific article; zbMATH DE number 1047548 (Why is no real title available?)
| 1997-08-17 | Paper |
Node bisectors of Cayley graphs
Mathematical Systems Theory | 1996-12-01 | Paper |
Some remarks on an algorithm of Fitzpatrick
IEEE Transactions on Information Theory | 1996-07-28 | Paper |
The cryptanalysis of a public-key implementation of finite group mappings
Journal of Cryptology | 1995-09-26 | Paper |
A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
Enumeration within Isoclinism Classes of Groups of Prime Power Order
Journal of the London Mathematical Society | 1994-12-18 | Paper |
Increasing the rate of output of \(m\)-sequences
Information Processing Letters | 1994-10-19 | Paper |
Exponent-Critical Groups
| N/A | Paper |
