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

More documents

Recommendations

Info

198 Bibliography[102] David Freeman, Peter Stevenhagen, and Marco Streng. Abelian varieties with prescribedembedding degree. In van der Poorten and Stein [271], pages 60–73. (Cited on page 183.)[103] David Mandell Freeman. Constructing Abelian Varieties for Pairing-Based Cryptography.PhD thesis, University of California, Berkeley, 2008. (Cited on page 184.)[104] Gerhard Frey and Hans-Georg Rück. A remark concerning m-divisibility and the discretelogarithm in the divisor class group of curves. Math. Comp., 62(206):865–874, 1994. (Citedon pages 137 and 155.)[105] Harry Furstenberg. Algebraic functions over finite fields. J. Algebra, 7:271–277, 1967. (Citedon page 73.)[106] Edgar Gabriel, Graham Edward Fagg, George Bosilca, Thara Angskun, Jack J. Dongarra,Jeffrey Michael Squyres, Vishal Sahay, Prabhanjan Kambadur, Brian Barrett, AndrewLumsdaine, Ralph Henri Castain, David J. Daniel, Richard Lewis Graham, and Timothy S.Woodall. Open MPI: Goals, concept, and design of a next generation MPI implementation.In Proceedings, 11th European PVM/MPI Users’ Group Meeting, pages 97–104, Budapest,Hungary, September 2004. (Cited on pages 89 and 227.)[107] Steven D. Galbraith. Mathematics of Public Key Cryptography. Cambridge UniversityPress, 2011. http://www.math.auckland.ac.nz/~sgal018/crypto-book/crypto-book.html. (Cited on pages 99 and 105.)[108] Kseniya Garaschuk and Petr Lisoněk. On binary Kloosterman sums divisible by 3. Des.Codes Cryptography, 49(1-3):347–357, 2008. (Cited on page 120.)[109] Pierrick Gaudry. A comparison and a combination of SST and AGM algorithms for countingpoints of elliptic curves in characteristic 2. In Yuliang Zheng, editor, ASIACRYPT, volume2501 of Lecture Notes in Computer Science, pages 311–327. Springer, 2002. (Cited onpage 107.)[110] Pierrick Gaudry. Hyperelliptic curves and the HCDLP. In Advances in elliptic curvecryptography, volume 317 of London Math. Soc. Lecture Note Ser., pages 133–150. CambridgeUniv. Press, Cambridge, 2005. (Cited on page 105.)[111] Pierrick Gaudry and Robert Harley. Counting points on hyperelliptic curves over finitefields. In Wieb Bosma, editor, ANTS, volume 1838 of Lecture Notes in Computer Science,pages 313–332. Springer, 2000. (Cited on page 107.)[112] Pierrick Gaudry, Thomas Houtmann, David Russell Kohel, Christophe Ritzenthaler, andAnnegret Weng. The 2-adic CM method for genus 2 curves with application to cryptography.In Lai and Chen [158], pages 114–129. (Cited on page 184.)[113] Pierrick Gaudry and Éric Schost. Construction of secure random curves of genus 2 overprime fields. In Cachin and Camenisch [34], pages 239–256. (Cited on page 107.)[114] Alice Chia Ping Gee. Class invariants by Shimura’s reciprocity law. J. Théor. NombresBordeaux, 11(1):45–72, 1999. Les XXèmes Journées Arithmétiques (Limoges, 1997). (Citedon page 153.)[115] Alice Chia Ping Gee. Class fields by Shimura reciprocity. PhD thesis, Universiteit Leiden,2001. (Cited on page 153.)
Bibliography 199[116] Alice Chia Ping Gee and Peter Stevenhagen. Generating class fields using Shimura reciprocity.In Joe Buhler, editor, ANTS, volume 1423 of Lecture Notes in Computer Science, pages441–453. Springer, 1998. (Cited on page 153.)[117] Johann Wolfgang von Goethe. Faust. Eine Tragödie von Goethe. J. G. Cotta, 1808. (Citedon page 217.)[118] Guang Gong and Solomon Wolf Golomb. Transform domain analysis of DES. IEEETransactions on Information Theory, 45(6):2065–2073, 1999. (Cited on page 96.)[119] Eyal Zvi Goren and Kristin Estella Lauter. Class invariants for quartic CM fields. Ann.Inst. Fourier (Grenoble), 57(2):457–480, 2007. (Cited on page 184.)[120] Eyal Zvi Goren and Kristin Estella Lauter. Genus 2 curves with complex multiplication.International Mathematics Research Notices, 2011. (Cited on page 184.)[121] Aline Gouget and Hervé Sibert. Revisiting correlation-immunity in filter generators. InCarlisle Michael Adams, Ali Miri, and Michael James Wiener, editors, Selected Areas inCryptography, volume 4876 of Lecture Notes in Computer Science, pages 378–395. Springer,2007. (Cited on page 10.)[122] Ronald Lewis Graham, Donald Ervin Knuth, and Oren Patashnik. Concrete mathematics.Addison-Wesley Publishing Company, Reading, MA, second edition, 1994. A foundation forcomputer science. (Cited on pages 34, 54, and 55.)[123] Faruk Göloğlu, Petr Lisoněk, Gary McGuire, and Richard Moloney. Binary Kloostermansums modulo 256 and coefficients of the characteristic polynomial. Information Theory,IEEE Transactions on, PP(99):1, 2012. (Cited on page 120.)[124] Faruk Göloğlu, Gary McGuire, and Richard Moloney. Binary Kloosterman sums usingStickelberger’s theorem and the Gross-Koblitz formula. Acta Arith., 148(3):269–279, 2011.(Cited on page 120.)[125] Franz Halter-Koch. Ideal semigroups of Noetherian domains and Ponizovski decompositions.J. Pure Appl. Algebra, 209(3):763–770, 2007. (Cited on page 177.)[126] Robert Harley. Asymptotically optimal p-adic point-counting. Email to NMBRTHRYlist, December 2002. http://listserv.nodak.edu/cgi-bin/wa.exe?A2=ind0212&L=nmbrthry&T=0&P=1343. (Cited on pages 107, 121, 123, and 230.)[127] William Hart, Sebastian Pancratz, Andy Novocin, Fredrik Johansson, and David Harvey.FLINT: Fast Library for Number Theory – Version 2.2, june 2011. www.flintlib.org.(Cited on pages 89 and 227.)[128] Robin Hartshorne. Algebraic geometry. Springer-Verlag, New York, 1977. Graduate Textsin Mathematics, No. 52. (Cited on pages 133, 134, and 135.)[129] Tor Helleseth and Victor Zinoviev. On Z 4 linear Goethals codes and Kloosterman sums.Des. Codes Cryptography, 17(1-3):269–288, 1999. (Cited on pages 119, 120, and 231.)[130] Florian Heß. A note on the Tate pairing of curves over finite fields. Arch. Math. (Basel),82(1):28–32, 2004. (Cited on page 137.)[131] Florian Heß, Nigel Paul Smart, and Frederik Vercauteren. The eta pairing revisited. IEEETransactions on Information Theory, 52(10):4595–4602, 2006. (Cited on page 155.)
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:
Page 174 and 175: 148 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 222 and 223: 196 Bibliography[72] Cunsheng Ding,
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?