arXiv subjects

Wilmar Bolaños

Publications and source records attributed to Wilmar Bolaños.

4 recordsLinked to original sources

arXiv2025

A Fast Multiplication Algorithm and RLWE-PLWE Equivalence for the Maximal Real Subfield of the $2^r p^s$-th Cyclotomic Field

This paper proves the RLWE-PLWE equivalence for the maximal real subfields of the cyclotomic fields with conductor $n = 2^r p^s$, where $p$ is an odd prime, and $r \geq 0$ and $s \geq 1$ are integers. In particular, we show that the canonical embedding as a linear transform has a condition number bounded above by a polynomial in $n$. In addition, we describe a fast multiplication algorithm in the ring of integers of these real subfields. The multiplication algorithm uses the fast Discrete Cosine Transform (DCT) and has computational complexity $\mathcal{O}(n \log n)$. Both the proof of the RLWE-PLWE equivalence and the fast multiplication algorithm are generalizations of previous results by Ahola et al., where the same claims are proved for a single prime $p = 3$.

cs.CR↗

arXiv2025

Fast Multiplication and the PLWE-RLWE Equivalence for an Infinite Family of Maximal Real Subfields of Cyclotomic Fields

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 describe a fast algorithm for computing the product of two elements in the ring of integers of these subfields. This multiplication algorithm has quasilinear complexity in the dimension of the field, as it makes use of the fast Discrete Cosine Transform (DCT). Our approach assumes that the two input polynomials are given in a basis of Chebyshev-like polynomials, in contrast to the customary power basis. To validate this assumption, we prove that the change of basis from the power basis to the Chebyshev-like basis can be computed with $\mathcal{O}(n \log n)$ arithmetic operations, where $n$ is the problem dimension. Finally, we provide a heuristic and theoretical comparison of the vulnerability to some attacks for the $p$-th cyclotomic field versus the maximal totally real subextension of the $4p$-th cyclotomic field for a reasonable set of parameters of cryptographic size.

cs.CR↗

arXiv2022

The Shape of cyclic number fields

Let $m>1$ and $\mathfrak{d} \neq 0$ be integers such that $v_{p}(\mathfrak{d}) \neq m$ for any prime $p$. We construct a matrix $A(\mathfrak{d})$ of size $(m-1) \times (m-1)$ depending on only of $\mathfrak{d}$ with the following property: For any tame $\mathbb{Z}/m\mathbb{Z}$-number field $K$ of discriminant $\mathfrak{d}$ the matrix $A(\mathfrak{d})$ represents the Gram matrix of the integral trace zero form of $K$. In particular, we have that the integral trace zero form of tame cyclic number fields is determined by the degree and discriminant of the field. Furthermore, if in addition to the above hypotheses, we consider real number fields, then the shape is also determined by the degree and the discriminant

math.NT↗

arXiv2020

The trace form over cyclic number fields

In the mid 80's Conner and Perlis showed that for cyclic number fields of prime degree $p$ the isometry class of integral trace is completely determined by the discriminant. Here we generalize their result to tame cyclic number fields of arbitrary degree. Furthermore, for such fields, we give an explicit description of a Gram matrix of the integral trace in terms of the discriminant of the field.

math.NT↗