Search arXivSearch

arXiv subjects

Matilda Urani

Publications and source records attributed to Matilda Urani.

2 recordsLinked to original sources

Periodicity and Period-Length Bounds for Browkin $p$-Adic Continued Fractions

Continued fractions have been introduced and studied in the field of $p$--adic numbers by several authors, with the aim of developing analogues of the classical theory of real continued fractions. In this paper, we focus on Browkin's continued fraction algorithm, for which several fundamental questions remain open, especially concerning periodic expansions of quadratic irrationals. In this paper, we solve a conjecture about periodicity left open in [6]. As a consequence, we prove that, for every positive integer $t$, there exist infinitely many square roots of integers whose Browkin continued fraction expansion is periodic with period length $2t$. This also settles a problem originating from previous classical results on the possible period lengths of square roots of integers. Moreover, we provide new sufficient conditions for the periodicity of quadratic irrationals and derive explicit bounds for the corresponding period lengths. These results also restrict the possible behaviour of a quadratic irrational whose Browkin continued fraction expansion is non-periodic, and therefore provide new tools for investigating whether an analogue of Lagrange's theorem can hold. Finally, we also provide a computational study of the Browkin expansions of quadratic irrationals, with particular attention to the behaviour of square roots of integers and to the search for possible non-periodic examples.

math.NT

Accurate BGV Parameters Selection: Accounting for Secret and Public Key Dependencies in Average-Case Analysis

The Brakerski-Gentry-Vaikuntanathan (BGV) scheme is one of the most significant fully homomorphic encryption (FHE) schemes. It belongs to a class of FHE schemes whose security is based on the presumed intractability of the Learning with Errors (LWE) problem and its ring variant (RLWE). Such schemes deal with a quantity, called noise, which increases each time a homomorphic operation is performed. Specifically, in order for the scheme to work properly, it is essential that the noise remains below a certain threshold throughout the process. For BGV, this threshold strictly depends on the ciphertext modulus, which is one of the initial parameters whose selection heavily affects both the efficiency and security of the scheme. For an optimal parameter choice, it is crucial to accurately estimate the noise growth, particularly that arising from multiplication, which is the most complex operation. In this work, we propose a novel average-case approach that precisely models noise evolution and guides the selection of initial parameters, improving efficiency while ensuring security. The key innovation of our method lies in accounting for the dependencies among ciphertext errors generated with the same key, and in providing general guidelines for accurate parameter selection that are library-independent.

cs.CR