Designs, Codes and Cryptography
Издатель: Springer Nature · ISSN 0925-1022,1573-7586 · 429 статей
- Balanced $$(\mathbb {Z}_{m}\times \mathbb {Z}_{n},\{4,5\},1)$$-difference packings and their related OOSPCs
- Analysis of Hermitian hulls of Reed–Solomon codes and EAQECCs
-
Block-transitive designs with a poset of imprimitive partitions
Abstract We study block designs which admit an automorphism group that is transitive on blocks and points, and leaves invariant every partition in a given finite poset of partitions of the point set. The full stabiliser G of all the...
- Construction of balanced $$2^{k}$$-variable rotation symmetric Boolean functions with optimal algebraic immunity
- On the second generalized covering radius for binary primitive triple-error-correcting BCH codes
- Line-parallelisms of PG(n, 2) from Preparata-like codes
-
Evaluation codes from linear systems of conics
Abstract The Datta–Johnsen code is an evaluation code where the linear combinations of elementary symmetric polynomials are evaluated on the set of all points with pairwise distinct coordinates in an affine space of dimension $$\ge \,...
- On codes from split metacyclic groups
- $$\mathbb {F}_2\mathbb {F}_4$$-ACP of codes
- Hierarchical identity-based encryption with receiver selective opening security in the multi-challenge setting
- Strong existential unforgeability and BUFF securities of MPC-in-the-head signatures
- Quantum weighted algebraic geometry codes
-
Steiner 3-designs as extensions
Abstract In this article, we construct a Steiner system with the parameters S (3, 6, 42), settling one of the smallest open parameter sets of Steiner 3-designs. Furthermore, we establish the existence of rotational Steiner quadruple...
- Block-transitive 3-$$(v,7,\lambda )$$ designs
- On the reducibility of minihypers
- On subcodes of the generalized Reed-Solomon codes
- An improved automatic framework for searching for differential-linear distinguishers with applications to SPN and Feistel block ciphers
-
The existence and structure of universal partial cycles
Abstract A universal partial cycle (or upcycle) for $$\mathcal {A}^n$$ A n is a cyclic sequence that covers each word of length n over the alphabet $$\mathcal {A}$$ A exactly once—like a De Bruijn cycle, except that we also allow a...
- Integer sequences that are generalized weights of a linear code
-
Efficient private PEZ protocols without binary-input restrictions
Abstract Balogh et al. proposed deterministic secure multiparty computation called private PEZ protocols . In their work, a general construction of private PEZ protocols for computing an arbitrary function with n inputs is presented,...
- Efficient universal cycle constructions for k-permutations via concatenation trees
- Bilateral access control ABE from lattices and application to AB-ME
- Revisiting mixture-differential cryptanalysis on AES: new techniques and results
- Minimum-size s-PD sets in partial permutation decoding with applications to cyclic and quasi-cyclic codes
- Cryptanalysis of Gleeok-128
- New progress on orthogonal arrays OA(3, 6, v)
- Two families of linear codes containing non-GRS MDS codes
- Generalized Hamming weights of additive codes and geometric counterparts
- On s-flag-transitive designs and semisymmetric graphs
-
DuX: a block cipher for efficient FHE evaluation
Abstract With the development and practical application of technologies such as Fully Homomorphic Encryption (FHE), Secure Multi-Party Computation (MPC), and Zero-Knowledge Proof (ZK), it has become crucial to research the design and...