Discrete Logarithm and Minimum Circuit Size
نویسنده
چکیده
This paper shows that the Discrete Logarithm Problem is in ZPP (where MCSP is the Minimum Circuit Size Problem). This result improves the previous bound that the Discrete Logarithm Problem is in BPP Allender et al. (2006). In doing so, this paper helps classify the relative difficulty of the Minimum Circuit Size Problem.
منابع مشابه
An efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملEfficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
We provide a zero-knowledge argument for arithmetic circuit satisfiability with a communication complexity that grows logarithmically in the size of the circuit. The round complexity is also logarithmic and for an arithmetic circuit with fan-in 2 gates the computation of the prover and verifier is linear in the size of the circuit. The soundness of our argument relies solely on the well-establi...
متن کاملPseudorandom Number Generation and Space Complexity
Recently, Blum and Micali (1982) described a pseudorandum number generator that transforms m-bit seeds to ink-bit pseudorandom numbers, for any integer k. Under the assumption that the discrete logarithm problem cannot be solved by polynomial-size combinational logic circuits, they show that the pseudorandom numbers generated are good in the sense that no polynomial-size circuit can determine t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 128 شماره
صفحات -
تاریخ انتشار 2016