Results 41 to 50 of about 7,844 (165)
On the first fall degree of summation polynomials
Journal of Mathematical Cryptology, 2019 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.
Kousidis Stavros, Wiemers Andreas
doaj +1 more source
Survey on SAP and its application in public-key cryptography
Journal of Mathematical Cryptology, 2020 The concept of the semigroup action problem (SAP) was first introduced by Monico in 2002. Monico explained in his paper that the discrete logarithm problem (DLP) can be generalized to SAP. After defining the action problem in a semigroup, the concept was
Goel Neha, Gupta Indivar, Dass B. K.
doaj +1 more source
Journal of Mathematical Cryptology, 2018 In 2004, Muzereau, Smart and Vercauteren [A. Muzereau, N. P. Smart and F. Vercauteren, The equivalence between the DHP and DLP for elliptic curves used in practical applications, LMS J. Comput. Math. 7 2004, 50–72] showed how to use a reduction algorithm
Kushwaha Prabhat
doaj +1 more source
Blind Proxy Re-Signature Scheme Based on Isomorphisms of Polynomials
IEEE Access, 2018 Most of the existing blind proxy re-signature schemes are designed based on the traditional public key cryptosystems, whose security relies on the hardness of big integer factoring, discrete logarithm, elliptic curve discrete logarithm, and so on ...
Li Huixian +3 more
doaj +1 more source
Improved group signature scheme basedon discrete logarithm problem
Electronics Letters, 1999 In 1998, an efficient group signature scheme (the Lee-Chang scheme) was proposed based on the discrete logarithm problem. In this scheme, different group signatures of a signer for different messages contain some identical information. Once one group signature is identified, all previous group signatures are also identified at the same time.
null Tseng, null Jan
openaire +1 more source
Integer factorization and discrete logarithm problems
Les cours du CIRM, 2014 These are notes for a lecture given at CIRM in 2014, for the Journees Nationales du Calcul Formel. We explain the basic algorithms based on combining congruences for solving the integer factorization and the discrete logarithm problems. We highlight two particular situations where the interaction with symbolic computation is visible: the use of Grobner
openaire +1 more source
Recovering Secrets From Prefix-Dependent Leakage
Journal of Mathematical Cryptology, 2020 We discuss how to recover a secret bitstring given partial information obtained during a computation over that string, assuming the computation is a deterministic algorithm processing the secret bits sequentially.
Ferradi Houda +4 more
doaj +1 more source
Quantum algorithm for solving binary hyperelliptic curve discrete logarithm problem
CybersecurityIt is well-established that Shor’s algorithm can solve the discrete logarithm problem (DLP) in polynomial time. The hyperelliptic curve DLP (HCDLP) of genus 2 has found widespread industrial applications and remains an active research domain.
Yan Huang +4 more
doaj +1 more source
On the asymptotic effectiveness of Weil descent attacks
Journal of Mathematical Cryptology, 2010 In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields.
Karabina Koray +3 more
doaj +1 more source
A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography
IEEE Access, 2020 Nowadays, we are surrounded by devices collecting and transmitting private information. Currently, the two main mathematical problems that guarantee security on the Internet are the Integer Factorization Problem and the Discrete Logarithm Problem ...
Fabio Borges +2 more
doaj +1 more source