Designs Codes and Cryptography

Papers
(The TQCC of Designs Codes and Cryptography 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 2022-05-01 to 2026-05-01.)
ArticleCitations
Editorial Note: Coding and Cryptography 202231
Minimal abundant packings and choosability with separation26
On the security of functional encryption in the generic group model26
On vectorial functions with maximal number of bent components24
Ternary isodual codes and 3-designs23
Additive complementary dual codes over $$\mathbb {F}_4$$22
On the cycle structure of a class of Galois NFSRs: component sequences possessing identical periods21
Introducing locality in some generalized AG codes20
Moments of autocorrelation demerit factors of binary sequences19
A hybrid of lattice-reduction and Meet-LWE via near-collision on babai’s plane18
Characterization of some minihypers in $${{\,\textrm{PG}\,}}(r,3)$$ and the nonexistence of some ternary Griesmer codes17
Post-quantum security on the Lai–Massey scheme17
New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials17
Efficient computation of $$(2^n,2^n)$$-isogenies17
Quantum security of Trojan message attacks on Merkle–Damgård hash construction16
On two non-existence results for Cameron–Liebler k-sets in $${{\,\mathrm{\textrm{PG}}\,}}(n,q)$$16
Rational transformations over finite fields that are never irreducible16
The cycle structure of a class of permutation polynomials15
The differential spectrum and boomerang spectrum of a class of locally-APN functions15
Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing15
Generalized impossible differential attacks on block ciphers: application to SKINNY and ForkSKINNY15
External codes for multiple unicast networks via interference alignment14
The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function13
Cryptanalysis of a key exchange protocol based on a modified tropical structure13
On arithmetic progressions in finite fields13
Fully selective opening secure IBE from LWE13
The geometry of $$(t\mod q)$$-arcs13
Association schemes and orthogonality graphs on anisotropic points of polar spaces12
An improved method for constructing formally self-dual codes with small hulls12
A linearisation method for identifying dependencies in differential characteristics: examining the intersection of deterministic linear relations and nonlinear constraints12
New results on non-disjoint and classical strong external difference families12
A tight upper bound on the number of nonzero weights of a quasi-cyclic code12
Extremely primitive groups and linear spaces12
Individual discrete logarithm with sublattice reduction11
Reduction for block-transitive t-$$(k^2,k,\lambda )$$ designs10
Correction: On flag-transitive symmetric (v, k, 4) designs9
On inverses of permutation polynomials of the form $$x\left( x^{s} -a\right) ^{(q^m-1)/s}$$ over $$\mathbb {F}_{q^n}$$9
The second minimum size of a finite subspace partition9
Reversible $$G^k$$-codes with applications to DNA codes9
Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes9
MDS codes with l-Galois hulls of arbitrary dimensions9
Some constacyclic BCH codes with good parameters9
On subfield subcodes obtained from restricted evaluation codes9
Construction of correctors using resilient fragmentary Boolean functions9
External points to a conic from a Baer subplane9
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing9
New constructions of optimal symbol-pair constacyclic codes of length $$4p^s$$8
Group factorisation for smaller signatures from cryptographic group actions8
Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher8
Derivative descendants of cyclic codes and constacyclic codes8
Characterizing subgroup perfect codes by 2-subgroups8
Asymptotically optimal aperiodic quasi-complementary sequence sets based on extended Boolean functions8
Families of quadratic sets on the Klein quadric7
Storage codes and recoverable systems on lines and grids7
Optimal Ferrers diagram rank-metric codes from MRD codes7
Moderate-density parity-check codes from projective bundles7
Improved bounds for codes over trees7
Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication7
Unconditionally secure non-malleable secret sharing and circular external difference families7
Practical dynamic group signatures without knowledge extractors7
Block-transitive 3-(v, k, 1) designs associated with alternating groups7
Universal partial tori7
Characterization of weakly regular p-ary bent functions of $$\ell $$-form7
Bounds on data limits for all-to-all comparison from combinatorial designs7
A novel algorithm for the k-XOR problem7
Generalizing the Bierbrauer–Friedman bound for orthogonal arrays7
Further results on covering codes with radius R and codimension $$tR+1$$7
Correction: Linearity of $$\mathbb {Z}_{2^L}$$-linear codes via Schur product7
RETRACTED ARTICLE: Constructions for t-designs and s-resolvable t-designs7
Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice7
Permutations minimizing the number of collinear triples6
The weight hierarchy of decreasing norm-trace codes6
Optimal $$(r,\delta )$$-LRCs from monomial-Cartesian codes and their subfield-subcodes6
Sharper bounds on four lattice constants6
On automorphism groups of binary cyclic codes6
Guest editorial: On coding theory and combinatorics—in memory of Vera Pless6
Quasi-optimal cyclic orbit codes6
Improved attacks against reduced-round Whirlwind6
Multivariate correlation attacks and the cryptanalysis of LFSR-based stream ciphers6
Duals of multiplicity codes6
Lattices in real quadratic fields and associated theta series arising from codes over $${\textbf{F}}_4$$ and $${\textbf{F}}_2 \times {\textbf{F}}_2$$6
(k, n)-Consecutive access structures6
Secret sharing on regular bipartite access structures6
Binary cyclic-gap constant weight codes with low-complexity encoding and decoding6
A quantum-secure partial parallel MAC QPCBC6
New MDS and self-dual generalized Roth-Lempel codes as well as their deep holes6
Multi-orbit cyclic subspace codes via direct sum of Sidon spaces6
Subgroup total perfect codes in Cayley sum graphs6
A construction of optimal quasi-cyclic locally recoverable codes using constituent codes6
On the 430-cap of $$\textrm{PG}(6,4)$$ having two intersection sizes with respect to hyperplanes6
A note on the Assmus–Mattson theorem for some binary codes II5
New quantum codes from self-dual codes over $$\mathbb {F}_4$$5
Primitive rank 3 groups, binary codes, and 3-designs5
The weight distributions and weight hierarchies of two classes of few-weight linear codes5
Quantum impossible differential attacks: applications to AES and SKINNY5
Mutually disjoint Steiner systems from BCH codes5
Constructing irreducible polynomials recursively with a reverse composition method5
Image sets of perfectly nonlinear maps5
Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique5
Codes on weighted projective planes5
Fast subgroup membership testings for $$\mathbb {G}_1$$, $$\mathbb {G}_2$$ and $$\mathbb {G}_T$$ on pairing-friendly curves5
A framework for constructing impossible differential distinguishers and its applications5
Difference-based structural properties of costas arrays5
Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD Codes5
New distance bounds for quasi-cyclic codes5
The geometry of covering codes in the sum–rank metric5
Optimal two-dimensional multilength optical orthogonal codes via compatible mixed difference packing set systems5
Construction of quantum codes from multivariate polynomial rings5
Submodule codes as spherical codes in buildings5
Several new classes of MDS symbol-pair codes5
Differential uniformity and constacyclic code from some power mapping5
Correction: The classifications of o-monomials and of 2-to-1 binomials are equivalent5
$$\textsf {TOPAS}$$2-pass key exchange with full perfect forward secrecy and optimal communication complexity5
Improved preimage attacks on round-reduced Keccak-384/5125
New models for the cryptanalysis of ASCON5
The stability of the algebraic degree of Boolean functions when restricted to affine spaces5
The proportion of non-degenerate complementary subspaces in classical spaces5
The b-symbol weight distributions of all semiprimitive irreducible cyclic codes5
Hulls of cyclic codes with respect to the regular permutation inner product5
Gold functions and switched cube functions are not 0-extendable in dimension n > 55
About r-primitive and k-normal elements in finite fields4
Constructions of large cyclic constant dimension codes via Sidon spaces4
Lemmas on traceability codes and an upper bound for 4-traceability4
Alphabet-affine 2-neighbour-transitive codes4
Perfect LRCs and k-optimal LRCs4
Retraction Note: Constructions for t-designs and s-resolvable t-designs4
Towards computing canonical lifts of ordinary elliptic curves in medium characteristic4
Perfect codes in Cayley graphs of abelian groups4
Coxeter codes: extending the Reed–Muller family4
Linear complete symmetric rank-distance codes4
Possible values for the nonlinearity of de bruijn feedback functions4
Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes4
New constructions of signed difference sets4
Ovoids of Q(6, q) of low degree4
Ryser’s theorem for simple multi-Latin rectangles4
FE for inner products and its application to multi-authority ABE4
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions4
Zero-knowledge proofs for set membership: efficient, succinct, modular4
On linear equivalence, canonical forms, and digital signatures4
Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes4
Constructing k-ary orientable sequences with asymptotically optimal length4
On the hulls of group codes4
On the treewidth of generalized q-Kneser graphs4
Covering polynomials and projections of self-dual codes4
Decreasing norm-trace codes4
Short attribute-based signatures for arbitrary Turing machines from standard assumptions4
Signed difference sets4
A conceptually simple and generic construction of plaintext checkable encryption in the standard model4
On the lifting degree of girth-8 QC-LDPC codes4
Polygonal triples4
More on codes for combinatorial composite DNA4
Block-transitive 3-$$(v,4,\lambda )$$ designs with sporadic or alternating socle4
Constructing linked systems of relative difference sets via Schur rings4
Classifying generalized Howell designs4
Optimal binary signed-digit representations of integers and the Stern polynomial4
Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature4
Security of fixed-weight repetitions of special-sound multi-round interactive proofs4
Galois subcovers of the Hermitian curve in characteristic p with respect to subgroups of order dp with $$d\not =p$$ prime4
Additive combinatorial designs4
The sequence reconstruction of permutations with Hamming metric4
Pairs of MOLS of order ten satisfying non-trivial relations4
Semiregular relative difference sets related to Gauss sums and projective planes3
Binary stretch embedding of weighted graphs3
New families of quaternionic Hadamard matrices3
Quasi-cyclic binary extended and expurgated Goppa codes and their parameters3
Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences3
Exploiting output bits and the $$\chi $$ operation in MitM preimage attacks on Keccak3
Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits3
Several secondary methods for constructing bent–negabent functions3
Projective tilings and full-rank perfect codes3
Around LCD group codes3
Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics3
Block codes in pomset metric over $${\mathbb {Z}}_m$$3
Skew differential Goppa codes and their application to Mceliece cryptosystem3
Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique3
On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity3
The complete weight enumerator of the square of one-weight irreducible cyclic codes3
Sperner’s theorem for non-free modules over finite chain rings3
Packing designs with large block size3
On the equivalence of $$\mathbb {Z}_{p^s}$$-linear generalized Hadamard codes3
Improved key recovery attacks on reduced-round Salsa203
Explicit infinite families of bent functions outside the completed Maiorana–McFarland class3
Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves3
Full threshold change range of threshold changeable secret sharing3
Relating code equivalence to other isomorphism problems3
On flag-transitive symmetric (v, k, 4) designs3
Mutual position of two smooth quadrics over finite fields3
The regular multivariate quadratic problem3
Cryptanalysis of Boyen’s attribute-based encryption scheme in TCC 20133
On strongly walk regular graphs, triple sum sets and their codes3
Transitive path decompositions of Cartesian products of complete graphs3
On the number of minimal and next-to-minimal weight codewords of toric codes over hypersimplices3
LCD codes and almost optimally extendable codes from self-orthogonal codes3
Information set decoding for ring-linear codes3
Constructions of complete permutations in multiplication3
An optimal binary linear functional-repair storage code with efficient repair related to $$\textrm{PG}(2,8)$$3
Diagonal cellular factor pair Latin squares3
Classification of weighted posets and digraphs admitting the extended Hamming code to be a perfect code3
The classifications of o-monomials and of 2-to-1 binomials are equivalent3
MDS and near-MDS codes via twisted Reed–Solomon codes3
About the Rankin and Bergé-Martinet constants from a coding theory view point3
Quasi optimal anticodes: structure and invariants3
New results on vectorial dual-bent functions and partial difference sets3
Parallel sub-code construction for constant-dimension codes3
Further investigation on differential properties of the generalized Ness–Helleseth function3
On the boomerang properties of $$x^{q+2}$$ over $$\mathbb {F}_{q^2}$$3
Codes from $$A_m$$-invariant polynomials3
On Bose distance of a class of BCH codes with two types of designed distances3
Using alternating de Bruijn sequences to construct de Bruijn tori3
Large domain homomorphic evaluation for BFV-like schemes via ring repacking3
On the image of an affine subspace under the inverse function within a finite field3
Decomposing self-dual bent functions3
Guess-and-determine attacks on SNOW-Vi stream cipher3
Somewhat homomorphic encryption based on random codes3
A generalized construction of variable-length non-overlapping codes3
Optimal and extremal graphical designs on regular graphs associated with classical parameters3
Large sets of t-designs over finite fields exist for all t3
Galois LCD subspace codes3
$$\mathsf {CENCPP}^*$$: beyond-birthday-secure encryption from public permutations3
Simplicity conditions for binary orthogonal arrays3
0.062342166900635