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 2021-11-01 to 2025-11-01.)
ArticleCitations
Efficient computation of $$(2^n,2^n)$$-isogenies27
Editorial Note: Coding and Cryptography 202227
Minimal abundant packings and choosability with separation23
Post-quantum security on the Lai–Massey scheme23
On the security of functional encryption in the generic group model21
On vectorial functions with maximal number of bent components21
Ternary isodual codes and 3-designs19
Uniqueness of the inversive plane of order sixty-four17
On the cycle structure of a class of Galois NFSRs: component sequences possessing identical periods17
Introducing locality in some generalized AG codes16
Additive complementary dual codes over $$\mathbb {F}_4$$16
New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials16
Rational transformations over finite fields that are never irreducible15
Moments of autocorrelation demerit factors of binary sequences15
Quantum security of Trojan message attacks on Merkle–Damgård hash construction15
On two non-existence results for Cameron–Liebler k-sets in $${{\,\mathrm{\textrm{PG}}\,}}(n,q)$$15
Generalized impossible differential attacks on block ciphers: application to SKINNY and ForkSKINNY15
Approximate unitary 3-designs from transvection Markov chains15
Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing14
External codes for multiple unicast networks via interference alignment13
Cryptanalysis of a key exchange protocol based on a modified tropical structure13
On arithmetic progressions in finite fields12
Fully selective opening secure IBE from LWE12
The geometry of $$(t\mod q)$$-arcs12
The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function12
Individual discrete logarithm with sublattice reduction11
Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes11
Association schemes and orthogonality graphs on anisotropic points of polar spaces11
Extremely primitive groups and linear spaces11
Reduction for block-transitive t-$$(k^2,k,\lambda )$$ designs11
The cycle structure of a class of permutation polynomials11
New results on non-disjoint and classical strong external difference families11
An improved method for constructing formally self-dual codes with small hulls11
The differential spectrum and boomerang spectrum of a class of locally-APN functions10
External points to a conic from a Baer subplane9
Correction: On flag-transitive symmetric (v, k, 4) designs9
On subfield subcodes obtained from restricted evaluation codes9
Derivative descendants of cyclic codes and constacyclic codes9
On inverses of permutation polynomials of the form $$x\left( x^{s} -a\right) ^{(q^m-1)/s}$$ over $$\mathbb {F}_{q^n}$$9
Decoding algorithms of monotone codes and azinv codes and their unified view9
Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher9
Characterizing subgroup perfect codes by 2-subgroups9
MDS codes with l-Galois hulls of arbitrary dimensions9
Asymptotically optimal aperiodic quasi-complementary sequence sets based on extended Boolean functions9
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing9
Some constacyclic BCH codes with good parameters9
On the nonexistence of ternary linear codes attaining the Griesmer bound8
Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication8
Characterization of weakly regular p-ary bent functions of $$\ell $$-form8
Bounds on data limits for all-to-all comparison from combinatorial designs8
On subset-resilient hash function families8
Reversible $$G^k$$-codes with applications to DNA codes8
Optimal Ferrers diagram rank-metric codes from MRD codes8
Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice7
A generic method for investigating nonsingular Galois NFSRs7
Practical algorithm substitution attack on extractable signatures7
Moderate-density parity-check codes from projective bundles7
A novel algorithm for the k-XOR problem7
From primary to dual affine variety codes over the Klein quartic7
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security7
Practical dynamic group signatures without knowledge extractors7
Unconditionally secure non-malleable secret sharing and circular external difference families7
Families of quadratic sets on the Klein quadric7
Storage codes and recoverable systems on lines and grids6
An STP-based model toward designing S-boxes with good cryptographic properties6
Universal partial tori6
Sharper bounds on four lattice constants6
The weight hierarchy of decreasing norm-trace codes6
Correction: Linearity of $$\mathbb {Z}_{2^L}$$-linear codes via Schur product6
Block-transitive 3-(v, k, 1) designs associated with alternating groups6
Further results on covering codes with radius R and codimension $$tR+1$$6
Multivariate correlation attacks and the cryptanalysis of LFSR-based stream ciphers6
A quantum-secure partial parallel MAC QPCBC6
Permutations minimizing the number of collinear triples6
RETRACTED ARTICLE: Constructions for t-designs and s-resolvable t-designs6
Generalizing the Bierbrauer–Friedman bound for orthogonal arrays6
Binary cyclic-gap constant weight codes with low-complexity encoding and decoding6
Subgroup total perfect codes in Cayley sum graphs6
New MDS and self-dual generalized Roth-Lample codes as well as their deep holes6
Optimal $$(r,\delta )$$-LRCs from monomial-Cartesian codes and their subfield-subcodes6
(k, n)-Consecutive access structures5
The geometry of covering codes in the sum–rank metric5
On the 430-cap of $$\textrm{PG}(6,4)$$ having two intersection sizes with respect to hyperplanes5
The proportion of non-degenerate complementary subspaces in classical spaces5
New models for the cryptanalysis of ASCON5
Lattices in real quadratic fields and associated theta series arising from codes over $${\textbf{F}}_4$$ and $${\textbf{F}}_2 \times {\textbf{F}}_2$$5
Optimal two-dimensional multilength optical orthogonal codes via compatible mixed difference packing set systems5
New distance bounds for quasi-cyclic codes5
Construction of quantum codes from multivariate polynomial rings5
On automorphism groups of binary cyclic codes5
Guest editorial: On coding theory and combinatorics—in memory of Vera Pless5
Mutually disjoint Steiner systems from BCH codes5
Improved attacks against reduced-round Whirlwind5
Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique5
Secret sharing on regular bipartite access structures5
A construction of optimal quasi-cyclic locally recoverable codes using constituent codes5
Constructing k-ary orientable sequences with asymptotically optimal length4
A note on the Assmus–Mattson theorem for some binary codes II4
Gold functions and switched cube functions are not 0-extendable in dimension n > 54
Codes on weighted projective planes4
Primitive rank 3 groups, binary codes, and 3-designs4
Correction: The classifications of o-monomials and of 2-to-1 binomials are equivalent4
Quantum impossible differential attacks: applications to AES and SKINNY4
Differential uniformity and constacyclic code from some power mapping4
Optimal binary signed-digit representations of integers and the Stern polynomial4
Short attribute-based signatures for arbitrary Turing machines from standard assumptions4
Decreasing norm-trace codes4
Non-existence of quasi-symmetric designs with restricted block graphs4
Block-transitive 3-$$(v,4,\lambda )$$ designs with sporadic or alternating socle4
A framework for constructing impossible differential distinguishers and its applications4
Cameron–Liebler k-sets in subspaces and non-existence conditions4
Difference-based structural properties of costas arrays4
On the treewidth of generalized q-Kneser graphs4
Submodule codes as spherical codes in buildings4
The b-symbol weight distributions of all semiprimitive irreducible cyclic codes4
The stability of the algebraic degree of Boolean functions when restricted to affine spaces4
Hulls of cyclic codes with respect to the regular permutation inner product4
Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature4
Constructing linked systems of relative difference sets via Schur rings4
Several new classes of MDS symbol-pair codes4
Retraction Note: Constructions for t-designs and s-resolvable t-designs4
$$\textsf {TOPAS}$$2-pass key exchange with full perfect forward secrecy and optimal communication complexity4
SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations4
New quantum codes from self-dual codes over $$\mathbb {F}_4$$4
Security of fixed-weight repetitions of special-sound multi-round interactive proofs4
Johnson graph codes4
Image sets of perfectly nonlinear maps4
Constructing irreducible polynomials recursively with a reverse composition method4
Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD Codes4
Fast subgroup membership testings for $$\mathbb {G}_1$$, $$\mathbb {G}_2$$ and $$\mathbb {G}_T$$ on pairing-friendly curves4
Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes4
On linear equivalence, canonical forms, and digital signatures4
Covering polynomials and projections of self-dual codes4
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions4
Perfect LRCs and k-optimal LRCs3
On strongly walk regular graphs, triple sum sets and their codes3
Constructions of large cyclic constant dimension codes via Sidon spaces3
Projective tilings and full-rank perfect codes3
Exploiting output bits and the $$\chi $$ operation in MitM preimage attacks on Keccak3
The complete weight enumerator of the square of one-weight irreducible cyclic codes3
Codes from $$A_m$$-invariant polynomials3
Integral characteristics by keyspace partitioning3
New constructions of signed difference sets3
Linear codes from support designs of ternary cyclic codes3
On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity3
Flag-transitive 2-$$(v,k,\lambda )$$ designs with $$r>\lambda (k-3)$$3
Ovoids of Q(6, q) of low degree3
Generic transformation from broadcast encryption to round-optimal deniable ring authentication3
About r-primitive and k-normal elements in finite fields3
Correction to: Cameron–Liebler sets of k-spaces in $${{\,\mathrm{PG}\,}}(n,q)$$3
The classifications of o-monomials and of 2-to-1 binomials are equivalent3
Towards computing canonical lifts of ordinary elliptic curves in medium characteristic3
A generalized construction of variable-length non-overlapping codes3
Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences3
Mutual position of two smooth quadrics over finite fields3
Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes3
New families of quaternionic Hadamard matrices3
Parallel sub-code construction for constant-dimension codes3
Skew differential Goppa codes and their application to Mceliece cryptosystem3
Additive combinatorial designs3
On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs3
Relating code equivalence to other isomorphism problems3
Transitive path decompositions of Cartesian products of complete graphs3
Signed difference sets3
Around LCD group codes3
Galois LCD subspace codes3
An optimal binary linear functional-repair storage code with efficient repair related to $$\textrm{PG}(2,8)$$3
A conceptually simple and generic construction of plaintext checkable encryption in the standard model3
Decomposing self-dual bent functions3
Quasi optimal anticodes: structure and invariants3
Ryser’s theorem for simple multi-Latin rectangles3
LCD codes and almost optimally extendable codes from self-orthogonal codes3
Further investigation on differential properties of the generalized Ness–Helleseth function3
Galois subcovers of the Hermitian curve in characteristic p with respect to subgroups of order dp with $$d\not =p$$ prime3
The regular multivariate quadratic problem3
The sequence reconstruction of permutations with Hamming metric3
Semiregular relative difference sets related to Gauss sums and projective planes3
Using alternating de Bruijn sequences to construct de Bruijn tori3
On flag-transitive symmetric (v, k, 4) designs3
Complete b-symbol weight distribution of some irreducible cyclic codes3
On the boomerang properties of $$x^{q+2}$$ over $$\mathbb {F}_{q^2}$$3
Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves3
On the lifting degree of girth-8 QC-LDPC codes3
Optimal and extremal graphical designs on regular graphs associated with classical parameters3
Pairs of MOLS of order ten satisfying non-trivial relations3
Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics3
Cryptanalysis of Boyen’s attribute-based encryption scheme in TCC 20133
Full threshold change range of threshold changeable secret sharing3
Classifying generalized Howell designs3
Block codes in pomset metric over $${\mathbb {Z}}_m$$3
On the image of an affine subspace under the inverse function within a finite field3
Zero-knowledge proofs for set membership: efficient, succinct, modular3
Explicit infinite families of bent functions outside the completed Maiorana–McFarland class3
Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits3
More on codes for combinatorial composite DNA3
0.24120616912842