Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Urroz, Jorge"'
Autor:
Dieulefait, Luis Víctor, Urróz, Jorge
In this paper we give a polynomial time algorithm to compute $\varphi(N)$ for an RSA module $N$ using as input the order modulo $N$ of a randomly chosen integer. The algorithm consists only on a computation of a greatest common divisor, two multiplic
Externí odkaz:
http://arxiv.org/abs/2406.04061
Autor:
Gutierrez, Jaime, Urroz, Jorge Jimenez
Let $F_q$ be the finite field with $q$ elements and $F_q[x_1,\ldots, x_n]$ the ring of polynomials in $n$ variables over $F_q$. In this paper we consider permutation polynomials and local permutation polynomials over $F_q[x_1,\ldots, x_n]$, which def
Externí odkaz:
http://arxiv.org/abs/2308.01258
Autor:
Urroz, Jorge Jimenez, Pomykala, Jacek
In the present paper we provide a probabilistic polynomial time algorithm that reduces the complete factorization of any squarefree integer $n$ to counting points on elliptic curves modulo $n$, succeeding with probability $1-\varepsilon$, for any $\v
Externí odkaz:
http://arxiv.org/abs/2210.04835
Autor:
Gutierrez, Jaime, Urroz, Jorge Jimenez
Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric subgroups without
Externí odkaz:
http://arxiv.org/abs/2205.00151
Motivated by a model in quantum computation we study orthogonal sets of integral vectors of the same norm that can be extended with new vectors keeping the norm and the orthogonality. Our approach involves some arithmetic properties of the quaternion
Externí odkaz:
http://arxiv.org/abs/2203.10635
Autor:
Fernandez, Marcel, Urroz, Jorge
According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that if the minimum distance of the code is larger than a certain threshold then the TA property implies the rest. Sil
Externí odkaz:
http://arxiv.org/abs/2103.02341
We estimate the number of primes represented by a general quadratic polynomial with discriminant $\Delta$, assuming that the corresponding real character is exceptional.
Comment: 8 pages
Comment: 8 pages
Externí odkaz:
http://arxiv.org/abs/2011.05398
Autor:
Urroz, Jorge
In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result is deeply
Externí odkaz:
http://arxiv.org/abs/2010.15580
Autor:
Gutierrez, Jaime, Jiménez Urroz, Jorge
Publikováno v:
In Finite Fields and Their Applications October 2023 91
Autor:
Dieulefait, Luis, Urroz, Jorge
In this paper we address two different problems related with the factorization of an RSA module N. First we can show that factoring is equivalent in deterministic polynomial time to counting points on a pair of twisted Elliptic curves modulo N. Also
Externí odkaz:
http://arxiv.org/abs/1911.11004