2018
DOI: 10.1080/09720529.2017.1390845
|View full text |Cite
|
Sign up to set email alerts
|

Cryptanalysis and improvement of a ECDLP based proxy blind signature scheme

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Security of ECDL problem lies on its hardness and is deemed as the foundation stone for security of the algorithm. If the attacker is successful in obtaining both n and n × m, he must now determine the value of m which is a challenging task (Chande, Lee, & Li, 2018).…”
Section: Elliptic Curve Cryptographymentioning
confidence: 99%
“…Security of ECDL problem lies on its hardness and is deemed as the foundation stone for security of the algorithm. If the attacker is successful in obtaining both n and n × m, he must now determine the value of m which is a challenging task (Chande, Lee, & Li, 2018).…”
Section: Elliptic Curve Cryptographymentioning
confidence: 99%
“…Lemma 1. (Elliptic Curves Discrete Log Problem (ECDLP)) [29,30]: Given the discrete log problem of fixed points G ∈ E p (a, b) and P = KG ∈ E p (a, b), it is very hard to calculate k ∈ Z * q .…”
Section: Eccmentioning
confidence: 99%
“…Definition 2 (Elliptic Curve Discrete Logarithm Problem) [38]: Let P and Q be two points of order n on the elliptic curve, and n is a prime number. When k < n, point Q = k ×P.…”
Section: Preliminaries a Elliptic Curve And Its Problemmentioning
confidence: 99%