Hybrid Continued Fractions and n-adic algorithms, with applications to cryptography and "unimaginable' numbers

03/07/2019
by   Antonino Leonardis, et al.
0

This paper continues the author's previous studies on continued fractions and Heron's algorithm, as from his former JMM2017 presentation (see CF.HA). Extending the notion of continued fraction to the p-adic fields, one can find continued fractions which converge in both real and p-adic topologies to the `same' quadratic irrational number, some of which are given by the Heron's algorithm using a generalized version of an author's theorem from the cited JMM presentation. The definition can be possibly generalized to other global fields, as left as an open question. We will end the part on hybrid convergence with many numerical examples. After that, we will recall the basic algorithms on the p-adic fields studied by the author and see some applications of theirs to computer science: applying Heron's algorithm to quickly compute p-adic square roots, finding new elementary cryptography procedures and some methods to get pseudo-random numbers, calculate last digits of some peculiar very big numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2020

Product Subset Problem : Applications to number theory and cryptography

We consider applications of Subset Product Problem (SPP) in number theor...
research
11/10/2020

Strong Law of Large Numbers for Functionals of Random Fields With Unboundedly Increasing Covariances

The paper proves the Strong Law of Large Numbers for integral functional...
research
06/15/2018

Homonym Detection in Curated Bibliographies: Learning from dblp's Experience (full version)

Identifying (and fixing) homonymous and synonymous author profiles is on...
research
10/01/2018

Stronger Cryptography For Every Device, Everywhere

Generating secure random numbers is a central problem in cryptography th...
research
05/11/2023

On the Eight Levels theorem and applications towards Lucas-Lehmer primality test for Mersenne primes, I

Lucas-Lehmer test is the current standard algorithm used for testing the...
research
11/04/2021

An Empirical Comparison of the Quadratic Sieve Factoring Algorithm and the Pollard Rho Factoring Algorithm

One of the most significant challenges on cryptography today is the prob...
research
08/09/2019

A localized version of the basic triangle theorem

In this short note, we give a localized version of the basic triangle th...

Please sign up or login with your details

Forgot password? Click here to reset