| Publication | Date of Publication | Type |
|---|
Coset leaders of the first order Reed-Muller codes in the classes of Niho functions and threshold functions
| 2024-08-30 | Paper |
Probabilistic estimation of the algebraic degree of Boolean functions
Cryptography and Communications | 2023-12-14 | Paper |
Further constructions and characterizations of generalized almost perfect nonlinear functions
Cryptography and Communications | 2023-12-14 | Paper |
Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions
Cryptography and Communications | 2022-04-25 | Paper |
New generalized almost perfect nonlinear functions
Finite Fields and their Applications | 2021-02-19 | Paper |
Counting Boolean functions with faster points
Designs, Codes and Cryptography | 2020-09-22 | Paper |
Discrete antiderivatives for functions over \(\mathbb{F}_p^n\)
Designs, Codes and Cryptography | 2020-02-25 | Paper |
Higher order differentiation over finite fields with applications to generalising the cube attack
Designs, Codes and Cryptography | 2017-09-28 | Paper |
An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Apology for Citation Omission in “An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations” [Oct 09 4695-4700
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Counting and characterising functions with ``fast points for differential attacks
Cryptography and Communications | 2017-01-19 | Paper |
Comparison of Cube Attacks Over Different Vector Spaces
Cryptography and Coding | 2016-01-12 | Paper |
Efficient generation of elementary sequences
Cryptography and Coding | 2014-01-17 | Paper |
Computing the linear complexity for sequences with characteristic polynomial \(f^v\)
Cryptography and Communications | 2013-08-02 | Paper |
Index Tables of Finite Fields and Modular Golomb Rulers
Lecture Notes in Computer Science | 2012-09-07 | Paper |
On the stability of \(m\)-sequences
Cryptography and Coding | 2011-12-16 | Paper |
One- and two-page crossing numbers for some types of graphs
International Journal of Computer Mathematics | 2010-09-14 | Paper |
An improved approximation algorithm for computing the \(k\)-error linear complexity of sequences using the discrete Fourier transform
Sequences and Their Applications – SETA 2010 | 2010-09-08 | Paper |
On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two
Sequences and Their Applications - SETA 2004 | 2008-03-14 | Paper |
Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences
Cryptography and Coding | 2008-03-07 | Paper |
Parallelisation of genetic algorithms for the 2-page crossing number problem
Journal of Parallel and Distributed Computing | 2007-02-14 | Paper |
Repeated-root cyclic and negacyclic codes over a finite chain ring
Discrete Applied Mathematics | 2006-04-28 | Paper |
Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
Finite Fields and their Applications | 2005-09-29 | Paper |
scientific article; zbMATH DE number 2152532 (Why is no real title available?)
| 2005-04-05 | Paper |
Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
Finite Fields and their Applications | 2003-05-04 | Paper |
On the key equation over a commutative ring
Designs, Codes and Cryptography | 2003-01-25 | Paper |
scientific article; zbMATH DE number 1424168 (Why is no real title available?)
| 2002-03-18 | Paper |
Gröbner bases and products of coefficient rings
Bulletin of the Australian Mathematical Society | 2002-01-01 | Paper |
Strong Gröbner bases and cyclic codes over a finite-chain ring
| 2001-10-14 | Paper |
Strong Gröbner bases for polynomials over a principal ideal ring.
Bulletin of the Australian Mathematical Society | 2001-01-01 | Paper |
On the Hamming distance of linear codes over a finite chain ring
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
On the structure of linear and cyclic codes over a finite chain ring
Applicable Algebra in Engineering, Communication and Computing | 2000-08-08 | Paper |
