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$$ . 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$$ that have a periodic expansion with period of length 4, solving an open problem left by Browkin in (Math Comput 70:1281–1292, 2000).
Continued fractions have been introduced in the field of p-adic numbers $$\mathbb {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}$$ . In particular, an analogue of the Lagrange’s Theorem is not yet proved for any attempt of generalizing continued fractions in $$\mathbb {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$$ of the continued fractions. In this paper we study some convergence conditions for continued fractions in $$\mathbb {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.
Blockchain-based platforms utilise cryptographic protocols to enforce the correct behaviour of users, as well as to guarantee a sufficient level of protection against malicious adversaries. Cryptography is, however, an ever-evolving discipline, and any breakthrough would have immediate consequences on the security of blockchain-based applications. A possible threat currently under investigation is given by the development of quantum computers, since several wide-adopted cryptographic protocols have been proved to be unsafe against quantum-capable adversaries. In this work, we propose a novel approach for the management of cryptographic primitives in smart-contract-based ledgers, discussing how it fits in both a (partially) permissioned and a fully permissionless setting. The cryptographic protocols are managed in a flexible manner via a set of smart-contracts defined on the ledger itself, in this way the choice of algorithms and parameters can change quickly. Among the advantages of this approach, we remark how it allows designing an adaptive post-quantum-based blockchain that keeps up with ongoing technological advances. In general, the introduction of new features and the application of fixes to a blockchain cause forks in the chain, which may cause major disruptions. The use of smart contracts in blockchain management allows to avoid this problem, dynamically introducing new protocols or deprecating old ones without compromising previous data. The Cryptographic Kernel approach has been adopted by Quadrans, an open-source, public, decentralised smart-contract-based blockchain with a specific focus on the needs of industry, complex supply chains, and IOT devices.
We describe first-degree prime ideals of biquadratic extensions in terms of the first-degree prime ideals of two underlying quadratic fields. The identification of the prime divisors is given by numerical conditions involving their ideal norms. The correspondence between these ideals in the larger ring and those in the smaller ones extends to the divisibility of specially-shaped principal ideals in their respective rings, with some exceptions that we explicitly characterize.
We describe first-degree prime ideals of biquadratic extensions in terms of first-degree prime ideals of two underlying quadratic fields. The identification of the prime divisors is given by numerical conditions involving their ideal norms. Interestingly, the correspondence between these ideals in the larger ring and those in the smaller ones extends to the divisibility of principal ideals in their respective rings, with some exceptions that we explicitly provide. Finally, we hint at possible applications of this correspondence.