Cryptography and Communications-Discrete-Structures Boolean Functions

Papers
(The TQCC of Cryptography and Communications-Discrete-Structures Boolean Functions is 3. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-04-01 to 2025-04-01.)
ArticleCitations
On Dillon’s property of (n, m)-functions26
A construction of optimal Z-complementary code sets based on partially m-shift orthogonal complementary codes19
New constructions of self-dual codes via twisted generalized Reed-Solomon codes19
Three-phase Z-complementary triads and almost complementary triads17
The complete weight distribution of a subclass of optimal three-weight cyclic codes15
A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial14
The Homogeneous Gray image of linear codes over the Galois ring GR(4, m)13
MDS multi-twisted Reed-Solomon codes with small dimensional hull13
A study of quantum codes obtained from cyclic codes over a non-chain ring11
Boolean functions with six-valued Walsh spectra and their application11
Special Issue on Contemporary interactions between codes, cryptographic functions and/or sequences10
Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period p9
MDS constacyclic codes of length q + 1 over GF(q)9
Permutations without linear structures inducing bent functions outside the completed Maiorana-McFarland class8
On general self-orthogonal matrix-product codes associated with Toeplitz matrices8
D-property for APN functions from $\mathbb {F}_{2}^{n}$ to $\mathbb {F}_{2}^{n+1}$8
LCD and ACD codes over a noncommutative non-unital ring with four elements8
Constructions of non-binary Golay complementary pairs of new lengths8
The Griesmer codes of Belov type and optimal quaternary codes via multi-variable functions7
A note on QM equivalence of known permutation polynomials7
Three families of large cyclic subspace codes7
A class of balanced binary sequences with two-valued non-zero autocorrelation sum and good crosscorrelation sum7
Quantum codes from one-point codes on norm-trace curves7
A new construction of cyclic subspace codes7
Invariants for EA- and CCZ-equivalence of APN and AB functions7
Pseudorandom sequences derived from automatic sequences6
Results on the nonexistence of bent-negabent rotation symmetric Boolean functions6
Optimal Binary Linear Complementary Pairs of Codes6
On the classification of quaternary optimal Hermitian LCD codes6
Attacking the linear congruential generator on elliptic curves via lattice techniques6
Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes5
Trace dual of additive cyclic codes over finite fields5
Construction of binary self-orthogonal codes5
Editorial: Special issue on Boolean functions and their applications 20215
On decompositions of permutation polynomials into quadratic and cubic power permutations5
Asymptotic bounds on the numbers of certain bent functions5
The cross-correlation spectrum of ternary perfect sequences and their decimations5
Erratum5
New supersets of Zadoff-Chu sequences via the Weil bound5
Enumeration formulae for self-orthogonal, self-dual and complementary-dual additive cyclic codes over finite commutative chain rings5
Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums5
New constructions of mutually orthogonal complementary sets and Z-complementary code sets based on extended Boolean functions5
New frequency-hopping sequence sets with good parameters under aperiodic hamming correlation5
Distribution of the autocorrelation of random Boolean functions5
GL-S-NFSR: A new NFSR structure and its period properties4
Optimization of the scalar complexity of Chudnovsky2 multiplication algorithms in finite fields4
Determination of cryptographic tables and properties related to the revised boomerang and its application to a fundamental S-box4
Construction of DNA codes with multiple constrained properties4
A survey of metaheuristic algorithms for the design of cryptographic Boolean functions4
A direct construction of cross z-complementary sequence sets with large set size4
New linear approximation of modular addition and improved differential-linear cryptanalysis of SPARX-64/1284
On locality of binary distance-optimal codes4
Two classes of ternary LCD constacyclic BCH codes4
On the minimum weights of quaternary Hermitian LCD codes4
Additive codes with few weights4
On isometry and equivalence of constacyclic codes over finite chain rings3
Optimal few-weight codes from projective spaces3
Investigation for 8-bit SKINNY-like S-boxes, analysis and applications3
Differential and Linear properties of vectorial boolean functions based on chi3
$$\mathcal {S}_0$$-equivalence classes, a new direction to find better weightwise perfectly balanced functions, and more3
Polar coding for Ring-LWE-based public key encryption3
Equitable [[2, 10], [6, 6]]-partitions of the 12-cube3
Integer syndrome decoding in the presence of noise3
Two classes of q-ary constacyclic BCH codes3
Kim-type APN functions are affine equivalent to Gold functions3
Jump and hop randomness tests for binary sequences3
Lifted codes and lattices from codes over finite chain rings3
New construction of optimal ZCZ sequence sets with inter-set zero cross-correlation zone3
The sequence reconstruction problem for permutations with the Hamming distance3
Further results on a class of permutation trinomials3
A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields3
Further improvements of the estimation of key enumeration with applications to solving LWE3
Constructing more quadratic APN functions with the QAM method3
Some notes on the pseudorandomness of Legendre symbol and Liouville function3
A number theoretic view on binary shift registers3
Minimal linear codes constructed from partial spreads3
Frameproof codes, separable codes and $$B_2$$ codes: Bounds and constructions3
On the construction of near-MDS matrices3
Boolean functions of binary Type-II and Type-III/II complementary array pairs3
Provable randomness over lightweight permutations3
0.099292039871216