论文标题
解决椭圆曲线离散对数问题的新方法
A new method for solving the elliptic curve discrete logarithm problem
论文作者
论文摘要
椭圆曲线离散对数问题被认为是安全的加密原始。本文的目的是在攻击椭圆曲线离散对数问题时提出范式转移。在本文中，我们将争辩说，最初的未成年人是解决此问题的可行方法。本文将为此攻击提供必要的算法。我们编写了一个代码，以使用Schur补充来验证初始未成年人的猜想。我们能够解决最高$ 2^{50} $的订单组的问题。
The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic curve discrete logarithm problem. In this paper, we will argue that initial minors are a viable way to solve this problem. This paper will present necessary algorithms for this attack. We have written a code to verify the conjecture of initial minors using Schur complements. We were able to solve the problem for groups of order up to $2^{50}$.
