here - Sites personnels de TELECOM ParisTech - TÃ©lÃ©com ParisTech

More documents

Recommendations

Info

196 Bibliography[72] Cunsheng Ding, Guozhen Xiao, and Weijuan Shan. The Stability Theory of Stream Ciphers,volume 561 of Lecture Notes in Computer Science. Springer, 1991. (Cited on pages 11and 220.)[73] Hans Dobbertin. Construction of bent functions and balanced Boolean functions with highnonlinearity. In Bart Preneel, editor, FSE, volume 1008 of Lecture Notes in ComputerScience, pages 61–74. Springer, 1994. (Cited on page 14.)[74] Jean-Guillaume Dumas, Thierry Gautier, Pascal Giorgi, Jean-Louis Roch, and Gilles Villard.Givaro-3.2.13rc1: C++ library for arithmetic and algebraic computations, September 2008.http://ljk.imag.fr/CASYS/LOGICIELS/givaro/. (Cited on page 126.)[75] Régis Dupont. Moyenne arithmético-géométrique, suites de Borchardt et applications. PhDthesis, École Polytechnique, 2006. (Cited on page 184.)[76] Régis Dupont, Andreas Enge, and Emmanuel Thomé. Computation of Igusa class polynomialswith the complex analytic method. Talk given at GeoCrypt 2011, slides available athttp://iml.univ-mrs.fr/ati/GeoCrypt2011, June 2011. (Cited on page 184.)[77] Jean-Pierre Duval. Génération d’une section des classes de conjugaison et arbre des motsde Lyndon de longueur bornée. Theor. Comput. Sci., 60:255–283, 1988. (Cited on page 89.)[78] Bernard Dwork. On the rationality of the zeta function of an algebraic variety. Amer. J.Math., 82:631–648, 1960. (Cited on page 107.)[79] Bernard Dwork. A deformation theory for the zeta function of a hypersurface. In Proc.Internat. Congr. Mathematicians (Stockholm, 1962), pages 247–259. Inst. Mittag-Leffler,Djursholm, 1963. (Cited on page 107.)[80] Kirsten Eisenträger and Kristin Estella Lauter. A CRT algorithm for constructing genus 2curves over finite fields. math/0405305, May 2004. (Cited on page 184.)[81] Noam David Elkies. Elliptic and modular curves over finite fields and related computationalissues. In Computational perspectives on number theory (Chicago, IL, 1995), volume 7 ofAMS/IP Stud. Adv. Math., pages 21–76. Amer. Math. Soc., Providence, RI, 1998. (Citedon page 107.)[82] Andreas Enge. Elliptic Curves and Their Applications to Cryptography: An Introduction.Springer, 1st edition, August 1999. (Cited on pages 99 and 105.)[83] Andreas Enge. How to distinguish hyperelliptic curves in even characteristic. In Public-keycryptography and computational number theory (Warsaw, 2000), pages 49–58. de Gruyter,Berlin, 2001. (Cited on page 106.)[84] Andreas Enge. Courbes Algébriques et Cryptologie. Hdr, Université Paris-Diderot - ParisVII, December 2007. (Cited on page 154.)[85] Andreas Enge. The complexity of class polynomial computation via floating point approximations.Math. Comput., 78(266):1089–1107, 2009. (Cited on page 152.)[86] Andreas Enge and François Morain. Generalised Weber functions. I. 0905.3250, May 2009.(Cited on page 153.)
Bibliography 197[87] Andreas Enge and Reinhard Schertz. Constructing elliptic curves over finite fields usingdouble eta-quotients. J. Théor. Nombres Bordeaux, 16(3):555–568, 2004. (Cited on pages 153and 154.)[88] Michel Fabrikant. Guide des montagnes corses. Guides et cartes Didier et Richard. Didieret Richard, 1982. (Cited on page xi.)[89] Keqin Feng, Qunying Liao, and Jing Yang. Maximal values of generalized algebraic immunity.Des. Codes Cryptography, 50(2):243–252, 2009. (Cited on pages 8, 12, and 221.)[90] Claus Fieker and David Russell Kohel, editors. Algorithmic Number Theory, 5th InternationalSymposium, ANTS-V, Sydney, Australia, July 7-12, 2002, Proceedings, volume 2369of Lecture Notes in Computer Science. Springer, 2002. (Cited on pages 195 and 201.)[91] Jean-Pierre Flori and Sihem Mesnager. An efficient characterization of a family of hyperbentfunctions with multiple trace terms. Cryptology ePrint Archive, Report 2011/373, 2011.http://eprint.iacr.org/. (Cited on page 110.)[92] Jean-Pierre Flori, Sihem Mesnager, and Gérard Denis Cohen. Binary Kloosterman sumswith value 4. In Liqun Chen, editor, IMA Int. Conf., volume 7089 of Lecture Notes inComputer Science, pages 61–78. Springer, 2011. (Cited on page 110.)[93] Jean-Pierre Flori, Sihem Mesnager, and Gérard Denis Cohen. The value 4 of binaryKloosterman sums. Cryptology ePrint Archive, Report 2011/364, 2011. http://eprint.iacr.org/. (Cited on page 110.)[94] Jean-Pierre Flori and Hugues Randriam. On the number of carries occurring in an additionmod 2 k − 1. To appear in Integers journal, 2011. http://www.integers-ejcnt.org/.(Cited on page 20.)[95] Jean-Pierre Flori and Hugues Randriam. On the number of carries occurring in an additionmod 2 k −1. Cryptology ePrint Archive, Report 2011/245, 2011. http://eprint.iacr.org/.(Cited on page 20.)[96] Jean-Pierre Flori, Hugues Randriam, Gérard Denis Cohen, and Sihem Mesnager. On aconjecture about binary strings distribution. In Claude Carlet and Alexander Pott, editors,SETA, volume 6338 of Lecture Notes in Computer Science, pages 346–358. Springer, 2010.(Cited on page 20.)[97] Jean-Pierre Flori, Hugues Randriam, Gérard Denis Cohen, and Sihem Mesnager. On aconjecture about binary strings distribution. Cryptology ePrint Archive, Report 2010/170,2010. http://eprint.iacr.org/. (Cited on page 20.)[98] Mireille Fouquet, Pierrick Gaudry, and Robert Harley. An extension of Satoh’s algorithmand its implementation. J. Ramanujan Math. Soc., 15(4):281–318, 2000. (Cited on pages 107and 123.)[99] Harold Fredricksen and Irving J. Kessler. An algorithm for generating necklaces of beads intwo colors. Discrete Mathematics, 61(2-3):181–188, 1986. (Cited on page 89.)[100] Harold Fredricksen and James Maiorana. Necklaces of beads in k colors and k-ary de Bruijnsequences. Discrete Math., 23(3):207–210, 1978. (Cited on page 89.)[101] David Freeman, Michael Scott, and Edlyn Teske. A taxonomy of pairing-friendly ellipticcurves. J. Cryptology, 23(2):224–280, 2010. (Cited on page 157.)
Page 1:
2012-ENST-003EDITE de ParisDoctorat
Page 4 and 5:
Jean-Pierre Flori: Boolean function
Page 7:
AbstractThe core of this thesis is
Page 11 and 12:
AcknowledgmentsVladimir. — Quand
Page 13 and 14:
ContentsList of symbols and notatio
Page 15 and 16:
Contentsxv4 Efficient characterizat
Page 17 and 18:
List of figures1.1 The filter model
Page 19 and 20:
List of symbols and notationGeneral
Page 21 and 22:
List of symbols and notationxxil(t)
Page 23 and 24:
List of symbols and notationxxiiidi
Page 25:
List of symbols and notationxxvu
Page 28 and 29:
2 Introduction1 Mathematics and cry
Page 30 and 31:
4 Introductiongiving more general b
Page 33 and 34:
Chapter 1Boolean functions incrypto
Page 35 and 36:
1.1. Cryptographic criteria for Boo
Page 37 and 38:
1.2. Families of Boolean functions
Page 39 and 40:
Page 41 and 42:
Page 43:
Page 46 and 47:
20 Chapter 2. On a conjecture about
Page 48 and 49:
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
Page 56 and 57:
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
Page 82 and 83:
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
Page 119:
Part IIBent functions and pointcoun
Page 122 and 123:
96 Chapter 3. Bent functions and al
Page 124 and 125:
98 Chapter 3. Bent functions and al
Page 126 and 127:
100 Chapter 3. Bent functions and a
Page 128 and 129:
Page 130 and 131:
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
110 Chapter 4. Efficient characteri
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144 and 145:
Page 146 and 147:
Page 148 and 149:
Page 150 and 151:
Page 152 and 153:
Page 155:
Part IIIComplex multiplication and
Page 158 and 159:
132 Chapter 5. Complex multiplicati
Page 160 and 161:
Page 162 and 163:
Page 164 and 165:
Page 166 and 167:
Page 168 and 169:
Page 170 and 171:
Page 172 and 173: 146 Chapter 5. Complex multiplicati
Page 185 and 186: Chapter 6Complex multiplication in
Page 187 and 188: 6.1. Abelian varieties 1616.1 Abeli
Page 189 and 190: 6.1. Abelian varieties 163Theorem 6
Page 191 and 192: 6.1. Abelian varieties 165A homomor
Page 193 and 194: 6.1. Abelian varieties 1676.1.5 Hom
Page 195 and 196: 6.2. Class groups and units 169The
Page 197 and 198: 6.2. Class groups and units 171in [
Page 199 and 200: 6.3. Complex multiplication 173If t
Page 201 and 202: 6.3. Complex multiplication 175•
Page 203 and 204: 6.3. Complex multiplication 177We h
Page 205 and 206: 6.3. Complex multiplication 179pola
Page 207 and 208: 6.4. Class polynomials for genus 2
Page 209 and 210: 6.4. Class polynomials for genus 2
Page 211: Appendices
Page 214 and 215: Table A.3: Coefficients for d = 3,
Page 216 and 217: Table A.8: Coefficients for d = 8,
Page 218 and 219: 192 Bibliography[13] Elwyn Ralph Be
Page 220 and 221: 194 Bibliography[42] Claude Carlet,
Page 224 and 225: 198 Bibliography[102] David Freeman
Page 226 and 227: 200 Bibliography[132] Marc Hindry a
Page 228 and 229: 202 Bibliography[161] Philippe Lang
Page 230 and 231: 204 Bibliography[191] Willi Meier a
Page 232 and 233: 206 Bibliography[222] Oscar Seymour
Page 234 and 235: 208 Bibliography[254] Marco Streng.
Page 236 and 237: 210 Bibliography[286] Chia-Fu Yu. T
Page 238 and 239: 212 IndexForm class group . . . . .
Page 240 and 241: 214 IndexKKloosterman sum . . . . .
Page 243 and 244: Résumé longFauĆ.Werd’ iĚ beru
Page 245 and 246: 1. Des fonctions booléennes et d
Page 253 and 254: 2. Fonctions courbes et comptage de
Page 261 and 262: 3. Multiplication complexe et polyn
Page 267: 3. Multiplication complexe et polyn
show all

here - Sites personnels de TELECOM ParisTech - TÃ©lÃ©com ParisTech

Create successful ePaper yourself

Delete template?

Save as template?