Public-key cryptosystems based on cubic finite field extensions

IEEE Transactions on Information Theory

Volumn 45, Issue 7, 1999, Pages 2601-2605

  Gong, Guang ^a,b   Harn, Lein ^c  

^a Electrical Engineering Systems EEB500 ^*  (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; SECURITY OF DATA; SHIFT REGISTERS;

CUBIC FINITE FIELD EXTENSIONS; PUBLIC-KEY CRYPTOSYSTEMS; THIRD-ORDER LINEAR FEEDBACK SHIFT REGISTER (LFSR) SEQUENCES;

CRYPTOGRAPHY;

EID: 0033321914     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.796413     Document Type: Article

References (23)

1. L. M. Adleman and J. DeMarrais, "A subexponential algorithm for discrete logarithms over all finite fields," in P roc. Crypto'93 (Lecture Notes in Computer Science, no. 773). Berlin, Germany: Springer-Verlag, 1994, pp. 147-158.
2. L. M. Adleman and M. A. Huang, "Function field sieve method for discrete logarithms over finite fields," Dec. 1997, preprint.
3. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. IT-22, pp. 644-654, Nov. 1976.
4. P. Donnelly and G. Grimmett, "On the asymptotic distribution of large prime factors," J. London Math. Soc. (2), vol. 47, pp. 395-404, 1993.
5. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Inform. Theory, vol. IT- 31, pp. 469-472, July 1985.
6. 2)," IEEE Trans. Inform. Theory, vol. IT-32, 1985.
7. C. M. Fiduccia, "An efficient formula for linear recurrences," SIAM J. Comput., vol. 14, pp. 106-112, 1985.
8. S. W. Golomb, Shift Register Sequences. Laguna Hills, CA: Aegean Park, 1982.
9. D. Gordon, "Discrete logarithms in GF (p) suing the number field sieve," SIAM J. Discr. Math., vol. 6, pp. 124-138, 1993.
10. D. E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1969.
11. A. K. Lenstra and H. W. Lenstra, Jr., Eds., The Development of the Number Field Sieve (Lecture Notes in Mathematics, no. 1554). Berlin, Germany: Springer-Verlag, 1993.
12. R. Lidl and H. Niederreiter, "Finite fields," in Encyclopedia of Mathematics and Its Applications, vol. 20. Reading, MA: Addison-Wesley, 1983.
13. R. Lidl, G. L. Mullen, and G. Turnwald, Dickson Polynomials, Pitman Monographs and Surveys in Pure and Applied Mathematics 65. New York: Wiley, 1993.
14. W. B. Müller and W. Nöbauer, "Cryptanalysis of the Dickson-scheme," in Proc. Eurocrypt'85. Berlin, Germany: Springer-Verlag, 1986, pp. 71-76.
15. W. Nöbauer, "Cryptanalysis of a public-key cryptosystem based on Dickson polynomials," Math. Slovaca, vol. 38, pp. 309-323, 1989.
16. NIST, "A proposed federal information processing standard for digital signature standard (DSS)," Federal Register, vol. 56, pp. 42980-42982, 1991.
17. L. Rédei, Algebra. Leipzig, Germany: Geest & Portig, 1959; London, U.K.: Pergamon, 1967.
18. R. L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public key cryptosystems," ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
19. B. Schneier, Applied Cryptography, 2nd ed. New York: Wiley, 1996.
20. P. Smith, "LUC public-key encryption," Dr. Dobb's J., pp. 44-49, Jan. 1993.
21. P. Smith and C. Skinner, "A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms," in Proc. Asiacrypt'94, Nov. 1994, pp. 298-306.
22. D. R. Stison, Cryptography, Theory and Practice. Boca Raton, FL: CRC, 1995.
23. W. Stallings, Network and Internetwork Security Principles and Practice. New York: IEEE, 1995.