Convertible multi-authenticated encryption scheme with verification based on elliptic curve discrete logarithm problem

Author(s):  
Nedal Tahat
2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers

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