A more efficient untraceable e-cash system with partially blind signatures based on the discrete logarithm problem

1998 ◽  
pp. 296-308 ◽  
Author(s):  
Shingo Miyazaki ◽  
Kouichi Sakurai
Keyword(s):  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Blind Signatures

Comment: Cryptanalysis of the blind signatures based on the discrete logarithm problem

1995 ◽  
Vol 31 (21) ◽  
pp. 1827-1827 ◽  
Author(s):  
P. Horster ◽  
H. Petersen ◽  
M. Michels
Keyword(s):  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Blind Signatures

scholarly journals On the first fall degree of summation polynomials

2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers
Keyword(s):  
Elliptic Curve ◽  
Gröbner Basis ◽  
Discrete Logarithm ◽  
Polynomial Systems ◽  
Discrete Logarithm Problem ◽  
Grobner Basis ◽  
Weil Descent ◽  
Degree Bound

Abstract We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.

Sign in / Sign up

Export Citation Format

Share Document