Results 21 to 30 of about 559 (211)
Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem
Journal of Mathematical Cryptology, 2020 We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus ...
Huang Ming-Deh +4 more
doaj +1 more source
Discrete Logarithm Based Protocols [PDF]
, 2007 The Exponential Security System (TESS) developed at the European Institute for System Security is the result of an attempt to increase the security in heterogenous computer networks. In this paper we present the cryptographic protocols in the kernel of TESS.
Horster, Patrick, Knobloch, Hans-Joachim
openaire +1 more source
Discrete logarithmic energy on the sphere [PDF]
Pacific Journal of Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dragnev, P. D. +2 more
openaire +2 more sources
Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
Cryptography, 2018 In 2008, Doliskani et al. proposed an ElGamal-style encryption scheme using the symmetric group Sn as mathematical platform. In 2012, an improvement of the cryptosystem’s memory requirements was suggested by Othman. The proposal by Doliskani et al.
María Isabel González Vasco +2 more
doaj +1 more source
Comparative Study of Digital Signature Standards Based on Discrete Logarithm [PDF]
Jisuanji gongcheng, 2016 As Chinese state encryption administration is seeking the next generation of Digital Signature Standard(DSS),this paper analyzes and compares seven DSS listed in ISO/IEC 14888-3 and SM2 which are based on Discrete Logarithm Problem(DLP) or Elliptic Curve
FENG Zeyu,GONG Boru,ZHAO Yunlei
doaj +1 more source
The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
Journal of Mathematical Cryptology, 2010 The paper provides a cryptanalysis of the AAβ-cryptosystem recently proposed by Ariffin and Abu. The scheme is in essence a key agreement scheme whose security is based on a discrete logarithm problem in the infinite (additive) group ℝ/ℤ (the reals ...
Blackburn Simon R.
doaj +1 more source
Entropy, 2022 In this paper, we consider the optimization of the quantum circuit for discrete logarithm of binary elliptic curves under a constrained connectivity, focusing on the resource expenditure and the optimal design for quantum operations such as the addition,
Jianmei Liu +5 more
doaj +1 more source
Finite fields and cryptology [PDF]
Computer Science Journal of Moldova, 2003 The problem of a computationally feasible method of finding the discrete logarithm in a (large) finite field is discussed, presenting the main algorithms in this direction.
Ennio Cortellini
doaj
IACR Communications in CryptologyThe Number Field Sieve and its variants are the best algorithms to solve the discrete logarithm problem in finite fields (except for the weak small characteristic case). The Factory variant accelerates the computation when several prime fields are targeted.
Haetham Al Aswad +2 more
openaire +3 more sources
Traps to the BGJT-algorithm for discrete logarithms [PDF]
LMS Journal of Computation and Mathematics, 2014 AbstractIn the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a quasi-polynomial time algorithm is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of the algorithm is based on several heuristics presented in their paper.
Qi Cheng 0001 +2 more
openaire +5 more sources