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-06-01 to 2025-06-01.)
ArticleCitations
Editorial Note: Coding and Cryptography 202233
RETRACTED ARTICLE: $$\mathbb {Z}_p\mathbb {Z}_{p^2}$$-linear codes: rank and kernel31
Introducing locality in some generalized AG codes29
Post-quantum security on the Lai–Massey scheme25
Improving the Gaudry–Schost algorithm for multidimensional discrete logarithms24
Efficient computation of $$(2^n,2^n)$$-isogenies21
Minimal abundant packings and choosability with separation21
On the security of functional encryption in the generic group model20
Bounding the length of impossible differentials for SPN block ciphers18
Ternary isodual codes and 3-designs18
Constructing saturating sets in projective spaces using subgeometries18
On vectorial functions with maximal number of bent components17
On the cycle structure of a class of Galois NFSRs: component sequences possessing identical periods17
On two non-existence results for Cameron–Liebler k-sets in $${{\,\mathrm{\textrm{PG}}\,}}(n,q)$$16
Uniqueness of the inversive plane of order sixty-four15
Moments of autocorrelation demerit factors of binary sequences15
Additive complementary dual codes over $$\mathbb {F}_4$$15
Quantum security of Trojan message attacks on Merkle–Damgård hash construction15
An improved method for constructing formally self-dual codes with small hulls14
Individual discrete logarithm with sublattice reduction14
Association schemes and orthogonality graphs on anisotropic points of polar spaces14
Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes14
Rational transformations over finite fields that are never irreducible13
Fully selective opening secure IBE from LWE13
Extended cyclic codes, maximal arcs and ovoids12
Approximate unitary 3-designs from transvection Markov chains12
The geometry of $$(t\mod q)$$-arcs12
On arithmetic progressions in finite fields11
Cryptanalysis of a key exchange protocol based on a modified tropical structure11
Construction of LDPC convolutional codes via difference triangle sets11
External codes for multiple unicast networks via interference alignment11
Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing11
Reduction for block-transitive t-$$(k^2,k,\lambda )$$ designs10
The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function10
The cycle structure of a class of permutation polynomials10
New results on non-disjoint and classical strong external difference families10
Extremely primitive groups and linear spaces10
Bounds for flag codes10
The differential spectrum and boomerang spectrum of a class of locally-APN functions9
Some constacyclic BCH codes with good parameters9
Reversible $$G^k$$-codes with applications to DNA 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
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing9
Asymptotically optimal aperiodic quasi-complementary sequence sets based on extended Boolean functions9
On subfield subcodes obtained from restricted evaluation codes9
Generalized impossible differential attacks on block ciphers: application to SKINNY and ForkSKINNY9
Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher9
External points to a conic from a Baer subplane9
On the nonexistence of ternary linear codes attaining the Griesmer bound8
Quadratic residue codes, rank three groups and PBIBDs8
Boomerang uniformity of a class of power maps8
Unconditionally secure non-malleable secret sharing and circular external difference families8
Characterization of weakly regular p-ary bent functions of $$\ell $$-form8
Derivative descendants of cyclic codes and constacyclic codes8
Decoding algorithms of monotone codes and azinv codes and their unified view8
Characterizing subgroup perfect codes by 2-subgroups8
Moderate-density parity-check codes from projective bundles8
Bounds on data limits for all-to-all comparison from combinatorial designs8
On subset-resilient hash function families8
Weight distribution of double cyclic codes over Galois rings8
MDS codes with l-Galois hulls of arbitrary dimensions8
Optimal Ferrers diagram rank-metric codes from MRD codes8
A generic method for investigating nonsingular Galois NFSRs8
Storage codes and recoverable systems on lines and grids7
Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication7
RETRACTED ARTICLE: Constructions for t-designs and s-resolvable t-designs7
An STP-based model toward designing S-boxes with good cryptographic properties7
Practical dynamic group signatures without knowledge extractors7
Security analysis of Subterranean 2.07
Families of quadratic sets on the Klein quadric7
Practical algorithm substitution attack on extractable signatures7
Block-transitive 3-(v, k, 1) designs associated with alternating groups7
From primary to dual affine variety codes over the Klein quartic7
Universal partial tori7
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security7
Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice7
Sharper bounds on four lattice constants6
Optimal two-dimensional multilength optical orthogonal codes via compatible mixed difference packing set systems6
Multivariate correlation attacks and the cryptanalysis of LFSR-based stream ciphers6
Permutations minimizing the number of collinear triples6
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
Further results on covering codes with radius R and codimension $$tR+1$$6
On the 430-cap of $$\textrm{PG}(6,4)$$ having two intersection sizes with respect to hyperplanes6
Subgroup total perfect codes in Cayley sum graphs6
Optimal binary LCD codes6
Walsh spectrum and nega spectrum of complementary arrays6
Guest editorial: On coding theory and combinatorics—in memory of Vera Pless6
Binary cyclic-gap constant weight codes with low-complexity encoding and decoding6
Improved attacks against reduced-round Whirlwind6
Optimal $$(r,\delta )$$-LRCs from monomial-Cartesian codes and their subfield-subcodes6
The weight hierarchy of decreasing norm-trace codes6
A quantum-secure partial parallel MAC QPCBC6
On automorphism groups of binary cyclic codes5
Improved indifferentiability security proof for 3-round tweakable Luby–Rackoff5
Grassmannian codes from paired difference sets5
New models for the cryptanalysis of ASCON5
A note on the Assmus–Mattson theorem for some binary codes II5
(k, n)-Consecutive access structures5
Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD Codes5
A construction of optimal quasi-cyclic locally recoverable codes using constituent codes5
Secret sharing on regular bipartite access structures5
Image sets of perfectly nonlinear maps5
Mutually disjoint Steiner systems from BCH codes5
$$\textsf {TOPAS}$$2-pass key exchange with full perfect forward secrecy and optimal communication complexity5
The proportion of non-degenerate complementary subspaces in classical spaces5
Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique5
Quantum impossible differential attacks: applications to AES and SKINNY5
Construction of quantum codes from multivariate polynomial rings5
The geometry of covering codes in the sum–rank metric5
New distance bounds for quasi-cyclic codes5
A framework for constructing impossible differential distinguishers and its applications5
Constructing irreducible polynomials recursively with a reverse composition method5
More on codes for combinatorial composite DNA4
Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature4
Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity4
Cryptanalysis of a code-based full-time signature4
Galois subcovers of the Hermitian curve in characteristic p with respect to subgroups of order dp with $$d\not =p$$ prime4
Fast subgroup membership testings for $$\mathbb {G}_1$$, $$\mathbb {G}_2$$ and $$\mathbb {G}_T$$ on pairing-friendly curves4
Constructing k-ary orientable sequences with asymptotically optimal length4
Submodule codes as spherical codes in buildings4
New quantum codes from self-dual codes over $$\mathbb {F}_4$$4
Retraction Note: Constructions for t-designs and s-resolvable t-designs4
Covering polynomials and projections of self-dual codes4
On $$\mathbb {Z}_2\mathbb {Z}_4$$-additive polycyclic codes and their Gray images4
Non-existence of quasi-symmetric designs with restricted block graphs4
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions4
About r-primitive and k-normal elements in finite fields4
Primitive rank 3 groups, binary codes, and 3-designs4
Optimal binary signed-digit representations of integers and the Stern polynomial4
Correction: The classifications of o-monomials and of 2-to-1 binomials are equivalent4
Difference-based structural properties of costas arrays4
Short attribute-based signatures for arbitrary Turing machines from standard assumptions4
The b-symbol weight distributions of all semiprimitive irreducible cyclic codes4
Gold functions and switched cube functions are not 0-extendable in dimension n > 54
Perfect LRCs and k-optimal LRCs4
Decreasing norm-trace codes4
Constructing linked systems of relative difference sets via Schur rings4
Block-transitive 3-$$(v,4,\lambda )$$ designs with sporadic or alternating socle4
On the sunflower bound for k-spaces, pairwise intersecting in a point4
SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations4
Cameron–Liebler k-sets in subspaces and non-existence conditions4
Hulls of cyclic codes with respect to the regular permutation inner product4
Johnson graph codes4
Variants of Jacobi polynomials in coding theory4
On linear equivalence, canonical forms, and digital signatures4
Zero-knowledge proofs for set membership: efficient, succinct, modular4
New families of quaternionic Hadamard matrices3
The classifications of o-monomials and of 2-to-1 binomials are equivalent3
Parallel sub-code construction for constant-dimension codes3
Generic transformation from broadcast encryption to round-optimal deniable ring authentication3
Pairs of MOLS of order ten satisfying non-trivial relations3
Block codes in pomset metric over $${\mathbb {Z}}_m$$3
A conceptually simple and generic construction of plaintext checkable encryption in the standard model3
MacWilliams extension property for arbitrary weights on linear codes over module alphabets3
Projective tilings and full-rank perfect codes3
Skew differential Goppa codes and their application to Mceliece cryptosystem3
Binary linear codes with few weights from Boolean functions3
Some conditions for absence of affine functions in NFSR output stream3
Codes from $$A_m$$-invariant polynomials3
Five families of the narrow-sense primitive BCH codes over finite fields3
Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes3
A generalized construction of variable-length non-overlapping codes3
On flag-transitive symmetric (v, k, 4) designs3
Flag-transitive 2-$$(v,k,\lambda )$$ designs with $$r>\lambda (k-3)$$3
New constructions of signed difference sets3
Cyclic orbit flag codes3
Constructions of large cyclic constant dimension codes via Sidon spaces3
Using alternating de Bruijn sequences to construct de Bruijn tori3
Ovoids of Q(6, q) of low degree3
Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits3
Transitive path decompositions of Cartesian products of complete graphs3
Pseudo-embeddings and quadratic sets of quadrics3
Additive combinatorial designs3
Linear codes from support designs of ternary cyclic codes3
On strongly walk regular graphs, triple sum sets and their codes3
Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics3
On the image of an affine subspace under the inverse function within a finite field3
On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity3
Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences3
Full threshold change range of threshold changeable secret sharing3
Signed difference sets3
Decomposing self-dual bent functions3
Relating code equivalence to other isomorphism problems3
Quasi optimal anticodes: structure and invariants3
Correction to: Cameron–Liebler sets of k-spaces in $${{\,\mathrm{PG}\,}}(n,q)$$3
Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes3
Explicit infinite families of bent functions outside the completed Maiorana–McFarland class3
Optimal and extremal graphical designs on regular graphs associated with classical parameters3
Fast, compact, and expressive attribute-based encryption3
The sequence reconstruction of permutations with Hamming metric3
Diagonal cellular factor pair Latin squares3
Further investigation on differential properties of the generalized Ness–Helleseth function3
LCD codes and almost optimally extendable codes from self-orthogonal codes3
0.17082500457764