Lattices of compatibly embedded finite fields

Journal of Symbolic Computation

Volumn 24, Issue 3-4, 1997, Pages 351-369

  Bosma, Wieb ^a   Cannon, John ^a   Steel, Allan ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031236523     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1997.0138     Document Type: Article

References (17)

1. Bosma, W., Cannon, J. (1996). Handbook of MAGMA functions. School of Mathematics and Statistics, Sydney University.
2. Bosma, W., Cannon, J., Matthews, G. (1994). Programming with algebraic structures: design of the Magma language. In Giesbrecht, M. (ed.), Proceedings of the 1994 International Symposium on Symbolic and Algebraic Computation, pp. 52-57, New York, Oxford: ACM Press.
3. Bosma, W., Cannon, J., Playoust, C. (1997). The Magma algebra system I: the user language. J. Symbolic Comput. 24, 235-265.
4. n ± 1, 13 ≤ a < 100. Technical report NM-R9212, Centrum voor Wiskunde en Informatica, Amsterdam.
5. Cannon, J., Playoust, C. (1996). Magma: A new computer algebra system. Euromath Bulletin 2(1), 113-144.
6. Cantor, D., Zassenhaus, H. (1981). A new algorithm for factoring polynomials over finite fields. Math. Comp. 36, 587-592.
7. Cohen, H. (1993). A Course in Computational Algebraic Number Theory. Berlin: Springer.
8. Conway, J. (1968). A tabulation of some information concerning finite fields. In Churchhouse, R., Herz, J. (eds.), Computers in Mathematical Research. Amsterdam: North-Holland.
9. Jansen, C., Lux, K., Parker, R., Wilson, R. (1995). An Atlas of Brauer Characters. Oxford: Oxford Science Publishers.
10. Jungnickel, D. (1993). Finite Fields. Mannheim: BI-Wissenschafts.
11. Knuth, D. E. (1969). The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Reading, MA: Addison-Wesley.
12. Lidl, R., Niederreiter, H. (1986). Finite Fields. Cambridge: Cambridge University Press.
13. Menezes, A. (1993). Applications of Finite Fields. Boston: Kluwer.
14. Montgomery, P. L. (1985). Modular multiplication without trial division. Math. Comp. 44, 519-521.
15. Pohlig, S., Hellman, M. (1978). An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Info. Th. 24, 106-110.
16. Pollard, J. (1978). Monte carlo methods for index computation mod p. Math. Comp. 32, 918-924.
17. Scheerhorn, A. (1992). Trace-and norm-compatible extensions of finite fields. Applicable Algebra in Engineering, Communication and Computing 3, 199-209.