Designs Codes and Cryptography

Papers
(The median citation count of Designs Codes and Cryptography is 1. 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-03-01 to 2024-03-01.)
ArticleCitations
Quantum attacks on some feistel block ciphers34
On the c-differential uniformity of certain maps over finite fields30
On the boomerang uniformity of quadratic permutations25
MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes22
Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation21
Some classes of power functions with low c-differential uniformity over finite fields19
A general framework for secondary constructions of bent and plateaued functions18
Optimal binary LCD codes17
Construction of MDS twisted Reed–Solomon codes and LCD MDS codes17
Cryptanalysis of a system based on twisted Reed–Solomon codes16
Cryptographically strong permutations from the butterfly structure15
Characterization and classification of optimal LCD codes15
Some constructions of quantum MDS codes14
New PcN and APcN functions over finite fields14
Scattered subspaces and related codes13
Distance Distributions of Cyclic Orbit Codes13
A geometric approach to rank metric codes and a classification of constant weight codes13
Fast, compact, and expressive attribute-based encryption13
Bent partitions12
A note on Assmus–Mattson type theorems12
A new family of EAQMDS codes constructed from constacyclic codes12
On the security of a Loidreau rank metric code based encryption scheme12
Traceable ring signatures: general framework and post-quantum security12
Construction of binary LCD codes, ternary LCD codes and quaternary Hermitian LCD codes12
A polymatroid approach to generalized weights of rank metric codes12
Differential spectra of a class of power permutations with characteristic 511
Optimal minimal linear codes from posets11
A family of projective two-weight linear codes11
On constructions and properties of (n, m)-functions with maximal number of bent components10
Tightly CCA-secure encryption scheme in a multi-user setting with corruptions10
MDS symbol-pair codes from repeated-root cyclic codes10
An algorithm for decoding skew Reed–Solomon codes with respect to the skew metric10
Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation10
The minimum locality of linear codes10
Linear codes with few weights from cyclotomic classes and weakly regular bent functions10
Cyclic codes and some new entanglement-assisted quantum MDS codes10
Hamming and simplex codes for the sum-rank metric10
Bent and $${{\mathbb {Z}}}_{2^k}$$-Bent functions from spread-like partitions10
Boomerang uniformity of a class of power maps9
Construction of lightweight involutory MDS matrices9
Novel generic construction of leakage-resilient PKE scheme with CCA security9
Linearly equivalent S-boxes and the division property9
On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity9
Two families of two-weight codes over $$\mathbb {Z}_4$$9
Twisted cubic and point-line incidence matrix in $$\mathrm {PG}(3,q)$$9
Generalized isotopic shift construction for APN functions9
SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations9
Boomerang uniformity of popular S-box constructions8
The dual of an evaluation code8
Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice8
On the linearity and classification of $${\mathbb {Z}}_{p^s}$$-linear generalized hadamard codes8
Design-theoretic analogies between codes, lattices, and vertex operator algebras8
Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature8
Linear complementary pairs of codes over rings8
Construction of isodual codes from polycirculant matrices8
Differentially low uniform permutations from known 4-uniform functions8
Weight distribution of double cyclic codes over Galois rings8
The first families of highly symmetric Kirkman Triple Systems whose orders fill a congruence class8
Complete b-symbol weight distribution of some irreducible cyclic codes8
New constructions of Z-complementary code sets and mutually orthogonal complementary sequence sets8
Binary Hamming codes and Boolean designs8
Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity8
Access balancing in storage systems by labeling partial Steiner systems8
Characterizations and constructions of triple-cycle permutations of the form $$x^rh(x^s)$$7
Linear complementary pair of group codes over finite chain rings7
The extended coset leader weight enumerator of a twisted cubic code7
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
The projective general linear group $${\mathrm {PGL}}(2,2^m)$$ and linear codes of length $$2^m+1$$7
A note on “Cryptographically strong permutations from the butterfly structure”7
New families of self-dual codes7
Difference matrices with five rows over finite abelian groups7
Extending Coggia–Couvreur attack on Loidreau’s rank-metric cryptosystem7
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
A scalable post-quantum hash-based group signature6
Bounds for flag codes6
Constructing saturating sets in projective spaces using subgeometries6
A new construction of linear codes with one-dimensional hull6
A new method for constructing linear codes with small hulls6
Composite matrices from group rings, composite G-codes and constructions of self-dual codes6
Additive complementary dual codes over $$\mathbb {F}_4$$6
Evaluation codes and their basic parameters6
On post-processing in the quantum algorithm for computing short discrete logarithms6
Adaptively secure revocable hierarchical IBE from k-linear assumption6
Near-MDS codes from elliptic curves6
Mosaics of combinatorial designs for information-theoretic security6
Indifferentiable hashing to ordinary elliptic $${\mathbb {F}}_{\!q}$$-curves of $$j=0$$ with the cost of one exponentiation in $${\mathbb {F}}_{\!q}$$5
Code-based signatures from new proofs of knowledge for the syndrome decoding problem5
Bent functions in the partial spread class generated by linear recurring sequences5
A survey of elliptic curves for proof systems5
Nonexistence of perfect permutation codes under the Kendall $$\tau $$-metric5
Steiner systems and configurations of points5
The MILP-aided conditional differential attack and its application to Trivium5
Vectorial bent functions and partial difference sets5
An infinite family of antiprimitive cyclic codes supporting Steiner systems $$S(3,8, 7^m+1)$$5
On the inverses of Kasami and Bracken–Leander exponents5
Caps and progression-free sets in $${{\mathbb {Z}}}_m^n$$5
Egalitarian Steiner triple systems for data popularity5
A direct proof of APN-ness of the Kasami functions5
Group signatures and more from isogenies and lattices: generic, simple, and efficient5
About r-primitive and k-normal elements in finite fields5
New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes5
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes5
Binary primitive LCD BCH codes5
MDS and near-MDS codes via twisted Reed–Solomon codes5
Construction of $${\text {MDS}}$$ matrices from generalized Feistel structures5
A construction method of balanced rotation symmetric Boolean functions on arbitrary even number of variables with optimal algebraic immunity5
Fast computation of linear approximation over certain composition functions and applications to SNOW 2.0 and SNOW 3G5
Phase orthogonal sequence sets for (QS)CDMA communications5
Generalized semifield spreads5
A construction of maximally recoverable codes4
On security properties of all-or-nothing transforms4
The phantom of differential characteristics4
Cyclic orbit flag codes4
A Legendre pair of length 77 using complementary binary matrices with fixed marginals4
Constructions of MDS symbol-pair codes with minimum distance seven or eight4
An improved method for constructing formally self-dual codes with small hulls4
Equivalence classes of Niho bent functions4
Parameters and characterizations of hulls of some projective narrow-sense BCH codes4
Constructions of new matroids and designs over $${\mathbb {F}}_q$$4
On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs4
Functional encryption for set intersection in the multi-client setting4
Revisiting Gilbert’s known-key distinguisher4
Affine equivalence for quadratic rotation symmetric Boolean functions4
On $$\mathbb {Z}_2\mathbb {Z}_4$$-additive polycyclic codes and their Gray images4
Binomial permutations over finite fields with even characteristic4
A family of linear codes from constant dimension subspace codes4
A new method for secondary constructions of vectorial bent functions4
A note on the Assmus–Mattson theorem for some binary codes4
Two families of negacyclic BCH codes4
On the dimension and structure of the square of the dual of a Goppa code4
LCD codes and self-orthogonal codes in generalized dihedral group algebras4
Weight distributions of Q2DC codes over finite fields3
Subgroup perfect codes in Cayley sum graphs3
Maximal nonassociativity via fields3
A class of twisted generalized Reed–Solomon codes3
Galois self-orthogonal constacyclic codes over finite fields3
Uniqueness of the inversive plane of order sixty-four3
Standard model leakage-resilient authenticated key exchange using inner-product extractors3
New results on vectorial dual-bent functions and partial difference sets3
Good polynomials for optimal LRC of low locality3
An STP-based model toward designing S-boxes with good cryptographic properties3
Common information, matroid representation, and secret sharing for matroid ports3
Regular complete permutation polynomials over $${\mathbb {F}}_{2^{n}}$$3
Analysis of DeepBKZ reduction for finding short lattice vectors3
Classification of self-dual cyclic codes over the chain ring $$\mathbb Z_p[u]/\langle u^3 \rangle $$3
Weierstrass semigroup at $$m+1$$ rational points in maximal curves which cannot be covered by the Hermitian curve3
A gapless code-based hash proof system based on RQC and its applications3
On certain self-orthogonal AG codes with applications to Quantum error-correcting codes3
Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein–Jacobi integers and Lipschitz integers3
IBE with tight security against selective opening and chosen-ciphertext attacks3
Walsh spectrum and nega spectrum of complementary arrays3
Rédei permutations with cycles of the same length3
A new rank metric for convolutional codes3
$$(\theta , \delta _\theta )$$-Cyclic codes over $$\mathbb {F}_q[u,v]/\langle u^2-u, v^2-v, uv-vu \rangle $$3
Constructions of large cyclic constant dimension codes via Sidon spaces3
Parallel sub-code construction for constant-dimension codes3
Self-orthogonal codes over a non-unital ring and combinatorial matrices3
Simple and efficient FE for quadratic functions3
Extended cyclic codes, maximal arcs and ovoids3
Proposing an MILP-based method for the experimental verification of difference-based trails: application to SPECK, SIMECK3
On the algebraic degree of iterated power functions3
On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes3
Greedy weights for matroids3
Cyclic constant dimension subspace codes via the sum of Sidon spaces3
Weight distributions and weight hierarchies of a family of p-ary linear codes3
A non-interactive (t, n)-publicly verifiable multi-secret sharing scheme3
s-Elusive codes in Hamming graphs3
Low-rank parity-check codes over Galois rings3
On near–MDS codes and caps2
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems2
Switching for 2-designs2
On 2-parent-identifying set systems of block size 42
Isometry-dual flags of AG codes2
Variants of Jacobi polynomials in coding theory2
Improved upper bounds for parent-identifying set systems and separable codes2
Some hypersurfaces over finite fields, minimal codes and secret sharing schemes2
Lattice-based zero-knowledge arguments for additive and multiplicative relations2
Reversible $$G^k$$-codes with applications to DNA codes2
$$\mathsf {CENCPP}^*$$: beyond-birthday-secure encryption from public permutations2
LCP of group codes over finite Frobenius rings2
Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate2
An asymptotic lower bound on the number of bent functions2
Breaking tweakable enciphering schemes using Simon’s algorithm2
On q-ary bent and plateaued functions2
Perfect LRCs and k-optimal LRCs2
Combinatorial invariants for nets of conics in $$\mathrm {PG}(2,q)$$2
Robustly reusable fuzzy extractor with imperfect randomness2
Geometric orthogonal codes and geometrical difference packings2
On the number of q-ary quasi-perfect codes with covering radius 22
Flag-transitive 2-$$(v,k,\lambda )$$ designs with $$r>\lambda (k-3)$$2
Image sets of perfectly nonlinear maps2
Polycyclic codes associated with trinomials: good codes and open questions2
Some restrictions on the weight enumerators of near-extremal ternary self-dual codes and quaternary Hermitian self-dual codes2
Several secondary methods for constructing bent–negabent functions2
A state bit recovery algorithm with TMDTO attack on Lizard and Grain-128a2
SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions2
Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets2
Duals of linearized Reed–Solomon codes2
The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude2
Proving knowledge of isogenies: a survey2
On the subgroup perfect codes in Cayley graphs2
Derivatives of bent functions in connection with the bent sum decomposition problem2
A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis2
The geometric field of linearity of linear sets2
Harmonic Tutte polynomials of matroids2
High dimensional affine codes whose square has a designed minimum distance2
Minimal binary linear codes: a general framework based on bent concatenation2
Plane curves giving rise to blocking sets over finite fields2
Cryptanalysis of Boyen’s attribute-based encryption scheme in TCC 20132
The Eckardt point configuration of cubic surfaces revisited2
Roulette games and depths of words over finite commutative rings2
On equivalency of zero-divisor codes via classifying their idempotent generator2
Efficient identity-based encryption with Hierarchical key-insulation from HIBE2
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security2
Optimal quaternary Hermitian LCD codes and their related codes2
LowMS: a new rank metric code-based KEM without ideal structure2
Practical dynamic group signatures without knowledge extractors2
Cameron–Liebler k-sets in subspaces and non-existence conditions2
Using permutation rational functions to obtain permutation arrays with large hamming distance2
Construction of single-deletion-correcting DNA codes using CIS codes2
On optimal weak algebraic manipulation detection codes and weighted external difference families2
Counting Boolean functions with faster points2
PIR Codes with Short Block Length2
Five families of the narrow-sense primitive BCH codes over finite fields2
Optimal selection for good polynomials of degree up to five2
The build-up construction over a commutative non-unital ring2
Revisiting algebraic attacks on MinRank and on the rank decoding problem2
Asymmetric entanglement-assisted quantum codes: bound and constructions2
Relative generalized Hamming weights of affine Cartesian codes2
Existence of primitive normal pairs with one prescribed trace over finite fields2
Sharper bounds on four lattice constants2
Wide minimal binary linear codes from the general Maiorana–McFarland class2
On the Resilience of Even-Mansour to Invariant Permutations2
On arithmetic progressions in finite fields2
Hamming weight distributions of multi-twisted codes over finite fields2
Privacy-preserving data splitting: a combinatorial approach2
A further study on the construction methods of bent functions and self-dual bent functions based on Rothaus’s bent function2
Explicit infinite families of bent functions outside the completed Maiorana–McFarland class2
Parameters of several families of binary duadic codes and their related codes1
Grain-like structures with minimal and maximal period sequences1
A note on the Assmus–Mattson theorem for some binary codes II1
Codes with locality from cyclic extensions of Deligne–Lusztig curves1
Several families of irreducible constacyclic and cyclic codes1
On the design and security of Lee metric McEliece cryptosystems1
Cryptanalysis of a code-based full-time signature1
Spectral symmetry in conference matrices1
Symplectic 4-dimensional semifields of order $$8^4$$ and $$9^4$$1
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz1
A complete characterization of $${\mathcal {D}}_0 \cap {\mathcal {M}}^\#$$ and a general framework for specifying bent functions in $${\mathcal {C}}$$ outside $${\mathcal {M}}^\#$$1
0.046617984771729