arXiv:2611.17393v1 Announce Type: new Abstract: End-to-end autoencoder communication has emerged as a promising means of achieving efficient data transmission across various domains. Nevertheless, vulnerabilities have recently been revealed in these systems by adversarial attack…
⏱ Độ trễ thật của tab này: trung bình 7.1 giờ sau khi CVE được công bố (n = 5350, sớm nhất 0.1 giờ). Số âm nghĩa là ta thấy trước ngày công bố.
arXiv:2611.18358v1 Announce Type: cross Abstract: Almost perfect nonlinear (APN) functions of $\mathbb{F}_2^n$ have the lowest possible differential uniformity. The only known APN permutation in even dimension, in dimension six, is equivalent to a quadratic APN function with a n…
arXiv:2611.16244v1 Announce Type: new Abstract: We introduce SEC, an expander-code-based ramp secret sharing scheme over $\mathbb{Z}$-modules, particularly suitable for lattice-based distributed cryptography. It is everywhere-short: bounded secret coefficients yield bounded shar…
arXiv:2611.12959v1 Announce Type: new Abstract: Monitoring a visible channel can change how learned agents communicate without removing why communication is useful. We test this distinction in an end-to-end game where a sender and receiver learn a discrete protocol and route pol…
arXiv:2611.10269v1 Announce Type: new Abstract: Whether almost perfect nonlinear (APN) permutations exist in even dimension $n\ge 8$ is a long-standing open question, the big APN problem. The only example known in even dimension, on six bits, was found from a quadratic APN funct…