Research on Attacking a Special Elliptic Curve Discrete Logarithm Problem

Jiang Weng, Yunqi Dou and Chuangui Ma

Mathematical Problems in Engineering, 2016, vol. 2016, 1-8

Abstract:

Cheon first proposed a novel algorithm for solving discrete logarithm problem with auxiliary inputs. Given some points , an attacker can solve the secret key efficiently. In this paper, we propose a new algorithm to solve another form of elliptic curve discrete logarithm problem with auxiliary inputs. We show that if some points and a multiplicative cyclic group are given, where is a prime, is the order of . The secret key can be solved in group operations by using storage.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2016/5361695.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2016/5361695.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5361695

DOI: 10.1155/2016/5361695

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().