3 citations · 7 across the 11 of their papers we have counts for
13 papers
A new attack to RSA with small private exponent and partial information
Jorge Urroz
We give a new algorithm to attack RSA with small private exponent, when some partial information of is given.The algorithm is a very simple modification of original Wiener's…
The number of Sylow subgroups and a generalization of Mersenne primes
Jorge Jiménez Urroz, Alexander Moretó
Fix an integer bigger than 2. We prove that if there exists a finite group with Suylow -subgroups, where is large enough, then is prime. This improves on a…
An algebraic approach to Latin squares of prime power order by local permutation polynomials
Raúl M. Falcón, Jaime Gutiérrez, Jorge Jiménez Urroz
Every Latin square of prime power order is uniquely described by a local permutation polynomial (LPP) in the polynomial ring . Despite this equivalence, one…
Local permutation polynomials and the action of e-Klenian groups
Jaime Gutierrez, Jorge Jimenez Urroz
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 p…
A Study of the Separating Property in Reed-Solomon Codes by Bounding the Minimum Distance
Marcel Fernandez, Jorge Urroz
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 larg…
Every integer can be written as a square plus a squarefree
Jorge Urroz
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 numbe…