| Publication | Date of Publication | Type |
|---|
| Efficient search for symmetric Boolean functions under constraints on Walsh spectra values | 2024-09-18 | Paper |
| Results on rotation symmetric bent functions | 2024-09-18 | Paper |
| On dihedral group invariant Boolean functions (extended abstract) | 2024-09-18 | Paper |
DEFAULT: cipher level resistance against differential fault attack
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| A coding theoretic approach towards symmetrization in reversible circuit synthesis | 2022-05-23 | Paper |
| On the design of bit permutation based ciphers. The interplay among S-box, bit permutation and key-addition | 2021-02-23 | Paper |
| On the relationship between resilient Boolean functions and linear branch number of S-boxes | 2020-05-12 | Paper |
| Bounds on differential and linear branch number of permutations | 2018-09-26 | Paper |
| Lightweight design choices for LED-like block ciphers | 2018-04-26 | Paper |
| Analysis of Toeplitz MDS matrices | 2017-08-25 | Paper |
Polynomials With Linear Structure and Maiorana–McFarland Construction
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Involutions Over the Galois Field
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Redefining the transparency order
Designs, Codes and Cryptography | 2017-02-10 | Paper |
On some permutation binomials and trinomials over \(\mathbb{F}_{2^n}\)
Designs, Codes and Cryptography | 2017-02-10 | Paper |
Dickson polynomials that are involutions
Contemporary Developments in Finite Fields and Applications | 2016-11-08 | Paper |
A deeper understanding of the XOR count distribution in the context of lightweight cryptography
Progress in Cryptology – AFRICACRYPT 2016 | 2016-06-22 | Paper |
Differential power analysis in Hamming weight model: how to choose among (extended) affine equivalent S-boxes
Progress in Cryptology -- INDOCRYPT 2014 | 2015-09-10 | Paper |
Proofs of retrievability via fountain code
Foundations and Practice of Security | 2013-08-07 | Paper |
On some permutation binomials of the form \(x^{\frac{2^n-1}{k}+1}+ax\) over \(\mathbb{F}_{2^n}\): existence and count
Arithmetic of Finite Fields | 2012-11-01 | Paper |
Characterizing Negabent Boolean Functions over Finite Fields
Lecture Notes in Computer Science | 2012-09-07 | Paper |
On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
Cryptography and Coding | 2011-12-16 | Paper |
On the lower bounds of the second order nonlinearities of some Boolean functions
Information Sciences | 2010-01-28 | Paper |
On the symmetric negabent Boolean functions
Progress in Cryptology - INDOCRYPT 2009 | 2009-12-17 | Paper |
On affine (non)equivalence of Boolean functions
Computing | 2009-08-10 | Paper |
| Efficient search for symmetric Boolean functions under constraints on Walsh spectrum values | 2009-07-06 | Paper |
Results on rotation symmetric bent functions
Discrete Mathematics | 2009-06-19 | Paper |
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
Designs, Codes and Cryptography | 2009-03-31 | Paper |
Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 2008-04-17 | Paper |
Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240
Progress in Cryptology - INDOCRYPT 2006 | 2008-04-11 | Paper |
Basic theory in construction of Boolean functions with maximum possible annihilator immunity
Designs, Codes and Cryptography | 2006-11-22 | Paper |
