Bibliography
Publications of the year
Doctoral Dissertations and Habilitation Theses
-
1G. Bisson.
Endomorphism Rings in Cryptography, Institut National Polytechnique de Lorraine - INPL and Technische Universiteit Eindhoven, July 2011.
http://hal. inria. fr/ tel-00609211/ en -
2R. Cosset.
Applications des fonctions thêta à la cryptographie sur courbes hyperelliptiques., Université Henri Poincaré - Nancy I, November 2011.
http://hal. inria. fr/ tel-00642951/ en
Articles in International Peer-Reviewed Journal
-
3J.-L. Beuchat, J. Detrey, N. Estibals, E. Okamoto, F. Rodríguez-Henríquez.
Fast architectures for the pairing over small-characteristic supersingular elliptic curves, in: IEEE Transactions on Computers, February 2011, vol. 60, no 2, p. 266-281. [ DOI : 10.1109/TC.2010.163 ]
http://hal. inria. fr/ inria-00424016/ en -
4G. Bisson.
Computing endomorphism rings of elliptic curves under the GRH, in: Journal of Mathematical Cryptology, June 2011, vol. 5, no 2, p. 101-113, 11 pages, 1 figure. [ DOI : 10.1515/JMC.2011.008 ]
http://hal. inria. fr/ inria-00560258/ en -
5G. Bisson, A. V. Sutherland.
A low-memory algorithm for finding short product representations in finite groups, in: Designs, Codes and Cryptography, 2011, 12 pages. [ DOI : 10.1007/s10623-011-9527-8 ]
http://hal. inria. fr/ inria-00560256/ en -
6G. Bisson, A. V. Sutherland.
Computing the endomorphism ring of an ordinary elliptic curve over a finite field, in: Journal of Number Theory, 2011, vol. 131, no 5, p. 815–831. [ DOI : 10.1016/j.jnt.2009.11.003 ]
http://hal. inria. fr/ inria-00383155/ en -
7R. Brent, P. Zimmermann.
The Great Trinomial Hunt, in: Notices of the AMS, 2011, vol. 58, no 2, p. 233-239.
http://hal. inria. fr/ inria-00443797/ en -
8A. Enge, P. Gaudry, E. Thomé.
An Discrete Logarithm Algorithm for Low Degree Curves, in: Journal of Cryptology, 2011, vol. 24, p. 24-41. [ DOI : 10.1007/s00145-010-9057-y ]
http://hal. inria. fr/ inria-00383941/ en -
9J.-C. Faugère, D. Lubicz, D. Robert.
Computing modular correspondences for abelian varieties, in: Journal of Algebra, 2011, vol. 343, no 1, p. 248-277. [ DOI : 10.1016/j.jalgebra.2011.06.031 ]
http://hal. inria. fr/ hal-00426338/ en -
10P. Gaudry, É. Schost.
Genus 2 point counting over prime fields, in: Journal of Symbolic Computation, 2011, To appear.
http://hal. inria. fr/ inria-00542650/ en -
11D. Lubicz, D. Robert.
Computing isogenies between Abelian Varieties, in: Compositio Mathematica, 2011, 47 pages, to appear.
http://hal. inria. fr/ hal-00446062/ en -
12G. Melquiond, G. Nowak, P. Zimmermann.
Numerical Approximation of the Masser-Gramain Constant to Four Decimal Digits: delta=1.819..., in: Mathematics of Computation, 2011.
http://hal. inria. fr/ hal-00644166/ en -
13T. Prest, P. Zimmermann.
Non-Linear Polynomial Selection for the Number Field Sieve, in: Journal of Symbolic Computation, 2011.
http://hal. inria. fr/ inria-00540483/ en
International Conferences with Proceedings
-
14M. A. Abdelraheem, C. Blondeau, M. Naya-Plasencia, M. Videau, E. Zenner.
Cryptanalysis of ARMADILLO2, in: The 17th Annual International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2011, Séoul, Korea, Republic Of, 2011.
http://hal. inria. fr/ inria-00619236/ en -
15D. Aranha, J.-L. Beuchat, J. Detrey, N. Estibals.
Optimal Eta pairing on supersingular genus-2 binary hyperelliptic curves, in: Cryptographer's Track at the RSA Conference 2012 (CT-RSA 2012), San Francisco, United States, O. Dunkelman (editor), Springer, February 2012, 19 p.
http://hal. inria. fr/ inria-00540002/ en -
16V. Cortier, J. Detrey, P. Gaudry, F. Sur, E. Thomé, M. Turuani, P. Zimmermann.
Ballot stuffing in a postal voting system, in: Revote 2011 - International Workshop on Requirements Engineering for Electronic Voting Systems, Trento, Italy, IEEE, 2011, p. 27 - 36. [ DOI : 10.1109/REVOTE.2011.6045913 ]
http://hal. inria. fr/ inria-00612418/ en -
17J. Detrey, P. Gaudry, K. Khalfallah.
A low-area yet performant FPGA implementation of Shabal, in: 17th International Workshop on Selected Areas in Cryptography, SAC 2010, Waterloo, Canada, A. Biryukov, G. Gong, D. Stinson (editors), Lecture Notes in Computer Science, Springer, 2010, vol. 6544, p. 99-113, The original publication is available at www.springerlink.com. [ DOI : 10.1007/978-3-642-19574-7_7 ]
http://hal. inria. fr/ inria-00498705/ en -
18T. Fuhr, H. Gilbert, J.-R. Reinhard, M. Videau.
Analysis of the Initial and Modified Versions of the Candidate 3GPP Integrity Algorithm 128-EIA3, in: Selected Areas in Cryptography 2011, Toronto, Canada, 2011.
http://hal. inria. fr/ inria-00619235/ en -
19P. Gaudry, D. Kohel, B. Smith.
Counting Points on Genus 2 Curves with Real Multiplication, in: ASIACRYPT, Seoul, Korea, Republic Of, D. H. Lee, X. Wang (editors), Lecture Notes in Computer Science, Springer, November 2011, vol. 7073, p. 504-519. [ DOI : 10.1007/978-3-642-25385-0_27 ]
http://hal. inria. fr/ inria-00598029/ en -
20D. Harvey, P. Zimmermann.
Short Division of Long Integers, in: 20th IEEE Symposium on Computer Arithmetic (ARITH-20), Tuebingen, Germany, E. Antelo, D. Hough, P. Ienne (editors), IEEE, 2011, p. 7-14. [ DOI : 10.1109/ARITH.2011.11 ]
http://hal. inria. fr/ inria-00612232/ en
Internal Reports
-
21R. Barbulescu.
Improvements on the Discrete Logarithm Problem in GF(p), INRIA, April 2011.
http://hal. inria. fr/ inria-00588713/ en
Scientific Popularization
-
22P. Gaudry, E. Thomé, P. Zimmermann.
RSA : la fin des clés de 768 bits, in: Techniques de l'Ingenieur, 2011, no IN131.
http://hal. inria. fr/ hal-00641592/ en
Other Publications
-
23C. Arene, R. Cosset.
Construction of a k-complete addition law on abelian surfaces with rational theta constants, 2011, Preprint, 13 pages.
http://hal. inria. fr/ hal-00645652/ en -
24R. Cosset, D. Robert.
Computing (l,l)-isogenies in polynomial time on Jacobians of genus 2 curves, 2011, Preprint, 22 pages.
http://hal. inria. fr/ hal-00578991/ en -
25P. Molin.
Multi-precision computation of the complex error function, 2011, Preprint, 10 pages.
http://hal. inria. fr/ hal-00580855/ en
-
26N. Koblitz.
Hyperelliptic cryptosystems, in: J. Cryptology, 1989, vol. 1, p. 139–150. -
27M. Scott.
New record breaking implementations of ECC on quadratic extensions using endomorphisms, September 2008, Invited talk at the ECC 2008 Conference. Utrecht, the Netherlands, Sep. 22-24, 2008.