1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CR2024
Computing for an RSA module with a single quantum query
Luis Víctor Dieulefait, Jorge Urróz
In this paper we give a polynomial time algorithm to compute for an RSA module using as input the order modulo of a randomly chosen integer. This provides a new insi…
math.NT2014★ 1 cited
Classification of subgroups of symplectic groups over finite fields containing a transvection
Sara Arias-de-Reyna, Luis Dieulefait, Gabor Wiese
In this note we give a self-contained proof of the following classification (up to conjugation) of subgroups of the general symplectic group of dimension n over a finite field of c…