QCAP: A Bitcoin-Native Quantum Canary Alert

The inquiry in the email explores the effectiveness and nuances of quantum computing algorithms, specifically Shor's algorithm, in solving discrete logarithm problems across different scenarios. It is highlighted that a variant of Shor's algorithm can potentially solve discrete logs more efficiently when the logs are smaller within a given group. This is supported by research provided in a 2016 paper, which discusses an adaptation of the Shor algorithm that targets shorter discrete logarithms, specifically those less than the square root of the curve order.

Further discussion in the email addresses whether this efficiency in solving smaller discrete logs translates similarly when applied to larger curves, essentially questioning if the problem scales proportionally with curve size or if unique challenges arise. The sender mentions subsequent studies that expand on the initial findings, suggesting that while the core methodology of using quantum algorithms like Shor's for smaller discrete logs is retained, the application to varying sizes of discrete logs beyond the initial scope (i.e., not just half as short but covering larger bit lengths) may have been explored.

Moreover, there's an exploration of whether solving a discrete log problem of a specific size is equivalent across different cryptographic curves, such as comparing a 192-bit secret on secp curves versus secp192r1. The sender speculates that although the solutions might be very similar due to the mathematical properties shared by these scenarios, they are not exactly the same. This differentiation could influence the choice of algorithms or methods like DLEQAG versus simpler range proofs for verifying the size of secrets, with the sender expressing skepticism about the additional value provided by DLEQAG in this context.

In summary, the email reflects an ongoing investigation into the adaptability and efficiency of quantum algorithms in cryptographic applications, particularly how these algorithms manage smaller discrete logs and their behavior across different cryptographic curves. The discussion points towards a nuanced understanding that while foundational principles may remain consistent, specific applications could require tailored approaches depending on the characteristics of the problem at hand.