Cryptography and Communications
Издатель: Springer Nature · ISSN 1936-2447,1936-2455 · 165 статей
- Twelve classes of optimal p-ary cyclic codes with minimal distance four
- Minimal subcodes and codes constructed from quadratic forms
- On the cardinality of the Walsh support of a Boolean function
- Explicit bases for Riemann-Roch spaces on elliptic curves and their application in constructing various elliptic code families
- Capacity-achieving codes for noisy insertion channels
- Dual codes from 2-cocycles
- A generalisation of bent vectors for Butson Hadamard matrices
- Multilevel constructions of constant dimension codes based on one-factorization of complete graphs
- Permutation polynomials of the form $$L(X)+\gamma \textrm{Tr}_q^{q^3}\left( h(X)\right) $$ over finite fields with even characteristic
- Cyclic $$\mathbb {F}_{q}$$-linear $$\mathbb {F}_q\mathbb {F}_{q^2}$$-codes and their Gray images
- Two new classes of few-weights linear codes
-
The nonlinearity of restrictions of direct sums of monomials and of threshold functions
Abstract We investigate the behavior of the nonlinearity for Boolean functions when their inputs are restricted to affine subspaces of the original domain. Functions which maintain a relatively high nonlinearity are of interest for...
- Bounds on size of codes equipped with cyclic burst–b distance
-
A BKW-style solver for the restricted syndrome decoding problem
Abstract The Restricted Syndrome Decoding Problem (RSDP) is a variant of the well-known syndrome decoding problem. It has recently been turned into a post-quantum signature scheme named CROSS by Baldi et al.. It is a scheme highlighted...
-
Spoofing-robust speaker verification based on time-domain embedding
Abstract Spoofing-robust automatic speaker verification (SASV) technology is used to safeguard voice-based authentication systems from fraudulent attempts. Such a system should be able to verify that the speech was spoken by the target...
- Self-dual double cyclic codes over $$\mathbb {F}_q$$
- Challenges in timed–cryptography
-
Provable imbalanced point clustering
Abstract We suggest efficient and provable methods to compute an approximation for imbalanced point clustering, that is, fitting k -centers to a set of points in $$\mathbb {R}^d$$ , for any $$d,k\ge 1$$ , where we aim to minimize the...
- SQIAsignHD: SQIsignHD adaptor signature
-
Leveraging kleptography to strengthen post-quantum cryptography
Abstract Quantum computing poses a significant threat to the security of many current cryptographic algorithms. This imminent risk has accelerated the development and standardization of new cryptosystems, known as post-quantum...
-
A survey on bent partitions
Abstract Since their introduction, many results on bent partitions appeared in various directions and in several papers. The objective of this survey is to provide an introduction to this relatively young topic and a comprehensive...
-
Further results on association schemes from non-weakly regular bent functions
Abstract Recent studies have shown that the preimage set partitions of weakly regular bent functions, particularly those that are vectorial dual–bent, can give rise to association schemes. The first construction of association schemes...
-
On some minimal linear codes invariant under the Chevalley group $$\textrm{F}_4(2)$$
Abstract Minimal linear codes play a central role in applications such as secret sharing and secure communication, and their construction often reveals deep connections between coding theory and other areas of mathematics. Using a...
-
On lower bounds for the distances between APN functions
Abstract Whether two distinct APN functions can have a Hamming distance of 1 remains an open problem. In 2020, L. Budaghyan et al. introduced a new CCZ-invariant $$\Pi _F$$ which can be used to provide lower bounds on the Hamming...
- Some observations on bent and planar functions
- Several new classes of optimal p-ary cyclic codes
- Linear complementary dual quasi–cyclic codes of index 2
- On binary and ternary LCD BCH codes with length $$n=\frac{q^m+1}{r}$$
-
A quantum-resistant unlinkable and strongly-unsplittable multi-coupon system
Abstract A multi-coupon is a batch of coupons (or tokens) a customer can redeem to a merchant in order to obtain some good or service. When all the tokens are intended to be redeemed by the same customer, their sharing is a fraud....
-
On the codebook design for NOMA schemes from bent functions
Abstract Uplink grant-free non-orthogonal multiple access (NOMA) is a promising technology for massive connectivity with low latency and high energy efficiency. In code-domain NOMA schemes, the requirements boil down to the design of...