ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2405.14381
  4. Cited By
A high-level comparison of state-of-the-art quantum algorithms for
  breaking asymmetric cryptography

A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography

23 May 2024
Martin Ekerå
Joel Gärtner
ArXivPDFHTML

Papers citing "A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography"

2 / 2 papers shown
Title
Extending Regev's factoring algorithm to compute discrete logarithms
Extending Regev's factoring algorithm to compute discrete logarithms
Martin Ekerå
Joel Gärtner
37
16
0
09 Nov 2023
Quantum Complexity for Discrete Logarithms and Related Problems
Quantum Complexity for Discrete Logarithms and Related Problems
Minki Hhan
Takashi Yamakawa
Aaram Yun
31
7
0
06 Jul 2023
1