Result 1 to 20 of 21 total
On explicit factors of cyclotomic polynomials over finite fields. (English)
Des. Codes Cryptography 63, No. 1, 87-104 (2012).
1
Non-admissible tracks in Shamirs scheme. (English)
Finite Fields Appl. 17, No. 4, 329-342 (2011).
2
Frames for vector spaces and affine spaces. (English)
Linear Algebra Appl. 435, No. 1, 77-94 (2011).
3
Dimension and minimum distance of a class of $BCH$ codes. (English)
Ann. Sci. Math. Qué. 32, No. 1, 57-62 (2008).
4
Cyclotomic mapping permutation polynomials over finite fields. (English)
Golomb, Solomon W. (ed.) et al., Sequences, subsequences, and consequences. International workshop, SSC 2007, Los Angeles, CA, USA, May 31‒June 2, 2007. Revised invited papers. Berlin: Springer (ISBN 978-3-540-77403-7/pbk). Lecture Notes in Computer Science 4893, 119-128 (2007).
5
Jacobi sums over finite fields. (English)
Acta Arith. 102, No. 1, 1-20 (2002).
6
Lower bounds on the linear complexity of the discrete logarithm in finite fields. (English)
IEEE Trans. Inf. Theory 47, No.7, 2807-2811 (2001).
7
Counting the number of points on affine diagonal curves. (English)
Lam, Kwok-Yan (ed.) et al., Cryptography and computational number theory. Proceedings of the workshop, CCNT’99, Singapore, November 22-26, 1999. Basel: Birkhäuser. Prog. Comput. Sci. Appl. Log. 20, 15-24 (2001).
8
Polynomials: an algorithmic approach. (English)
Singapore: Springer. xi, 306 p. DM 98.00; öS 716.00; sFr. 89.50; \sterling 37.50; \$ 49.00 (1999).
9
Traces of roots of unity over prime fields. (English)
Mullin, Ronald C. (ed.) et al., Finite fields: theory, applications, and algorithms. Fourth international conference, Waterloo, Ontario, Canada, August 12‒15, 1997. Providence, RI: American Mathematical Society. Contemp. Math. 225, 113-121 (1999).
10
Gauss and Jacobi sums. (English)
Canadian Mathematical Society Series of Monographs and Advanced Texts. New York, NY: John Wiley \& Sons. xi, 583 p. \sterling 45.50 (1998).
11
Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields. (English)
Varadharajan, Vijay (ed.) et al., Information security and privacy. 2nd Australasian conference, ACISP ’97. Sidney, NSW, Australia. July 7-9, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1270, 127-138 (1997).
12
Factoring cyclotomic polynomials over large finite fields. (English)
Cohen, S. (ed.) et al., Finite fields and applications. Proceedings of the 3rd international conference, Glasgow, UK, July 11‒14, 1995. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 233, 349-354 (1996).
13
Number theory and finite fields. (English)
Colbourn, Charles J. (ed.) et al., The CRC handbook of combinatorial designs. Boca Raton, FL: CRC Press. CRC Press Series on Discrete Mathematics and its Applications. 615-644 (1996).
14
Abstract algebra. 3rd ed. (English)
Upper Saddle River, NJ: Prentice Hall. xv, 249 p. \$ 37.95 (1996).
15
Cyclic transformations and power vectors over finite fields. (Zyklische Transformationen und Potenzvektoren über endlichen Körpern.) (German)
Braunschweig: Tech. Univ. Braunschweig, FB Math. 55 S. (1995).
16
Realizability of group characters over cyclotomic fields. (Realisierbarkeit von Gruppencharakteren über Kreiskörpern.) (German)
Augsburger Mathematisch-Naturwissenschaftliche Schriften. 3. Augsburg: Wißner. ix, 38 p. DM 29.80 (1995).
17
Almost perfect binary functions. (English)
Appl. Algebra Eng. Commun. Comput. 4, No.2, 95-102 (1993).
18
A classical introduction to modern number theory. 2nd ed. (English)
Graduate Texts in Mathematics, 84. New York etc.: Springer-Verlag. xiv, 389 p. DM 98.00 (1990).
19
Abstract algebra. 2nd ed. (English)
New York etc.: Macmillan/Collier Macmillan. xix, 293 p. (1990).
20
Result 1 to 20 of 21 total
Start
Contact
Print
General Help
