Trapdooring Discrete Logarithms on Elliptic Curves over Rings
نویسنده
چکیده
This paper introduces three new probabilistic encryption schemes using elliptic curves over rings. The cryptosystems are based on three specific trapdoor mechanisms allowing the recipient to recover discrete logarithms on different types of curves. The first scheme is an embodiment of Naccache and Stern’s cryptosystem and realizes a discrete log encryption as originally wanted in [23] by Vanstone and Zuccherato. Our second scheme provides an elliptic curve version of Okamoto and Uchiyama’s probabilistic encryption, thus answering a question left open in [10] by the same authors. Finally, we introduce a Paillier-like encryption scheme based on the use of twists of anomalous curves. Our contributions provide probabilistic, homomorphic and semantically secure cryptosystems that concretize all previous research works on discrete log encryption in the elliptic curve setting.
منابع مشابه
New algorithm for the discrete logarithm problem on elliptic curves
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of Boolean equations. Under a first fall degree assumption the regularity degree of the system is at most 4. Extensive experimental data which supports the assu...
متن کامل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...
متن کاملDiscrete logarithms in curves over finite fields
The discrete logarithm problem in finite groups is one of the supposedly difficult problems at the foundation of asymmetric or public key cryptography. The first cryptosystems based on discrete logarithms were implemented in the multiplicative groups of finite fields, in which the discrete logarithm problem turned out to be easier than one would wish, just as the factorisation problem at the he...
متن کاملA quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log n)
Improving over an earlier construction by Kaye and Zalka [1], in [2] Maslov et al. describe an implementation of Shor’s algorithm, which can solve the discrete logarithm problem on ordinary binary elliptic curves in quadratic depth O(n). In this paper we show that discrete logarithms on such curves can be found with a quantum circuit of depth O(log n). As technical tools we introduce quantum ci...
متن کاملA quantum circuit to find discrete logarithms on binary elliptic curves in depth O(log^2 n)
Improving over an earlier construction by Kaye and Zalka [1], in [2] Maslov et al. describe an implementation of Shor’s algorithm, which can solve the discrete logarithm problem on binary elliptic curves in quadratic depth O(n). In this paper we show that discrete logarithms on such curves can be found with a quantum circuit of depth O(log n). As technical tools we introduce quantum circuits fo...
متن کامل