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-04-01 to 2025-04-01.)
ArticleCitations
Polynomial reduction from syndrome decoding problem to regular decoding problem30
Constructing k-ary orientable sequences with asymptotically optimal length25
Introducing locality in some generalized AG codes23
Non-canonical maximum cliques without a design structure in the block graphs of 2-designs23
Admissible parameters for the Crossbred algorithm and semi-regular sequences over finite fields22
Nonexistence of generalized bent functions and the quadratic norm form equations21
A framework for constructing impossible differential distinguishers and its applications20
Automorphism subgroups for designs with $$\lambda =1$$18
Generalized attack on ECDSA: known bits in arbitrary positions17
Hardness estimates of the code equivalence problem in the rank metric17
A new automatic framework for searching rotational-XOR differential characteristics in ARX ciphers16
On vectorial functions with maximal number of bent components16
Blocking sets of secant and tangent lines with respect to a quadric of $$\text{ PG }(n,q)$$16
The revised boomerang connectivity tables and their connection to the difference distribution table16
Introducing nega-Forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra15
Efficient information-theoretic distributed point functions with general output groups15
Book Review: “Designs from Linear Codes”, second edition, by Cunsheng Ding and Chunming Tang, World Scientific, 202215
Additive twisted codes: new distance bounds and infinite families of quantum codes15
Incremental symmetric puncturable encryption with support for unbounded number of punctures14
Vectorial bent functions and partial difference sets14
Editorial Note: Coding and Cryptography 202214
A note on the Walsh spectrum of the Flystel13
On two non-existence results for Cameron–Liebler k-sets in $${{\,\mathrm{\textrm{PG}}\,}}(n,q)$$13
Ternary isodual codes and 3-designs13
A complete characterization of $${\mathcal {D}}_0 \cap {\mathcal {M}}^\#$$ and a general framework for specifying bent functions in $${\mathcal {C}}$$ outside $${\mathcal {M}}^\#$$12
Difference matrices with five rows over finite abelian groups12
Improving the minimum distance bound of Trace Goppa codes11
RETRACTED ARTICLE: $$\mathbb {Z}_p\mathbb {Z}_{p^2}$$-linear codes: rank and kernel11
Submodule codes as spherical codes in buildings11
An improved upper bound on self-dual codes over finite fields GF(11), GF(19), and GF(23)11
A method for constructing quaternary Hermitian self-dual codes and an application to quantum codes10
On prefer-one sequences10
A class of constacyclic codes are generalized Reed–Solomon codes10
Flag-transitive 2-designs with prime square replication number and alternating groups10
Codes with respect to weighted poset block metric10
Sok: vector OLE-based zero-knowledge protocols10
Efficient computation of $$(2^n,2^n)$$-isogenies10
Observations on the branch number and differential analysis of SPEEDY10
A class of twisted generalized Reed–Solomon codes9
Perfect mixed codes from generalized Reed–Muller codes9
Eggs in finite projective spaces and unitals in translation planes9
Generalized semifield spreads9
Ligero: lightweight sublinear arguments without a trusted setup9
Self-dual bent sequences for complex Hadamard matrices9
Improved bounds for codes correcting insertions and deletions9
Optimal quaternary Hermitian LCD codes and their related codes9
Polar sampler: A novel Bernoulli sampler using polar codes with application to integer Gaussian sampling9
Some restrictions on the weight enumerators of near-extremal ternary self-dual codes and quaternary Hermitian self-dual codes9
Fast subgroup membership testings for $$\mathbb {G}_1$$, $$\mathbb {G}_2$$ and $$\mathbb {G}_T$$ on pairing-friendly curves8
$$\textsf {TOPAS}$$2-pass key exchange with full perfect forward secrecy and optimal communication complexity8
Simple vs. vectorial: exploiting structural symmetry to beat the ZeroSum distinguisher8
Infinite families of 3-designs from special symmetric polynomials8
Post-quantum security on the Lai–Massey scheme8
Two classes of exceptional m-to-1 rational functions8
On translation hyperovals in semifield planes8
Construction-D lattice from Garcia–Stichtenoth tower code8
Parameters of several families of binary duadic codes and their related codes8
On the security of functional encryption in the generic group model8
Small weight codewords of projective geometric codes II8
Balancedly splittable orthogonal designs and equiangular tight frames7
Generalized bilateral multilevel construction for constant dimension codes7
Diagonal groups and arcs over groups7
Improving the Gaudry–Schost algorithm for multidimensional discrete logarithms7
Properties of the cycles that contain all vectors of weight $$\le k$$7
Explicit constructions of NMDS self-dual codes7
Some classes of power functions with low c-differential uniformity over finite fields7
Cameron–Liebler sets in bilinear forms graphs7
Difference-based structural properties of costas arrays7
Variants of Jacobi polynomials in coding theory7
Uniqueness of the inversive plane of order sixty-four7
On certain self-orthogonal AG codes with applications to Quantum error-correcting codes7
Mosaics of combinatorial designs for information-theoretic security7
MDS array codes with efficient repair and small sub-packetization level6
A note on the Assmus–Mattson theorem for some binary codes II6
Exploiting ROLLO’s constant-time implementations with a single-trace analysis6
Densities of codes of various linearity degrees in translation-invariant metric spaces6
Counting the number of non-isotopic Taniguchi semifields6
Binomial permutations over finite fields with even characteristic6
Combinatorial constructions of optimal low-power error-correcting cooling codes6
Cayley sum graphs and their applications to codebooks6
Several families of irreducible constacyclic and cyclic codes6
Partition and mix: generalizing the swap-or-not shuffle6
Flag-transitive symmetric 2-designs of prime order6
A further study on bridge structures and constructing bijective S-boxes for low-latency masking6
Symplectic 4-dimensional semifields of order $$8^4$$ and $$9^4$$6
Minimal abundant packings and choosability with separation6
Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature6
Constructions of t-strongly multimedia IPP codes with length $$t+1$$6
Bounding the length of impossible differentials for SPN block ciphers6
A general family of Plotkin-optimal two-weight codes over $$\mathbb {Z}_4$$6
Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures5
Association schemes arising from non-weakly regular bent functions5
Construction of storage codes of rate approaching one on triangle-free graphs5
Another look at key randomisation hypotheses5
On the design and security of Lee metric McEliece cryptosystems5
New quantum codes from self-dual codes over $$\mathbb {F}_4$$5
Classification of semiregular relative difference sets with $$\gcd (\lambda ,n)=1$$ attaining Turyn’s bound5
Quantum time/memory/data tradeoff attacks5
LCD subspace codes5
On the number of rational points of Artin–Schreier’s curves and hypersurfaces5
On Pappus configurations in Hall planes5
The projective general linear group $${\mathrm {PGL}}(2,2^m)$$ and linear codes of length $$2^m+1$$5
Privacy-preserving data splitting: a combinatorial approach5
On Boolean functions derived from linear maps over $$\mathbb {Z}_4$$ and their application to secret sharing5
A new family of EAQMDS codes constructed from constacyclic codes5
On the algebraic immunity—resiliency trade-off, implications for Goldreich’s pseudorandom generator5
Circular external difference families: construction and non-existence5
The b-symbol weight distributions of all semiprimitive irreducible cyclic codes5
Improved meet-in-the-middle attack on 10 rounds of the AES-256 block cipher5
Gold functions and switched cube functions are not 0-extendable in dimension n > 54
Cameron–Liebler k-sets in subspaces and non-existence conditions4
Practical key recovery attacks on FlexAEAD4
Isomorphism of maximum length circuit codes4
Correction: Self-orthogonal codes over a non-unital ring and combinatorial matrices4
Moments of autocorrelation demerit factors of binary sequences4
SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations4
Cryptanalysis of a code-based full-time signature4
Quantum rectangle attack and its application on Deoxys-BC4
On the subgroup perfect codes in Cayley graphs4
Leakage-resilient $$\textsf {IBE} $$/$$\textsf {ABE} $$  with optimal leakage rates from lattices4
Novel generic construction of leakage-resilient PKE scheme with CCA security4
Locally maximal recoverable codes and LMR-LCD codes4
Algebraic hierarchical locally recoverable codes with nested affine subspace recovery4
Hulls of cyclic codes with respect to the regular permutation inner product4
Johnson graph codes4
Generalized impossible differential attacks on block ciphers: application to SKINNY and ForkSKINNY4
Weak rotational property and its application4
The first families of highly symmetric Kirkman Triple Systems whose orders fill a congruence class4
Neumaier graphs with few eigenvalues4
Hulls of projective Reed–Muller codes4
Switching for 2-designs4
Equivalence classes of Niho bent functions4
Functional commitments for arbitrary circuits of bounded sizes4
Construction of lightweight involutory MDS matrices4
Constructing saturating sets in projective spaces using subgeometries4
A construction of maximally recoverable codes4
Studying the isomorphism of NFSRs via a general framework of bijections4
Optimal quaternary $$(r,\delta )$$-locally recoverable codes: their structures and complete classification4
On the algebraic degree of iterated power functions4
Additive complementary dual codes over $$\mathbb {F}_4$$4
Improved generalized block inserting construction of constant dimension codes4
Resolution of the exceptional APN conjecture in the Gold degree case4
On the number of q-ary quasi-perfect codes with covering radius 24
Quantum security of Trojan message attacks on Merkle–Damgård hash construction3
Jacobi polynomials for the first-order generalized Reed–Muller codes3
An attack on p-adic lattice public-key encryption cryptosystems and signature schemes3
Reduction for block-transitive t-$$(k^2,k,\lambda )$$ designs3
Hadamard matrices related to a certain series of ternary self-dual codes3
Individual discrete logarithm with sublattice reduction3
A survey of compositional inverses of permutation polynomials over finite fields3
Some self-dual codes and isodual codes constructed by matrix product codes3
On the (in)security of optimized Stern-like signature schemes3
New method for combining Matsui’s bounding conditions with sequential encoding method3
Block-transitive 3-$$(v,4,\lambda )$$ designs with sporadic or alternating socle3
Determination of the sizes of optimal geometric orthogonal codes with parameters $$(n\times m,k,\lambda ,k-1)$$3
New spence difference sets3
Classification of extremal type II $$\mathbb {Z}_4$$-codes of length 243
Fully selective opening secure IBE from LWE3
On linear equivalence, canonical forms, and digital signatures3
New results on non-disjoint and classical strong external difference families3
Constructions of MDS symbol-pair codes with minimum distance seven or eight3
Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees3
Rate-improved multi-permutation codes for correcting a single burst of stable deletions3
Optimal binary signed-digit representations of integers and the Stern polynomial3
Truncated differential cryptanalysis: new insights and application to QARMAv1-n and QARMAv2-643
Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity3
Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields3
Flag-transitive, point-imprimitive 2-$$(v,k,\lambda )$$ symmetric designs with k and $$\lambda $$ prime powers3
$$(d,\varvec{\sigma })$$-Veronese variety and some applications3
Monomial isomorphism for tensors and applications to code equivalence problems3
Vectorial negabent concepts: similarities, differences, and generalizations3
On arithmetic progressions in finite fields3
Plane curves giving rise to blocking sets over finite fields3
Fast Kötter–Nielsen–Høholdt interpolation over skew polynomial rings and its application in coding theory3
DNA codes over groups3
Covering polynomials and projections of self-dual codes3
Constructions for new orthogonal arrays based on large sets of orthogonal arrays3
MDS symbol-pair codes from repeated-root cyclic codes3
Short attribute-based signatures for arbitrary Turing machines from standard assumptions3
The minimum locality of linear codes3
The existence of $$(\mathbb {Z}_v,4,1)$$-disjoint difference families3
Symmetric (15, 8, 4)-designs in terms of the geometry of binary simplex codes of dimension 43
Direct computation of branching programs and its applications to more efficient lattice-based cryptography3
Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing3
On the construction of certain odd degree irreducible polynomials over finite fields3
Optimal ternary locally repairable codes3
A class of functions and their application in constructing semisymmetric designs3
On the maximum size of variable-length non-overlapping codes3
Extremely primitive groups and linear spaces3
A polynomial time algorithm for breaking NTRU encryption with multiple keys3
Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes3
The geometry of $$(t\mod q)$$-arcs3
Revisiting products of the form X times a linearized polynomial L(X)3
Decoding error probability of random parity-check matrix ensemble over the erasure channel3
Galois subcovers of the Hermitian curve in characteristic p with respect to subgroups of order dp with $$d\not =p$$ prime3
Computing gluing and splitting $$(\ell ,\ell )$$-isogenies3
Retraction Note: Constructions for t-designs and s-resolvable t-designs3
The existence of cyclic (v, 4, 1)-designs3
0.039276838302612