Cryptography and Communications
Издатель: Springer Nature · ISSN 1936-2447,1936-2455 · 165 статей
- A note on cyclic MDS and non-MDS matrices
- Generic constructions of plateaued idempotents with high algebraic degree
- Upper bounds on the size of permutation codes with a Hamming distance of five
-
Bent partitions and Maiorana-McFarland association schemes
Abstract The recently introduced generalized semifield spreads are partitions of $${\mathbb {F}}_{p^m}\times {\mathbb {F}}_{p^m}$$ F p m × F p m , which are constructed from presemifields with a certain property, called right $${\mathbb...
- Improving block cipher resilience with dynamically generated XOR matrices using the Fisher-Yates shuffle method
-
Construction and equivalence for generalized boolean functions
Abstract Recently in Çeşmelioğlu, Meidl ( Adv. Math. Commun., 18 , 2024), the study of EA-equivalence and CCZ-equivalence for functions from $${\mathbb {V}}_n^{(p)}$$ V n ( p ) to the cyclic group $${\mathbb {Z}}_{p^k}$$ Z p k has been...
- A new class of S-boxes with optimal Feistel boomerang uniformity
- Complete weight enumerators of few-weight linear codes
-
On the number of relevant variables for discrete functions
Abstract We consider various definitions of degrees of discrete functions and establish relations between the number of relevant (essential) variables and degrees of two- and three-valued functions.
- An effective approach to enumerate universal cycles for k-permutations
- Minimal codewords over finite fields derived from certain graphs
- New constant dimension subspace codes via generalized coset construction
- $$\sigma $$ hulls of Goppa codes and related codes over $${\mathbb {F}}_q$$
- Several new kinds of (k+1)-dimensional Sidon spaces and cyclic subspace codes
- Table-based guess and determine attack and application to SOSEMANUK
- Hierarchical frequency hopping for heterogeneous multi-tier networks: Sequence design and performance analysis
- On the sample complexity of linear code equivalence for all code rates
-
On the bijectivity of the map $$\chi $$
Abstract We prove that for $$n>1$$ n > 1 the map $$\chi :\mathbb {F}_q^n \rightarrow \mathbb {F}_q^n$$ χ : F q n → F q n , defined by $$y=\chi (x)$$ y = χ ( x ) with $$y_i = x_i + x_{i+2}\cdot (1+x_{i+1})$$ y i = x i + x i + 2 · ( 1 + x...
-
On a classification of planar functions in characteristic three
Abstract Planar functions are functions over a finite field that have optimal combinatorial properties and they have applications in several branches of mathematics, including algebra, projective geometry and cryptography. There are two...
- Constructions of non-binary Golay complementary pairs of new lengths
- Negacyclic dually-BCH codes of length $$q^{m}-1$$
- A construction of optimal Z-complementary code sets based on partially m-shift orthogonal complementary codes
- Some notes on the pseudorandomness of Legendre symbol and Liouville function
-
Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields
Abstract We discuss the advantages and limitations of cyclotomic fields to have fast polynomial arithmetic within homomorphic encryption, and show how these limitations can be overcome by replacing cyclotomic fields by a family that we...
-
Observations on NIST SP 800-90B entropy estimators
Abstract Random numbers play a crucial role in cryptography since the security of cryptographic protocols relies on the assumption of the availability of uniformly distributed and unpredictable random numbers to generate secret keys,...
- Skew negacyclic codes of length $$4p^s$$ over $$\mathbb {F}_{p^m} + u\mathbb {F}_{p^m}$$
- Optimal few-weight codes from projective spaces
-
Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes
Abstract We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier...
- The second-order zero differential spectra of some functions over finite fields
- On additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation