References

1

R. Kruse, B. Leung, and C. Tondo, Data Structures and Program Design in C , (First Edition). Prentice Hall. 1991.

2

A. Menezes,Editor, et.al, Applicatioons of Finite Fields , (First Edition). Kluwer Academic Publishers. 1993.

3

A. M. Odlyzko, ``Discrete logarithms in finite fields and their cryptographic significance,'' Advances in Cryptology. Proceedings of Eurocrypt '84 - A Workshop on the Theory and Application of Cryptographic Techniques,(1984),p. vii+489, 224-314.

4

S. Pohlig and M. Hellman, ``An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance,'' IEEE Trans. Info. Th.,24(1978), 106-110.

5

H. Riesel, Prime Numbers and Computer Methods for Factorization , (Second Edition). Birkhäuser, Boston. 1994.

6

D. Stinson, Cryptography. Theory and Practice ,(First Edition). CRC Press, Inc. 1995.