scholarly journals Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm

2017 ◽  
Vol 11 (3) ◽  
pp. 453-469 ◽  
Author(s):  
Steven D. Galbraith ◽  
◽  
Ping Wang ◽  
Fangguo Zhang ◽  
◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Discrete Logarithms ◽  
Giant Step ◽  
Step Algorithm

Improvements to Shank`s Baby-step Giant-step Algorithm

2005 ◽  
Vol 6 (1) ◽  
pp. 76-79 ◽  
Author(s):  
Kaqish Malek
Keyword(s):  
Giant Step ◽  
Step Algorithm

scholarly journals Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms

2017 ◽  
pp. 241-270 ◽  
Author(s):  
Martin Roetteler ◽  
Michael Naehrig ◽  
Krysta M. Svore ◽  
Kristin Lauter
Keyword(s):  
Elliptic Curve ◽  
Discrete Logarithms

Attacks on Self-Certified Multi-Proxy Signature Schemes with Message Recovery

2011 ◽  
Vol 135-136 ◽  
pp. 316-320
Author(s):  
Qi Xie
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
Proxy Signature ◽  
Public Key ◽  
Signature Verification ◽  
Signature Schemes ◽  
Discrete Logarithms ◽  
The Public ◽  
Message Recovery ◽  
Public Keys

Signature schemes with message recovery based on self-certified public keys can reduce the amount of communications and computations, since the signature verification, the public key authentication and the message recovery are simultaneously carried out in a single logical step. Integrating self-certified public-key systems and the message recovery signature schemes, in 2009, Wu et al. proposed two multi-proxy signatures based on the discrete logarithms over a finite field and the elliptic curve discrete logarithms. The proxy warrant revision attacks are proposed, and it will show that Wu et al.’s schemes can not resist the proxy warrant revision attacks by either the proxy group or the original signer.

Sign in / Sign up

Export Citation Format

Share Document