HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

(Non)practicabilité de l'algorithme classique-quantique de factorisation des entiers

Razvan Barbulescu 1
1 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : Recent developments in the quantum computer technology raised the question of a space-time tradeoff for integer factorization, where space is the number of qubits. We study the question of a concrete factorization with NFS, the best classical algorithm, of a 1024-bit integer under the hypothesis that the factorization of integers up to 150 bits takes a negligible time.
Document type :
Reports
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03483274
Contributor : Razvan Barbulescu Connect in order to contact the contributor
Submitted on : Thursday, December 16, 2021 - 1:57:34 PM
Last modification on : Friday, January 21, 2022 - 3:10:42 AM

Identifiers

  • HAL Id : hal-03483274, version 1

Collections

Citation

Razvan Barbulescu. (Non)practicabilité de l'algorithme classique-quantique de factorisation des entiers. [Rapport Technique] Institut de mathématiques de Bordeaux. 2021. ⟨hal-03483274⟩

Share

Metrics

Record views

26

Files downloads

23