The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives
نویسندگان
چکیده
In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.
منابع مشابه
A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography
In 1999 Silverman [21] introduced a family of binary finite fields which are composite extensions of F2 and on which arithmetic operations can be performed more quickly than on prime extensions of F2 of the same size. We present here a fast approach to elliptic curve cryptography using a distinguished subset of the set of Silverman fields F2N = Fhn . This approach leads to a theoretical computa...
متن کاملOn the discrete logarithm problem in elliptic curves II
We continue our study on the elliptic curve discrete logarithm problem over finite extension fields. We show, among other results, the following two results: For sequences of prime powers (qi)i∈N and natural numbers (ni)i∈N with ni −→ ∞ and ni log(qi) −→ 0 for i −→ ∞, the discrete logarithm problem in the groups of rational points of elliptic curves over the fields Fqi i can be solved in subexp...
متن کاملThe Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.
متن کاملOn the discrete logarithm problem in elliptic curves
We study the elliptic curve discrete logarithm problem over finite extension fields. We show that for any sequences of prime powers (qi)i∈N and natural numbers (ni)i∈N with ni −→ ∞ and ni log(qi) −→ 0 for i −→ ∞, the elliptic curve discrete logarithm problem restricted to curves over the fields Fqi i can be solved in subexponential expected time (qi i ) . We also show that there exists a sequen...
متن کاملThe Number Field Sieve in the Medium Prime Case
In this paper, we study several variations of the number field sieve to compute discrete logarithms in finite fields of the form Fpn , with p a medium to large prime. We show that when n is not too large, this yields a Lpn(1/3) algorithm with efficiency similar to that of the regular number field sieve over prime fields. This approach complements the recent results of Joux and Lercier on the fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017