3 papers
cs.CR2023
The special case of cyclotomic fields in quantum algorithms for unit groups
Razvan Barbulescu, Adrien Poulalion
Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is . In this work we propose a mo…
cs.CR2023
ECM And The Elliott-Halberstam Conjecture For Quadratic Fields
Razvan Barbulescu, Florent Jouve
The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tack…
cs.CR2013
Selecting polynomials for the Function Field Sieve
Razvan Barbulescu
The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select…