Zobrazeno 1 - 10
of 1 625
pro vyhledávání: '"94a60"'
This paper presents enhanced reductions of the bounded-weight and exact-weight Syndrome Decoding Problem (SDP) to a system of quadratic equations. Over $\mathbb{F}_2$, we improve on a previous work and study the degree of regularity of the modeling o
Externí odkaz:
http://arxiv.org/abs/2412.04848
The advent of large-scale quantum computers implies that our existing public-key cryptography infrastructure has become insecure. That means that the privacy of many mobile applications involving dynamic peer groups, such as multicast messaging or pa
Externí odkaz:
http://arxiv.org/abs/2412.00387
In this paper, we informally introduce the Pulsar proof of stake consensus paper and discuss the relevant design decisions and considerations. The Pulsar protocol we propose is designed to facilitate the creation of a proof of stake sidechain for a p
Externí odkaz:
http://arxiv.org/abs/2411.14245
Autor:
Castro, Fernando Peralta
Cryptography, derived from Greek meaning hidden writing, uses mathematical techniques to secure information by converting it into an unreadable format. While cryptography as a science began around 100 years ago, its roots trace back to ancient civili
Externí odkaz:
http://arxiv.org/abs/2411.14451
Autor:
Battarbee, Christopher, Striecks, Christoph, Perret, Ludovic, Ramacher, Sebastian, Verhaeghe, Kevin
Authenticated Key Exchange (AKE) between any two entities is one of the most important security protocols available for securing our digital networks and infrastructures. In PQCrypto 2023, Bruckner, Ramacher and Striecks proposed a novel hybrid AKE (
Externí odkaz:
http://arxiv.org/abs/2411.04030
Autor:
Lin, Fangyuan
This paper revisits the classical notion of unicity distance from an enlightening perspective grounded in information theory, specifically by framing the encryption process as a noisy transmission channel. Using results from reliable communication th
Externí odkaz:
http://arxiv.org/abs/2410.14816
Autor:
Matthews, Gretchen L, McMillon, Emily
Bit Flipping Key Encapsulation (BIKE) is a code-based cryptosystem being considered in Round 4 of the NIST Post-Quantum Cryptography Standardization process. It is based on quasi-cyclic moderate-density parity-check (QC-MDPC) codes paired with an ite
Externí odkaz:
http://arxiv.org/abs/2410.11111
Finding a low-weight multiple (LWPM) of a given polynomial is very useful in the cryptanalysis of stream ciphers and arithmetic in finite fields. There is no known deterministic polynomial time complexity algorithm for solving this problem, and the m
Externí odkaz:
http://arxiv.org/abs/2410.10224
We formalize and extend existing definitions of backdoor-based watermarks and adversarial defenses as interactive protocols between two players. The existence of these schemes is inherently tied to the learning tasks for which they are designed. Our
Externí odkaz:
http://arxiv.org/abs/2410.08864
Fast Multiplication and the PLWE-RLWE Equivalence for an Infinite Family of Cyclotomic Subextensions
Autor:
Ahola, Joonas, Blanco-Chacón, Iván, Bolaños, Wilmar, Haavikko, Antti, Hollanti, Camilla, Sánchez-Ledesma, Rodrigo Martín
We prove the equivalence between the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems for the maximal totally real subfield of the $2^r 3^s$-th cyclotomic field for $r \geq 3$ and $s \geq 1$. Moreover, we descr
Externí odkaz:
http://arxiv.org/abs/2410.00792