求解椭圆曲线离散对数问题的一种新方法

IF 0.1 Q4 MATHEMATICS

Groups Complexity Cryptology Pub Date : 2020-05-11 DOI:10.46298/jgcc.2020.12.2.6649

Ansari Abdullah, A. Mahalanobis, V. Mallick

{"title":"求解椭圆曲线离散对数问题的一种新方法","authors":"Ansari Abdullah, A. Mahalanobis, V. Mallick","doi":"10.46298/jgcc.2020.12.2.6649","DOIUrl":null,"url":null,"abstract":"The elliptic curve discrete logarithm problem is considered a secure\ncryptographic primitive. The purpose of this paper is to propose a paradigm\nshift in attacking the elliptic curve discrete logarithm problem. In this\npaper, we will argue that initial minors are a viable way to solve this\nproblem. This paper will present necessary algorithms for this attack. We have\nwritten a code to verify the conjecture of initial minors using Schur\ncomplements. We were able to solve the problem for groups of order up to\n$2^{50}$.\nComment: 13 pages; revised for publication","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"9 1","pages":""},"PeriodicalIF":0.1000,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A new method for solving the elliptic curve discrete logarithm problem\",\"authors\":\"Ansari Abdullah, A. Mahalanobis, V. Mallick\",\"doi\":\"10.46298/jgcc.2020.12.2.6649\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The elliptic curve discrete logarithm problem is considered a secure\\ncryptographic primitive. The purpose of this paper is to propose a paradigm\\nshift in attacking the elliptic curve discrete logarithm problem. In this\\npaper, we will argue that initial minors are a viable way to solve this\\nproblem. This paper will present necessary algorithms for this attack. We have\\nwritten a code to verify the conjecture of initial minors using Schur\\ncomplements. We were able to solve the problem for groups of order up to\\n$2^{50}$.\\nComment: 13 pages; revised for publication\",\"PeriodicalId\":41862,\"journal\":{\"name\":\"Groups Complexity Cryptology\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2020-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/jgcc.2020.12.2.6649\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/jgcc.2020.12.2.6649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 4

摘要

椭圆曲线离散对数问题被认为是一个安全密码原语。本文的目的是提出一种解决椭圆曲线离散对数问题的范式转换。在本文中，我们将论证初始未成年人是解决这一问题的可行方法。本文将给出这种攻击的必要算法。我们编写了一个代码来验证使用schur补语的初始次元猜想。我们能够求解到$2^{50}$的组的问题。评论:13页;修订后出版

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new method for solving the elliptic curve discrete logarithm problem

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}$. Comment: 13 pages; revised for publication

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Groups Complexity Cryptology MATHEMATICS-

CiteScore

1.10

自引率

0.00%

发文量