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 2020-11-01 to 2024-11-01.)
ArticleCitations
On the c-differential uniformity of certain maps over finite fields31
MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes26
Construction of MDS twisted Reed–Solomon codes and LCD MDS codes23
Optimal binary LCD codes22
Some classes of power functions with low c-differential uniformity over finite fields21
Some constructions of quantum MDS codes20
Construction of binary LCD codes, ternary LCD codes and quaternary Hermitian LCD codes18
Characterization and classification of optimal LCD codes18
SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations18
The minimum locality of linear codes17
A new family of EAQMDS codes constructed from constacyclic codes17
Cryptographically strong permutations from the butterfly structure17
New PcN and APcN functions over finite fields16
A note on Assmus–Mattson type theorems16
Distance Distributions of Cyclic Orbit Codes15
Traceable ring signatures: general framework and post-quantum security15
Cyclic codes and some new entanglement-assisted quantum MDS codes14
Scattered subspaces and related codes14
Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation14
Fast, compact, and expressive attribute-based encryption14
A family of projective two-weight linear codes14
Differential spectra of a class of power permutations with characteristic 513
Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature13
Bent partitions12
Construction of lightweight involutory MDS matrices12
Additive complementary dual codes over $$\mathbb {F}_4$$11
Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice11
MDS symbol-pair codes from repeated-root cyclic codes11
On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity10
A new method for constructing linear codes with small hulls10
Design-theoretic analogies between codes, lattices, and vertex operator algebras10
Novel generic construction of leakage-resilient PKE scheme with CCA security10
The dual of an evaluation code10
On the linearity and classification of $${\mathbb {Z}}_{p^s}$$-linear generalized hadamard codes10
An improved method for constructing formally self-dual codes with small hulls10
Linear complementary pairs of codes over rings10
Boomerang uniformity of a class of power maps10
Binary Hamming codes and Boolean designs10
New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes10
The first families of highly symmetric Kirkman Triple Systems whose orders fill a congruence class9
Twisted cubic and point-line incidence matrix in $$\mathrm {PG}(3,q)$$9
Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity9
Evaluation codes and their basic parameters9
A survey of elliptic curves for proof systems9
Two families of negacyclic BCH codes9
Bounds for flag codes9
New constructions of Z-complementary code sets and mutually orthogonal complementary sequence sets9
Near-MDS codes from elliptic curves9
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes8
MDS and near-MDS codes via twisted Reed–Solomon codes8
Weight distribution of double cyclic codes over Galois rings8
Difference matrices with five rows over finite abelian groups8
Code-based signatures from new proofs of knowledge for the syndrome decoding problem8
Complete b-symbol weight distribution of some irreducible cyclic codes8
On the dimension and structure of the square of the dual of a Goppa code8
A new construction of linear codes with one-dimensional hull8
New families of self-dual codes8
Constructing saturating sets in projective spaces using subgeometries8
A note on “Cryptographically strong permutations from the butterfly structure”7
A scalable post-quantum hash-based group signature7
The projective general linear group $${\mathrm {PGL}}(2,2^m)$$ and linear codes of length $$2^m+1$$7
The extended coset leader weight enumerator of a twisted cubic code7
Cyclic orbit flag codes7
Classification of permutation polynomials of the form $$x^3g(x^{q-1})$$ of $${\mathbb F}_{q^2}$$ where $$g(x)=x^3+bx+c$$ and $$b,c \in {\mathbb F}_q^*$$7
A class of twisted generalized Reed–Solomon codes7
Extending Coggia–Couvreur attack on Loidreau’s rank-metric cryptosystem7
Egalitarian Steiner triple systems for data popularity7
Constructions for new orthogonal arrays based on large sets of orthogonal arrays7
Mosaics of combinatorial designs for information-theoretic security7
The MILP-aided conditional differential attack and its application to Trivium6
Some restrictions on the weight enumerators of near-extremal ternary self-dual codes and quaternary Hermitian self-dual codes6
Galois self-orthogonal constacyclic codes over finite fields6
On the c-differential spectrum of power functions over finite fields6
LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding6
Weight distributions and weight hierarchies of a family of p-ary linear codes6
Revisiting algebraic attacks on MinRank and on the rank decoding problem6
Vectorial bent functions and partial difference sets6
Parameters and characterizations of hulls of some projective narrow-sense BCH codes6
On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs6
Explicit infinite families of bent functions outside the completed Maiorana–McFarland class6
Self-orthogonal codes over a non-unital ring and combinatorial matrices6
Group signatures and more from isogenies and lattices: generic, simple, and efficient6
Binomial permutations over finite fields with even characteristic6
Indifferentiable hashing to ordinary elliptic $${\mathbb {F}}_{\!q}$$-curves of $$j=0$$ with the cost of one exponentiation in $${\mathbb {F}}_{\!q}$$6
Bent functions in the partial spread class generated by linear recurring sequences6
Adaptively secure revocable hierarchical IBE from k-linear assumption6
Constructions of large cyclic constant dimension codes via Sidon spaces6
Five families of the narrow-sense primitive BCH codes over finite fields5
A note on the Assmus–Mattson theorem for some binary codes5
Construction of $${\text {MDS}}$$ matrices from generalized Feistel structures5
On $$\mathbb {Z}_2\mathbb {Z}_4$$-additive polycyclic codes and their Gray images5
Extended cyclic codes, maximal arcs and ovoids5
An infinite family of antiprimitive cyclic codes supporting Steiner systems $$S(3,8, 7^m+1)$$5
The build-up construction over a commutative non-unital ring5
Functional encryption for set intersection in the multi-client setting5
A Legendre pair of length 77 using complementary binary matrices with fixed marginals5
About r-primitive and k-normal elements in finite fields5
Generalized semifield spreads5
Constructions of new matroids and designs over $${\mathbb {F}}_q$$5
Cyclic constant dimension subspace codes via the sum of Sidon spaces5
Flag-transitive 2-$$(v,k,\lambda )$$ designs with $$r>\lambda (k-3)$$5
Nonexistence of perfect permutation codes under the Kendall $$\tau $$-metric5
Phase orthogonal sequence sets for (QS)CDMA communications5
A direct proof of APN-ness of the Kasami functions5
On certain self-orthogonal AG codes with applications to Quantum error-correcting codes5
A family of linear codes from constant dimension subspace codes4
LowMS: a new rank metric code-based KEM without ideal structure4
Minimal binary linear codes: a general framework based on bent concatenation4
An STP-based model toward designing S-boxes with good cryptographic properties4
Asymmetric entanglement-assisted quantum codes: bound and constructions4
Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate4
The existence of cyclic (v, 4, 1)-designs4
Construction of storage codes of rate approaching one on triangle-free graphs4
A construction of maximally recoverable codes4
On security properties of all-or-nothing transforms4
On near–MDS codes and caps4
New results on vectorial dual-bent functions and partial difference sets4
Polycyclic codes associated with trinomials: good codes and open questions4
Parallel sub-code construction for constant-dimension codes4
A polynomial time algorithm for breaking NTRU encryption with multiple keys4
Simple and efficient FE for quadratic functions4
Optimal quaternary Hermitian LCD codes and their related codes4
Equivalence classes of Niho bent functions4
On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes4
Proposing an MILP-based method for the experimental verification of difference-based trails: application to SPECK, SIMECK4
Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework4
$$(\theta , \delta _\theta )$$-Cyclic codes over $$\mathbb {F}_q[u,v]/\langle u^2-u, v^2-v, uv-vu \rangle $$4
A generic method for investigating nonsingular Galois NFSRs4
Low-rank parity-check codes over Galois rings4
Constructions of MDS symbol-pair codes with minimum distance seven or eight4
On the subgroup perfect codes in Cayley graphs4
On the algebraic degree of iterated power functions4
Uniqueness of the inversive plane of order sixty-four4
Walsh spectrum and nega spectrum of complementary arrays3
Hardness estimates of the code equivalence problem in the rank metric3
Cryptanalysis of Boyen’s attribute-based encryption scheme in TCC 20133
On the equivalence of $$\mathbb {Z}_{p^s}$$-linear generalized Hadamard codes3
Duals of linearized Reed–Solomon codes3
Practical dynamic group signatures without knowledge extractors3
Existence of primitive normal pairs with one prescribed trace over finite fields3
s-Elusive codes in Hamming graphs3
Binary linear codes with few weights from Boolean functions3
Standard model leakage-resilient authenticated key exchange using inner-product extractors3
On arithmetic progressions in finite fields3
Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein–Jacobi integers and Lipschitz integers3
The Eckardt point configuration of cubic surfaces revisited3
Improved indifferentiability security proof for 3-round tweakable Luby–Rackoff3
Ligero: lightweight sublinear arguments without a trusted setup3
Derivatives of bent functions in connection with the bent sum decomposition problem3
A complete characterization of $${\mathcal {D}}_0 \cap {\mathcal {M}}^\#$$ and a general framework for specifying bent functions in $${\mathcal {C}}$$ outside $${\mathcal {M}}^\#$$3
Roulette games and depths of words over finite commutative rings3
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security3
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems3
Security analysis of Subterranean 2.03
Optimal selection for good polynomials of degree up to five3
Composite matrices from group rings, composite G-codes and constructions of self-dual codes3
Regular complete permutation polynomials over $${\mathbb {F}}_{2^{n}}$$3
Image sets of perfectly nonlinear maps3
Robustly reusable fuzzy extractor with imperfect randomness3
Further projective binary linear codes derived from two-to-one functions and their duals3
Hadamard matrices related to a certain series of ternary self-dual codes3
Good polynomials for optimal LRC of low locality3
Cryptanalysis of a code-based full-time signature3
An asymptotic lower bound on the number of bent functions3
A new method for secondary constructions of vectorial bent functions3
A non-interactive (t, n)-publicly verifiable multi-secret sharing scheme3
Efficient identity-based encryption with Hierarchical key-insulation from HIBE3
Geometric orthogonal codes and geometrical difference packings3
LCP of group codes over finite Frobenius rings3
Weight distributions of Q2DC codes over finite fields3
The differential spectrum and boomerang spectrum of a class of locally-APN functions3
Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/23
Wide minimal binary linear codes from the general Maiorana–McFarland class3
Greedy weights for matroids3
A gapless code-based hash proof system based on RQC and its applications3
0.066009044647217