G. Bachman, On the coefficients of ternary cyclotomic polynomials, Journal of Number Theory, vol.100, issue.1, pp.104-116, 2003.
DOI : 10.1016/S0022-314X(02)00119-1

A. S. Bang, Om Ligningen ? n (x) = 0, pp.6-12, 1895.

P. T. Bateman, Note on the coefficients of the cyclotomic polynomial, Bulletin of the American Mathematical Society, vol.55, issue.12, pp.1180-1181
DOI : 10.1090/S0002-9904-1949-09355-2

M. Beiter, Coefficients in the Cyclotomic Polynomials for Numbers with at Most Three Distinct Odd Primes in their Factorization, 1960.

M. Beiter, The Midterm Coefficient of the Cyclotomic Polynomial F pq (x), The American Mathematical Monthly, vol.71, issue.7, pp.769-770, 1964.
DOI : 10.2307/2310894

M. Beiter, Magnitude of the Coefficients of the Cyclotomic Polynomial F pqr (x), The American Mathematical Monthly, vol.75, issue.4, pp.370-372, 1968.
DOI : 10.2307/2313416

M. Beiter, Magnitude of the Coefficients of the Cyclotomic Polynomial F pqr , II. Duke math, J, vol.38, pp.591-594, 1971.

D. M. Bloom, On the Coefficients of the Cyclotomic Polynomials, The American Mathematical Monthly, vol.75, issue.4, pp.372-377, 1968.
DOI : 10.2307/2313417

A. E. Brouwer, R. Pellikaan, and E. R. Verheul, Doing More with Fewer Bits, Advances in Cryptology ? Asiacrypt '99, pp.321-332, 1999.
DOI : 10.1007/978-3-540-48000-6_26

L. Carlitz, The Number of Terms in the Cyclotomic Polynomial F pq (x), The American Mathematical Monthly, vol.73, issue.9, pp.979-981, 1966.
DOI : 10.2307/2314500

J. Couveignes, Quelques mathématiques de la cryptologie à clés publiques (Journée annuelle de la SMF) Nouvelles méthodes mathématiques pour la cryptographie, 2007.

J. Couveignes and &. R. Lercier, Elliptic Periods for Finite Fields. Finite Fields and their Applications, pp.1-22
URL : https://hal.archives-ouvertes.fr/hal-00630391

B. Crstici and &. J. Sándor, Handbook of Number Theory II, 2004.

W. Diffie and &. M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.22-644, 1976.
DOI : 10.1109/TIT.1976.1055638

M. Van-dijk, R. Granger, D. Page, K. Rubin, A. Silverberg et al., Practical Cryptography in High Dimensional Tori, Practical Cryptography in High Dimensional Tori. Advances in Cryptology ? EUROCRYPT 2005, pp.234-250, 2005.
DOI : 10.1007/11426639_14

M. Van-dijk and &. D. Woodruff, Asymptotically Optimal Communication for Torus-Based Cryptography, Lecture Notes in Computer Science, vol.3152, pp.157-178
DOI : 10.1007/978-3-540-28628-8_10

C. Dunand, Abstract, LMS Journal of Computation and Mathematics, vol.6
DOI : 10.1007/3-540-44598-6_1

C. Dunand and &. R. Lercier, Normal elliptic bases and torus-based cryptography, Ninth International Conference on Finite Fields and Applications, pp.137-153, 2009.
DOI : 10.1090/conm/518/10202
URL : https://hal.archives-ouvertes.fr/hal-00456465

P. Erdös, On the coefficients of the cyclotomic polynomial, Bulletin of the American Mathematical Society, vol.52, issue.2, pp.179-184, 1946.
DOI : 10.1090/S0002-9904-1946-08538-9

S. D. Galbraith, Mathematics of Public-Key Cryptography. En cours d'écriture, chapitres disponibles sur http

S. D. Galbraith and &. M. Scott, Exponentiation in Pairing-Friendly Groups Using Homomorphisms, Lecture Notes in Computer Science, vol.5209, pp.211-224, 2008.
DOI : 10.1007/978-3-540-85538-5_15

Y. Gallot and &. P. Moree, Ternary cyclotomic polynomials having a large coefficient, Journal für die reine und angewandte Mathematik, pp.105-125, 2009.
DOI : 10.1515/CRELLE.2009.052

J. Zur-gathen and &. J. Gerhard, Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

R. Granger, D. Page, and M. Stam, A Comparison of CEILIDH and XTR, 6th International Algorithmic Number Theory Symposium, 2004.
DOI : 10.1007/978-3-540-24847-7_17

R. Granger and &. F. Vercauteren, On the Discrete Logarithm Problem on Algebraic Tori, Lecture Notes in Computer Science, vol.3621, pp.66-85, 2005.
DOI : 10.1007/11535218_5

J. Itard, Les nombres premiers des Que sais-je ?, PUF, vol.x, 1975.

A. Joux and &. R. Lercier, The Function Field Sieve in the Medium Prime Case, Lecture Notes in Computer Science, vol.4004, pp.254-270, 2006.
DOI : 10.1007/11761679_16
URL : https://hal.archives-ouvertes.fr/hal-00456191

T. Y. Lam and &. H. Leung, On the Cyclotomic Polynomial $Phi\{pq} (X)$, The American Mathematical Monthly, vol.103, issue.7, pp.562-564, 1996.
DOI : 10.2307/2974668

E. Lehmer, On the magnitude of the coefficients of the cyclotomic polynomial, Bulletin of the American Mathematical Society, vol.42, issue.6, 1936.
DOI : 10.1090/S0002-9904-1936-06309-3

M. J. Lennon and &. J. Smith, LUC : A New Public Key System, IFIP TC11 Ninth International Conference on Information Security IFIP/Sec, pp.103-117, 1994.

A. K. Lenstra and &. M. Stam, Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions, Cryptographic, Hardware and Embedded Systems (CHES), pp.318-332, 2002.

A. K. Lenstra and &. E. Verheul, The XTR Public Key System, Lecture Notes in Computer Science, vol.1880, pp.1-19, 2000.
DOI : 10.1007/3-540-44598-6_1

R. Lidl and &. H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, vol.20, 1983.
DOI : 10.1017/CBO9780511525926

U. M. Maurer and &. S. Wolf, The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms, SIAM Journal on Computing, vol.28, issue.5, pp.1698-1721, 1999.
DOI : 10.1137/S0097539796302749

A. Migotti, Zur Theorie der Kreisteilungsgleichung, Sitzungberichte der Mathematisch-Naturwissenschaftlichen Classe der Kaiserlichen Akademie der Wissenschaften in Wien, pp.7-14, 1883.

H. Möller, ???ber diei-ten Koeffizienten der Kreisteilungspolynome, Mathematische Annalen, vol.42, issue.1, pp.26-38, 1970.
DOI : 10.1007/BF01435412

P. Moree, Inverse cyclotomic polynomials, Journal of Number Theory, vol.129, issue.3, pp.667-680, 2009.
DOI : 10.1016/j.jnt.2008.10.004
URL : http://doi.org/10.1016/j.jnt.2008.10.004

D. Panario and &. B. Richmond, Analysis of Ben-Or's polynomial irreducibility test, Random Structures and Algorithms, vol.13, issue.3-4, pp.439-456, 1998.
DOI : 10.1002/(SICI)1098-2418(199810/12)13:3/4<439::AID-RSA13>3.0.CO;2-U

K. Rubin and &. A. Silverberg, Torus-Based Cryptography, Lecture Notes in Computer Science, vol.2729, pp.349-365
DOI : 10.1007/978-3-540-45146-4_21

K. Rubin and &. A. Silverberg, Algebraic Tori in Cryptography High Primes Misdemeanours : Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Inst, Commun. AMS, vol.41, pp.317-326, 2004.

C. P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, vol.4, issue.3, pp.161-174, 1991.
DOI : 10.1007/BF00196725

V. Shoup, Lower Bounds for Discrete Logarithms and Related Problems, Advances in Cryptology ? Eurocrypt'97, pp.256-266, 1997.
DOI : 10.1007/3-540-69053-0_18

C. Skinner and &. P. Smith, A Public-Key Cryptosystem and a Digital Signature System Based on the Lucas Function Analogue to Discrete Logarithms Advances in Cryptology ? ASIACRYPT, Lecture Notes in Computer Science, vol.917, pp.357-364, 1994.

J. Suzuki, On coefficients of cyclotomic polynomials, Proceedings of the Japan Academy, Series A, Mathematical Sciences, vol.63, issue.7, pp.279-280, 1987.
DOI : 10.3792/pjaa.63.279

G. Tenenbaum and M. M. France, Les nombres premiers. Que sais-je ?
URL : https://hal.archives-ouvertes.fr/hal-01312570

V. E. Voskresenski and ?. , Algebraic Groups and Their Birational Invariants, Translations of Mathematical Monographs, vol.179, 1991.

A. Weil, Adeles and Algebraic Groups, Progress in Math. Birkhäuser, vol.23, 1982.
DOI : 10.1007/978-1-4684-9156-2

.. Application-cryptographique-À-diffie-hellman, 76 5.3.1 Négociation de clefs multiples, p.77