- 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:
1.2. Families of Boolean functions
- Page 41 and 42:
1.2. Families of Boolean functions
- Page 43:
1.2. Families of Boolean functions
- Page 46 and 47:
20 Chapter 2. On a conjecture about
- Page 48 and 49:
22 Chapter 2. On a conjecture about
- Page 50 and 51:
24 Chapter 2. On a conjecture about
- Page 52 and 53:
26 Chapter 2. On a conjecture about
- Page 54 and 55:
28 Chapter 2. On a conjecture about
- Page 56 and 57:
30 Chapter 2. On a conjecture about
- Page 58 and 59:
32 Chapter 2. On a conjecture about
- Page 60 and 61:
34 Chapter 2. On a conjecture about
- Page 62 and 63:
36 Chapter 2. On a conjecture about
- Page 64 and 65:
38 Chapter 2. On a conjecture about
- Page 66 and 67:
40 Chapter 2. On a conjecture about
- Page 68 and 69:
42 Chapter 2. On a conjecture about
- Page 70 and 71:
44 Chapter 2. On a conjecture about
- Page 72 and 73:
46 Chapter 2. On a conjecture about
- Page 74 and 75:
48 Chapter 2. On a conjecture about
- Page 76 and 77:
50 Chapter 2. On a conjecture about
- Page 78 and 79:
52 Chapter 2. On a conjecture about
- Page 80 and 81:
54 Chapter 2. On a conjecture about
- Page 82 and 83:
56 Chapter 2. On a conjecture about
- Page 84 and 85:
58 Chapter 2. On a conjecture about
- Page 86 and 87:
60 Chapter 2. On a conjecture about
- Page 88 and 89:
62 Chapter 2. On a conjecture about
- Page 90 and 91:
64 Chapter 2. On a conjecture about
- Page 92 and 93:
66 Chapter 2. On a conjecture about
- Page 94 and 95:
68 Chapter 2. On a conjecture about
- Page 96 and 97:
70 Chapter 2. On a conjecture about
- Page 98 and 99:
72 Chapter 2. On a conjecture about
- Page 100 and 101:
74 Chapter 2. On a conjecture about
- Page 102 and 103:
76 Chapter 2. On a conjecture about
- Page 104 and 105: 78 Chapter 2. On a conjecture about
- Page 106 and 107: 80 Chapter 2. On a conjecture about
- Page 108 and 109: 82 Chapter 2. On a conjecture about
- Page 110 and 111: 84 Chapter 2. On a conjecture about
- Page 112 and 113: 86 Chapter 2. On a conjecture about
- Page 114 and 115: 88 Chapter 2. On a conjecture about
- Page 116 and 117: 90 Chapter 2. On a conjecture about
- 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: 102 Chapter 3. Bent functions and a
- Page 130 and 131: 104 Chapter 3. Bent functions and a
- Page 132 and 133: 106 Chapter 3. Bent functions and a
- Page 134 and 135: 108 Chapter 3. Bent functions and a
- Page 136 and 137: 110 Chapter 4. Efficient characteri
- Page 138 and 139: 112 Chapter 4. Efficient characteri
- Page 140 and 141: 114 Chapter 4. Efficient characteri
- Page 142 and 143: 116 Chapter 4. Efficient characteri
- Page 144 and 145: 118 Chapter 4. Efficient characteri
- Page 146 and 147: 120 Chapter 4. Efficient characteri
- Page 148 and 149: 122 Chapter 4. Efficient characteri
- Page 150 and 151: 124 Chapter 4. Efficient characteri
- Page 152 and 153: 126 Chapter 4. Efficient characteri
- Page 157 and 158: Chapter 5Complex multiplication and
- Page 159 and 160: 5.1. Further background on elliptic
- Page 161 and 162: 5.1. Further background on elliptic
- Page 163 and 164: 5.1. Further background on elliptic
- Page 165 and 166: 5.2. Elliptic curves over the compl
- Page 167 and 168: 5.2. Elliptic curves over the compl
- Page 169 and 170: 5.2. Elliptic curves over the compl
- Page 171 and 172: 5.2. Elliptic curves over the compl
- Page 173 and 174: 5.3. Elliptic curves with complex m
- Page 175 and 176: 5.3. Elliptic curves with complex m
- Page 177 and 178: 5.3. Elliptic curves with complex m
- Page 179 and 180: 5.4. Elliptic curves in cryptograph
- Page 181 and 182: 5.4. Elliptic curves in cryptograph
- Page 183: 5.4. Elliptic curves in cryptograph
- Page 186 and 187: 160 Chapter 6. Complex multiplicati
- Page 188 and 189: 162 Chapter 6. Complex multiplicati
- Page 190 and 191: 164 Chapter 6. Complex multiplicati
- Page 192 and 193: 166 Chapter 6. Complex multiplicati
- Page 194 and 195: 168 Chapter 6. Complex multiplicati
- Page 196 and 197: 170 Chapter 6. Complex multiplicati
- Page 198 and 199: 172 Chapter 6. Complex multiplicati
- Page 200 and 201: 174 Chapter 6. Complex multiplicati
- Page 202 and 203: 176 Chapter 6. Complex multiplicati
- Page 204 and 205:
178 Chapter 6. Complex multiplicati
- Page 206 and 207:
180 Chapter 6. Complex multiplicati
- Page 208 and 209:
182 Chapter 6. Complex multiplicati
- Page 210 and 211:
184 Chapter 6. Complex multiplicati
- Page 213 and 214:
Appendix ACoefficients of f dIn ano
- Page 215 and 216:
Table A.6: Coefficients for d = 6,
- Page 217 and 218:
Bibliography[1] Milton Abramowitz a
- Page 219 and 220:
Bibliography 193[28] Reinier Martij
- Page 221 and 222:
Bibliography 195[57] Brian Conrad.
- Page 223 and 224:
Bibliography 197[87] Andreas Enge a
- Page 225 and 226:
Bibliography 199[116] Alice Chia Pi
- Page 227 and 228:
Bibliography 201[147] Kiran Sridhar
- Page 229 and 230:
Bibliography 203[176] Reynald Lerci
- Page 231 and 232:
Bibliography 205[206] Richard Molon
- Page 233 and 234:
Bibliography 207[239] Goro Shimura
- Page 235 and 236:
Bibliography 209[270] Gerard van de
- Page 237 and 238:
IndexAAbelian variety . . . . . . .
- Page 239 and 240:
Index 213Division polynomial . . .
- Page 241:
Index 215SSemi-bent function . . .
- Page 244 and 245:
218 Résumé longEstragon. — Alor
- Page 246 and 247:
220 Résumé long⊕ ⊕ ⊕s i+L
- Page 248 and 249:
222 Résumé long1.2 D’une conjec
- Page 250 and 251:
224 Résumé longAfin d’utiliser
- Page 252 and 253:
226 Résumé longSon graphe est rep
- Page 254 and 255:
228 Résumé longLa caractérisatio
- Page 256 and 257:
230 Résumé longThéorème 2.4 (Th
- Page 258 and 259:
232 Résumé longprécédent. Dans
- Page 260 and 261:
234 Résumé longProposition 2.13.
- Page 262 and 263:
236 Résumé longFigure 8 - Un tore
- Page 264 and 265:
238 Résumé longAlgorithme 1 - Cal
- Page 266 and 267:
240 Résumé longThéorème 3.8 ([2