In [Dif76] Diffie and Hellman propose a public key distribution system which is based on the apparent difficulty of computing logarithms over the finite field GF (p), p prime. The reader, who is not familiar with the theory of finite fields is referred to Appendix B. Let α be a ...
Itoh,“An Id-based cryptosystem based on the discrete logarithm problem”, IEEE J. on Selected Areas in Communications, 8 (1989), 467–473. CrossRef P. Van Oorschot,“A comparison of practical public key cryptosystems based on integer factorization and discrete logarithms” , in Contemporary ...
e Logarithm Problem The Discrete Logarithm ProblemThe Discrete Logarithm ProblemAdelman subexponential algorithm and discrete logarithm problem (DLPbaby‐step, giant‐step algorithm (Shank's Algorithmindex‐calculus methodThe Need for Signatures Threats to Network Transactions Secrecy, Digital Signatures, and ...
The Discrete Logarithm Problem 来自 Semantic Scholar 喜欢 0 阅读量: 29 作者: HCAV Tilborg 摘要: In [Dif76] Diffie and Hellman propose a public key distribution system which is based on the apparent difficulty of computing logarithms over the finite field GF (p), p prime. The reader, ...
A Note on the Discrete Logarithm Problem on Elliptic Curves of Trace Two To the best of our knowledge, there are few effective algorithms that solve the elliptic curve discrete logarithm problem. More precisely, Menezes, Okamoto... S Uchiyama,T Saitoh - 《Technical Report of Ieice》 被引量:...
logarithm problem? 2.3.7 What is the discrete logarithm problem?2.3.7 What is the discrete logarithm problem?Kevin Bowers
Since the invention of the public-key cryptosystem in the 1970's, some number theoretic problems such as the integer factoring and the discrete logarithm problem in finite fields have received a lot of attention. The number field sieve method is currently known as the asymptotically fastest integer...
Let Fq be a finite field of characteristic p with q = pv elements, g a primitive element, a ≠ 0 an arbitrary element of Fq, and x = logg a the discrete logarithm of a to the base g. In this paper we consider the discrete logarithm problem in the case when q ≡ 1(mod 4) and...
We study the discrete logarithm problem in degree 0 class groups of curves over finite fields, with a particular emphasis on curves of small genus. We prove that for every fixed g ≥ 2, the discrete logarithm problem in degree 0 class groups of curves of genus g can be solved in an exp...
The discrete logarithm problem in F p 3 * is to determine x given y=g x ∈F p 3 . Let m be a nonsquare in F p and let E(m) be the ring of integers of Q(m). Previously, T. El Gamal [IEEE Trans. Inf. Theory IT-31, 473-481 (1985; Zbl 0573.12006)] has given a ...