Giuliano Romeo

Dr. Giuliano Romeo


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2023 in Annali di Matematica Pura ed Applicata (1923 -)
Verified
Journal Article
Open access
PDF file
NMNadir Murru
Nadir Murru
GRGiuliano Romeo
Giuliano Romeo
GSGiordano Santilli
Giordano Santilli
In this paper we study the properties of an algorithm, introduced in Browkin (Math Comput 70:1281–1292, 2000), for generating continued fractions in the field of p-adic numbers $$\mathbb Q_p$$ Q p . First of all, we obtain an analogue of the Galois’ Theorem for classical continued fractions. Then, we investigate the length of the preperiod for periodic expansions of square roots. Finally, we prove that there exist infinitely many square roots of integers in $$\mathbb Q_p$$ Q p that have a periodic expansion with period of length 4, solving an open problem left by Browkin in (Math Comput 70:1281–1292, 2000).

16 February 2024 in Bulletin of the American Mathematical Society
Verified
Journal Article
Closed access
PDF file
GRGiuliano Romeo
Giuliano Romeo
Continued fractions have a long history in number theory, especially in the area of Diophantine approximation. The aim of this expository paper is to survey the main results on the theory of p p -adic continued fractions, i.e., continued fractions defined over the field of p p -adic numbers Q p \mathbb {Q}_p , which in the last years has recorded a considerable increase of interest and research activity. We start from the very first definitions up to the most recent developments and open problems.

31 August 2023 in Research in Number Theory
Verified
Journal Article
Open access
PDF file
NMNadir Murru
Nadir Murru
GRGiuliano Romeo
Giuliano Romeo
GSGiordano Santilli
Giordano Santilli
Continued fractions have been introduced in the field of p-adic numbers $$\mathbb {Q}_p$$ Q p by several authors. However, a standard definition is still missing since all the proposed algorithms are not able to replicate all the properties of continued fractions in $$\mathbb {R}$$ R . In particular, an analogue of the Lagrange’s Theorem is not yet proved for any attempt of generalizing continued fractions in $$\mathbb {Q}_p$$ Q p . Thus, it is worth to study the definition of new algorithms for p-adic continued fractions. The main condition that a new method needs to fulfill is the convergence in $$\mathbb {Q}_p$$ Q p of the continued fractions. In this paper we study some convergence conditions for continued fractions in $$\mathbb {Q}_p$$ Q p . These results allow to define many new families of continued fractions whose convergence is guaranteed. Then we provide some new algorithms exploiting the new convergence condition and we prove that one of them terminates in a finite number of steps when the input is rational, as it happens for real continued fractions.

21 July 2023 in Mathematics of Computation
Verified
Journal Article
Closed access
PDF file
NMNadir Murru
Nadir Murru
GRGiuliano Romeo
Giuliano Romeo
Continued fractions in the field of p p -adic numbers have been recently studied by several authors. It is known that the real continued fraction of a positive quadratic irrational is eventually periodic (Lagrange’s Theorem). It is still not known if a p p -adic continued fraction algorithm exists that shares a similar property. In this paper we modify and improve one of Browkin’s algorithms. This algorithm is considered one of the best at the present time. Our new algorithm shows better properties of periodicity. We show for the square root of integers that if our algorithm produces a periodic expansion, then this periodic expansion will have pre-period one. It appears experimentally that our algorithm produces more periodic continued fractions for quadratic irrationals than Browkin’s algorithm. Hence, it is closer to an algorithm to which an analogue of Lagrange’s Theorem would apply.

3 August 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
ASAntonio J. Di Scala
Antonio J. Di Scala
AGAndrea Gangemi
Andrea Gangemi
GRGiuliano Romeo
Giuliano Romeo
GVGabriele Vernetti
Gabriele Vernetti
In 2020, Sala, Sogiorno and Taufer were able to find the private keys of some Bitcoin addresses, thus being able to spend the cryptocurrency linked to them. This was unexpected since the recovery of non-trivial private keys for blockchain addresses is deemed to be an infeasible problem. In this paper, we widen this analysis by mounting a similar attack on other small subsets of the set of private keys. We then apply it to other blockchains as well, examining Ethereum, Dogecoin, Litecoin, Dash, Zcash and Bitcoin Cash. In addition to the results, we also explain the techniques we have used to perform this exhaustive search for all the addresses that have ever appeared in these blockchains, and we give an estimate of the time needed to perform all the computations. Finally, we also examine the possibility of mounting a similar attack on other elliptic curves used in blockchains, i.e., Curve25519 and NIST P-256.

12 May 2025 in arXiv
Verified
Preprint
Open access
PDF file
PMPiotr Miska
Piotr Miska
NMNadir Murru
Nadir Murru
GRGiuliano Romeo
Giuliano Romeo
The problem of developing an arithmetic for continued fractions (in order to perform, e.g., sums and products) does not have a straightforward solution and has been addressed by several authors. In 1972, Gosper provided an algorithm to solve this problem. In this paper, we extend this approach in order to develop an arithmetic for multidimensional continued fractions (MCFs). First, we define the Möbius transform of an MCF and we provide an algorithm to obtain its expansion. Similarly, we deal with the bilinear transformation of MCFs, which covers as a special case the problem of summing or multiplying two MCFs. Finally, some experiments are performed in order to study the behavior of the algorithms.