Discrete Logarithms in Finite Fields and Their Cryptographic Significance
نویسنده
چکیده
Given a primitive element g of a finite field GF(q), the discrete logarithm of a nonzero element u ∈ GF(q) is that integer k, 1 ≤ k ≤ q − 1, for which u = g k . The well-known problem of computing discrete logarithms in finite fields has acquired additional importance in recent years due to its applicability in cryptography. Several cryptographic systems would become insecure if an efficient discrete logarithm algorithm were discovered. This paper surveys and analyzes known algorithms in this area, with special attention devoted to algorithms for the fields GF( 2 ). It appears that in order to be safe from attacks using these algorithms, the value of n for which GF( 2 ) is used in a cryptosystem has to be very large and carefully chosen. Due in large part to recent discoveries, discrete logarithms in fields GF( 2 ) are much easier to compute than in fields GF(p) with p prime. Hence the fields GF( 2 ) ought to be avoided in all cryptographic applications. On the other hand, the fields GF(p) with p prime appear to offer relatively high levels of security. Discrete logarithms in finite fields and their cryptographic significance A. M. Odlyzko AT&T Bell Laboratories Murray Hill, New Jersey 07974
منابع مشابه
Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk)
The discrete logarithm problem is one of the few hard problems on which public-key cryptography can be based. It was introduced in the field by the famous Diffie–Hellman key exchange protocol. Initially, the cryptographic use of the problem was considered in prime fields, but was readily generalized to arbitrary finite fields and, later, to elliptic or higher genus curves. In this talk, we surv...
متن کاملOn Cryptographic Schemes Based on Discrete Logarithms and Factoring
At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N . We so obtain compact representations for cryptographic systems that base their security on the discrete logarithm problem and the factoring problem. This results in smaller key sizes and substantial savings in memory and bandwidt...
متن کامل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...
متن کاملOn the computation of discrete logarithms in finite prime fields
In this thesis we write about practical experience when solving congruences of the form a ≡ b mod p, a, b, p, x ∈ ZZ, p prime. This is referred to as the discrete logarithm problem in (ZZ/pZZ)∗. Many cryptographic protocols such as signature schemes, message encryption, key exchange and identification depend on the difficulty of this problem. We are concerned with the practicability of differen...
متن کاملA Subexponential Algorithm for Discrete Logarithms over All Finite Fields
There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponential algorithm for computing discrete logarithms over all finite fields. We present such an algorithm and a heuristic argument that there exists a c e M>o such that for all sufficiently large prime powers p" , the algorithm com...
متن کامل