1. Adleman, M., DeMarrais, J.: A subexponentional algorithm over all finite fields. In: CRYPTO 1993 Proc., pp. 147–158. Springer, Heidelberg (1993)
2. Lecture Notes in Computer Science;N. Asokan,1998
3. Bellare, M., Rogaway, P.: Random Oracles are Practical: A paradigm for Designing Efficient Protocols. In: 1st ACM Conference on Computer and Communications Security, pp. 62–73. ACM Press, New York (1993)
4. Lecture Notes in Computer Science;D. Boneh,1996
5. Brouwer, A.E., Pellikaan, R., Verheul, E.R.: Doing More with Fewer Bits. In: Asiacrypt 1999 Proc. Springer, Heidelberg (1999)