Diophantine approximations with a constant right-hand side of inequalities on short intervals. 1

The problem of finding the Lebesgue measure 𝛍 of the set B1 of the coverings of the solutions of the inequality, ⎸Px⎹ <Q−w, w>n , Q ∈ N and Q >1, in integer polynomials P (x) of degree, which doesn’t exceed n and the height H (P) ≤ Q , is one of the main problems in the metric theory of the Diophantine approximation. We have obtained a new bound 𝛍B1 <c(n)Q−w+n, n<w<n+1, that is the most powerful to date. Even an ineffective version of this bound allowed V. G. Sprindzuk to solve Mahler’s famous problem.

Diophantine approximation with the constant right-hand side of inequalities on short intervals

In the metric theory of Diophantine approximations, one of the main problems leading to exact characteristics in the classifications of Mahler and Koksma is to estimate the Lebesgue measure of the points x ∈ B ⊂ I from the interval I such as the inequality | P (x) | < Q-w, w > n, Q >1 for the polynomials P(x) ∈ Z[x], deg P ≤ n, H(P) ≤Q is satisfied. The methods of obtaining estimates are different at different intervals of w change. In this article, at w > n +1 we get the estimate µ B< c1(n) Q – (w-1/n). The best estimate to date was c2(n) Q –(w- n/n).

Exploiting the security of N = prqs through approximation of ϕ(N)

This paper reports new techniques that exploit the security of the prime power moduli [Formula: see text] using continued fraction method. Our study shows that the key equation [Formula: see text] can be exploited using [Formula: see text] as good approximation of [Formula: see text]. This enables us to get [Formula: see text] from the convergents of the continued fractions expansion of [Formula: see text] where the bound of the private exponent is [Formula: see text] which leads to the polynomial time factorization of the moduli [Formula: see text]. We further report the polynomial time attacks that can break the security of the generalized prime power moduli [Formula: see text] using generalized system of equation of the form [Formula: see text] and [Formula: see text] by applying simultaneous Diophantine approximations and LLL algorithm techniques where [Formula: see text] and [Formula: see text].

Lyapunov exponent of random dynamical systems on the circle

We consider products of an independent and identically distributed sequence in a set $\{f_1,\ldots ,f_m\}$ of orientation-preserving diffeomorphisms of the circle. We can naturally associate a Lyapunov exponent $\lambda $ . Under few assumptions, it is known that $\lambda \leq 0$ and that the equality holds if and only if $f_1,\ldots ,f_m$ are simultaneously conjugated to rotations. In this paper, we state a quantitative version of this fact in the case where $f_1,\ldots ,f_m$ are $C^k$ perturbations of rotations with rotation numbers $\rho (f_1),\ldots ,\rho (f_m)$ satisfying a simultaneous diophantine condition in the sense of Moser [On commuting circle mappings and simultaneous diophantine approximations. Math. Z.205(1) (1990), 105–121]: we give a precise estimate of $\lambda $ (Taylor expansion) and we prove that there exist a diffeomorphism g and rotations $r_i$ such that $\mbox {dist}(gf_ig^{-1},r_i)\ll |\lambda |^{{1}/{2}}$ for $i=1,\ldots , m$ . We also state analogous results for random products of $2\times 2$ matrices, without any diophantine condition.

Quasiperiodic Patterns of the Complex Dimensions of Nonlattice Self-Similar Strings, via the LLL Algorithm

The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a lattice self-similar fractal string. The implication of this procedure is that the set of complex dimensions of a nonlattice string has a quasiperiodic pattern. Using the LSA algorithm, together with the multiprecision polynomial solver MPSolve which is due to D. A. Bini, G. Fiorentino and L. Robol, we give a new and significantly more powerful presentation of the quasiperiodic patterns of the sets of complex dimensions of nonlattice self-similar fractal strings. The implementation of this algorithm requires a practical method for generating simultaneous Diophantine approximations, which in some cases we can accomplish by the continued fraction process. Otherwise, as was suggested by Lapidus and van Frankenhuijsen, we use the LLL algorithm of A. K. Lenstra, H. W. Lenstra, and L. Lovász.

Strategic Way of Factoring Modulus ``\(N = p^r q\)

Cryptography is fundamental to the provision of a wider notion of information security. Electronic information can easily be transmitted and stored in relatively insecure environments. This research was present to factor the prime power modulus \(N = p^r q\) for \(r \geq 2\) using the RSA key equation, if \(\frac{y}{x}\) is a convergents of the continued fractions expansions of \(\frac{e}{N - \left(2^{\frac{2r+1}{r+1}} N^{\frac{r}{r+1}} - 2^{\frac{r-1}{r+1}} N^{\frac{r-1}{r+1}}\right)}\). We furthered our analysis on \(n\) prime power moduli \(N_i = p_i^r q_i\) by transforming the generalized key equations into Simultaneous Diophantine approximations and using the LLL algorithm on \(n\) prime power public keys \((N_i,e_i)\) we were able to factorize the \(n\) prime power moduli \(N_i = p_i^r q_i\), for \(i = 1,....,n\) simultaneously in polynomial time.

On the size of Diophantine m-tuples in imaginary quadratic number rings

A Diophantine [Formula: see text]-tuple is a set of [Formula: see text] distinct integers such that the product of any two distinct elements plus one is a perfect square. It was recently proven that there is no Diophantine quintuple in positive integers. We study the same problem in the rings of integers of imaginary quadratic fields. By using a gap principle proven by Diophantine approximations, we show that [Formula: see text]. Our proof is relatively simple compared to the proofs of similar results in positive integers.