ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2006.06197
  4. Cited By
Comparing the difficulty of factorization and discrete logarithm: a
  240-digit experiment

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

IACR Cryptology ePrint Archive (IACR ePrint), 2020
11 June 2020
Fabrice Boudot
P. Gaudry
Aurore Guillevic
N. Heninger
Emmanuel Thomé
P. Zimmermann
    CoGeLRM
ArXiv (abs)PDFHTML

Papers citing "Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment"

9 / 9 papers shown
Prime Factorization Equation from a Tensor Network Perspective
Prime Factorization Equation from a Tensor Network Perspective
Alejandro Mata Ali
Jorge Martínez Martín
Sergio Muñiz Subiñas
Miguel Franco Hernando
Javier Sedano
Ángel Miguel García-Vico
154
0
0
29 Jul 2025
An Efficient All-to-All GCD Algorithm for Low Entropy RSA Key
  Factorization
An Efficient All-to-All GCD Algorithm for Low Entropy RSA Key FactorizationIACR Cryptology ePrint Archive (IACR ePrint), 2024
Elijah Pelofske
77
0
0
06 May 2024
Security Analysis of Pairing-based Cryptography
Security Analysis of Pairing-based Cryptography
Xiaofeng Wang
Peng Zheng
Qianqian Xing
98
3
0
09 Sep 2023
Experimental quantum e-commerce
Experimental quantum e-commerceScience Advances (Sci Adv), 2023
Xiao-Yu Cao
Bing-Hong Li
Yang Wang
Yao Fu
Hua‐Lei Yin
Zeng-Bing Chen
188
57
0
17 Aug 2023
Pitfalls of the sublinear QAOA-based factorization algorithm
Pitfalls of the sublinear QAOA-based factorization algorithmIEEE Access (IEEE Access), 2023
Sergey V. Grebnev
M. A. Gavreev
E. Kiktenko
Anton Guglya
Albert R. Efimov
Aleksey K. Fedorov
288
9
0
08 Mar 2023
One-Time Universal Hashing Quantum Digital Signatures without Perfect
  Keys
One-Time Universal Hashing Quantum Digital Signatures without Perfect KeysPhysical Review Applied (Phys. Rev. Appl.), 2023
Bing-Hong Li
Yuan-Mei Xie
Xiao-Yu Cao
Chen-Long Li
Yao Fu
Hua‐Lei Yin
Zenghu Chen
373
28
0
03 Jan 2023
Authentication of quantum key distribution with post-quantum
  cryptography and replay attacks
Authentication of quantum key distribution with post-quantum cryptography and replay attacks
Liu-Jun Wang
You Zhou
Jianfeng Yin
Qing Chen
54
7
0
02 Jun 2022
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve
Aude Le Gluher
P. Spaenlehauer
Emmanuel Thomé
127
2
0
06 Jul 2020
Factoring semi-primes with (quantum) SAT-solvers
Factoring semi-primes with (quantum) SAT-solvers
M. Mosca
Sebastian R. Verschoor
LRM
202
20
0
04 Feb 2019
1
Page 1 of 1