arXiv subjects

Alessio Caminata

Publications and source records attributed to Alessio Caminata.

At least 19 recordsLinked to original sources

arXiv2026

The Darkside-20k Data Acquisition System

DarkSide-20k is a WIMP search experiment using liquid argon as a target, designed to perform a background-free search for dark matter with unprecedented sensitivity, and is currently under construction at INFN Laboratori Nazionali del Gran Sasso, Italy. The detector comprises a dual-phase Time Projection Chamber complemented with external veto systems and is equipped with a total of 2720 SiPM-based readout channels. This work presents the DAQ system designed for DarkSide-20k. The system is capable of continuous, triggerless digitisation of the waveforms with high single-photoelectron detection efficiency and online processing, ensuring data reduction for long-term storage. The DarkSide-20k DAQ system employs commercial CAEN VX2745 digitisers with custom FPGA firmware implementation. Timing and synchronisation across all 48 digitisers are provided by custom Global and Crate Data Manager boards distributing a phase-aligned clock derived from a disciplined rubidium standard. Waveform segments are processed in real time by Front End Processor machines. Data are organised into collections containing whole detector information and distributed across a farm of Time Slice Processors for event reconstruction, classification, and further reduction before storage and offline analysis. A full "Quadrant" of the system, corresponding to one quarter of the final DAQ, has been assembled and validated at TRIUMF laboratory in Canada. The Quadrant has been stress-tested with simultaneous pulses and demonstrated sustained digitizer readout exceeding expected physics rates and stable long-term performance.

physics.ins-det↗

arXiv2026

Algebraic Modelings of the Supersingular Isogeny Problem

We present a new algebraic modeling of the Supersingular Isogeny Problem as a system of multivariate polynomial equations, in the case where the elliptic curves are connected by an isogeny whose degree is a power of $2$ or $3$. This modeling relies on Renes formulas for elliptic curves in Montgomery form (degree $2$) or triangular form (degree $3$). We investigate several algebraic properties of these systems: we prove that they are zero-dimensional, compute the dimension of their highest degree part, and show that they are not in generic coordinates. Experimental results show that solving these systems via Gröbner basis techniques is significantly faster than solving the algebraic modeling with modular polynomials.

cs.SC↗

arXiv2025

Hilbert-Kunz series, F-signature series, and weak p-fractals

We extend the theory of $p$-fractals of Monsky and Teixeira by introducing the notion of weak $p$-fractal. We prove that for a hypersurface $f$ having rational Hilbert-Kunz series is equivalent to the weak $p$-fractality of the associated function $ϕ_{f,p}$ and having rational F-signature series is equivalent to the weak $p$-fractality of the reflection $\overlineϕ_{f,p}$. In addition, we prove some results characterizing the shape of the generating series of numerical functions which are quasi-polynomials in $p^n$. This is motivated by the fact that the Hilbert-Kunz and F-signature functions take this form in several examples of interest.

math.AC↗

arXiv2025

Solving Polynomial Systems with Gröbner Bases: An Introduction to F4 and FGLM

These notes originate from a reading course held by the authors in the spring of 2024 at the Università di Genova. They provide a hands-on introduction to the F4 and FGLM algorithms. In addition to the notes, we present two implementations of the algorithms: FGLM in CoCoALib and F4 in Sage. These implementations closely follow the structure of the algorithms as described here and are intended to help readers experiment with them in practice, thereby gaining a deeper understanding.

cs.SC↗

arXiv2025

Cryptanalysis of a multivariate CCZ scheme

We consider the multivariate scheme Pesto, which was introduced by Calderini, Caminata, and Villa. In this scheme, the public polynomials are obtained by applying a CCZ transformation to a set of quadratic secret polynomials. As a consequence, the public key consists of polynomials of degree 4. In this work, we show that the public degree 4 polynomial system can be efficiently reduced to a system of quadratic polynomials. This seems to suggest that the CCZ transformation may not offer a significant increase in security, contrary to what was initially believed.

cs.CR↗

arXiv2025

A new multivariate primitive from CCZ equivalence

Multivariate Cryptography is one of the candidates for Post-quantum Cryptography. Multivariate schemes are usually constructed by applying two secret affine invertible transformations $\mathcal S,\mathcal T$ to a set of multivariate polynomials $\mathcal{F}$ (often quadratic). The polynomials $\mathcal{F}$ possess a trapdoor that allows the legitimate user to find a solution of the corresponding system, while the public polynomials $\mathcal G=\mathcal S\circ\mathcal F\circ\mathcal T$ look like random polynomials. The polynomials $\mathcal G$ and $\mathcal F$ are said to be affine equivalent. In this article, we present a more general way of constructing a multivariate scheme by considering the CCZ equivalence, which has been introduced and studied in the context of vectorial Boolean functions.

cs.CR↗

arXiv2025

Quadratic Modelings of Syndrome Decoding

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 of the exact weight SDP. Additionally, we introduce a novel technique that transforms SDP instances over $\mathbb{F}_q$ into systems of polynomial equations and thoroughly investigate the dimension of their varieties. Experimental results are provided to evaluate the complexity of solving SDP instances using our models through Gröbner bases techniques.

cs.CR↗

arXiv2024

Simplices osculating rational normal curves

A classical result of von Staudt states that if eight planes osculate a twisted cubic curve and we divide them into two groups of four, then the eight vertices of the corresponding tetrahedra lie on a twisted cubic curve. In the current paper, we give an alternative proof of this result using modern tools, and at the same time we prove the analogous result for rational normal curves in any projective space. This higher dimensional generalization was claimed without proof in a paper of H.S. White in 1921.

math.AG↗

arXiv2024

Structure of CSS and CSS-T Quantum Codes

We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a CSS code with good correction capability, showing that such pairs are easy to produce with a randomized construction. We then prove that CSS-T codes exhibit the opposite behaviour, showing also that, under very natural assumptions, their rate and relative distance cannot be simultaneously large. This partially answers an open question on the feasible parameters of CSS-T codes. We conclude with a simple construction of CSS-T codes from Hermitian curves. The paper also offers a concise introduction to CSS and CSS-T codes from the point of view of classical coding theory.

cs.IT↗

arXiv2024

F-signature functions of diagonal hypersurfaces

Let $f$ be a diagonal hypersurface in $A_p=\mathbb{F}_p[[x_1,\dots,x_n]]$. We study the behavior of the function $ϕ_{f,p}({a}/{p^e})=p^{-ne}\dim_{\mathbb{F}_p}\big(A_p/(x_1^{p^e},\dots,x_n^{p^e},f^a)\big)$ which encodes information about the F-threshold, the Hilbert-Kunz, and the F-signature functions. We prove that when $p$ goes to infinity $ϕ_{f,p}$ converges to a piecewise polynomial function $ϕ_f$ and the left and right derivatives of $ϕ_{f,p}$ converge to $ϕ'_f$. We use this fact to prove the existence of the limit F-signature and limit Hilbert-Kunz multiplicity for diagonal hypersurfaces. When $f$ is a Fermat hypersurface, we investigate the shape of the F-signature function of $f$ and provide an explicit formula for the limit F-signature and, in some cases, also for the F-signature for fixed $p$. This allows us to answer negatively to a question of Watanabe and Yoshida.

math.AC↗

arXiv2023

Multidegrees, prime ideals, and non-standard gradings

We study several properties of multihomogeneous prime ideals. We show that the multigraded generic initial ideal of a prime has very special properties, for instance, its radical is Cohen-Macaulay. We develop a comprehensive study of multidegrees in arbitrary positive multigraded settings. In these environments, we extend the notion of Cartwright-Sturmfels ideals by means of a standardization technique. Furthermore, we recover or extend important results in the literature, for instance: we provide a multidegree version of Hartshorne's result stating the upper semicontinuity of arithmetic degree under flat degenerations, and we give an alternative proof of Brion's result regarding multiplicity-free varieties.

math.AC↗

arXiv2023

Determinantal varieties from point configurations on hypersurfaces

We consider the scheme $X_{r,d,n}$ parametrizing $n$ ordered points in projective space $\mathbb{P}^r$ that lie on a common hypersurface of degree $d$. We show that this scheme has a determinantal structure and we prove that it is irreducible, Cohen-Macaulay, and normal. Moreover, we give an algebraic and geometric description of the singular locus of $X_{r,d,n}$ in terms of Castelnuovo-Mumford regularity and $d$-normality. This yields a characterization of the singular locus of $X_{2,d,n}$ and $X_{3,2,n}$.

math.AG↗

arXiv2023

The complexity of solving Weil restriction systems

The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are obtained via Weil restriction of scalars. The latter is an arithmetic construction which, given a finite Galois field extension $k\hookrightarrow K$, associates to a system $\mathcal{F}$ defined over $K$ a system $\mathrm{Weil}(\mathcal{F})$ defined over $k$, in such a way that the solutions of $\mathcal{F}$ over $K$ and those of $\mathrm{Weil}(\mathcal{F})$ over $k$ are in natural bijection. In this paper, we find upper bounds for the complexity of solving a polynomial system $\mathrm{Weil}(\mathcal{F})$ obtained via Weil restriction in terms of algebraic invariants of the system $\mathcal{F}$.

cs.CR↗

arXiv2022

Solving multivariate polynomial systems and an invariant from commutative algebra

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate the solving degree of a system, focusing on systems arising within public-key cryptography. In particular, we show that it is upper bounded by, and often equal to, the Castelnuovo-Mumford regularity of the ideal generated by the homogenization of the equations of the system, or by the equations themselves in case they are homogeneous. We discuss the underlying commutative algebra and clarify under which assumptions the commonly used results hold. In particular, we discuss the assumption of being in generic coordinates (often required for bounds obtained following this type of approach) and prove that systems that contain the field equations or their fake Weil descent are in generic coordinates. We also compare the notion of solving degree with that of degree of regularity, which is commonly used in the literature. We complement the paper with some examples of bounds obtained following the strategy that we describe.

cs.CR↗

arXiv2022

Solving degree, last fall degree, and related invariants

In this paper we study and relate several invariants connected to the solving degree of a polynomial system. This provides a rigorous framework for estimating the complexity of solving a system of polynomial equations via Groebner bases methods. Our main results include a connection between the solving degree and the last fall degree and one between the degree of regularity and the Castelnuovo-Mumford regularity.

cs.CR↗

arXiv2022

The complexity of MinRank

In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case. Our main theorem recovers and extends previous results by Faugère, Safey El Din, Spaenlehauer (arXiv:1112.4411).

cs.SC↗

arXiv2021

A Pascal's Theorem for rational normal curves

Pascal's Theorem gives a synthetic geometric condition for six points $a,\ldots,f$ in $\mathbb{P}^2$ to lie on a conic. Namely, that the intersection points $\overline{ab}\cap\overline{de}$, $\overline{af}\cap\overline{dc}$, $\overline{ef}\cap\overline{bc}$ are aligned. One could ask an analogous question in higher dimension: is there a coordinate-free condition for $d+4$ points in $\mathbb{P}^d$ to lie on a degree $d$ rational normal curve? In this paper we find many of these conditions by writing in the Grassmann-Cayley algebra the defining equations of the parameter space of $d+4$ ordered points in $\mathbb{P}^d$ that lie on a rational normal curve. These equations were introduced and studied in a previous joint work of the authors with Giansiracusa and Moon. We conclude with an application in the case of seven points on a twisted cubic.

math.AG↗

arXiv2021

Isolated singularities with large class group

Let $d\geq3$ and $g\geq1$ be integers. Using a geometric construction involving the symmetric product of a projective curve, we exhibit a $d$-dimensional complete local normal domain over $\mathbb{C}$ with an isolated singularity such that its class group contains a copy of $(\mathbb{R}/\mathbb{Z})^{\oplus 2g}$ as subgroup.

math.AC↗