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. 2307.03065
  4. Cited By
Quantum Complexity for Discrete Logarithms and Related Problems

Quantum Complexity for Discrete Logarithms and Related Problems

6 July 2023
Minki Hhan
Takashi Yamakawa
Aaram Yun
ArXivPDFHTML

Papers citing "Quantum Complexity for Discrete Logarithms and Related Problems"

4 / 4 papers shown
Title
Does quantum lattice sieving require quantum RAM?
Does quantum lattice sieving require quantum RAM?
Beomgeun Cho
Minki Hhan
Taehyun Kim
Jeonghoon Lee
Yixin Shen
23
1
0
21 Oct 2024
A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum
  Factoring, and More
A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More
Minki Hhan
21
1
0
17 Feb 2024
Extending Regev's factoring algorithm to compute discrete logarithms
Extending Regev's factoring algorithm to compute discrete logarithms
Martin Ekerå
Joel Gärtner
26
16
0
09 Nov 2023
Quantum Money from Abelian Group Actions
Quantum Money from Abelian Group Actions
Mark Zhandry
33
6
0
22 Jul 2023
1