Étude du problème du logarithme discret dans $I{F}_{p^3}$

 Access to full text

 Full (PDF)

1. [1] Adleman ( L.) .— A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proc. 20th IEEE Fond. Comp. Sci. Symp., 1979, pp. 55-60. 
2. [2] Cohn ( H.) .— A Classical Invitation to Algebraic Numbers and Class Fields, Springer Verlag, 1978. Zbl0395.12001MR506156
3. [3] El Gamal ( T.) .— A Subexponential-Time of Computing discrete logarithm over GF(p2), IEEE Transaction on information theory IT-31, n° 4, July 1985, pp. 473-481. Zbl0573.12006MR798553
4. [4] Hellman ( M.) et Reyneri ( J.) .— Fast computation of discrete logarithms over GF(pm), Crypto '82 Conf., Santa Barbara, CA (August 1982). Zbl0514.94013
5. [5] Lidl ( R.) et Niederreiter ( H.) .— Introduction to finite fields and their applications, Cambridge University Press, 1986. Zbl0629.12016MR860948
6. [6] Serre ( J.-P.) .— A Course in Arithmetic, Springer-Verlag, New-York, 1973. Zbl0256.12001MR344216
7. [7] Vincent Cioffari ( G.) . — The Euclidean Condition in Pure Cubic and Complex Quartic Fields. Mathematics of Computation33, number 145 (January 1979), pp. 389-398. Zbl0399.12001MR514835
8. [8] Borevitch ( Z.I.) et Chafarevitch ( I.R.) .— Théorie des nombres, Gauthier-VillarsParis, 1967. Zbl0145.04901MR205908