, Analysis of the algebraic side channel attack, J. Cryptographic Engineering, vol.2, issue.1, pp.45-62, 2012.
, Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm, pp.595-635, 2014.
, Quintic polynomials of, In : Int. J. Number Theory, vol.54, pp.555-571, 2009.
, Efficient arithmetic in successive algebraic extension fields using symmetries, In : Math. Comput. Sci, vol.63, pp.217-233, 2012.
, Combined Attack on CRT-RSA -Why Public Verification Must Not Be Public, Actes de conférences internationales avec comité de programme Public-Key Cryptography -PKC 2013 -16th International Conference on Practice and Theory in Public-Key Cryptography Proceedings. PDF. 2013, pp.198-215, 2013.
, Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences, Public-Key Cryptography -PKC 2014 -17th International Conference on Practice and Theory in Public-Key Cryptography Proceedings. PDF. 2014, pp.185-202, 2014.
, Factoring N = p r q s for Large r and s " . In : Topics in Cryptology -CT-RSA 2016 -The Cryptographers' Track at the RSA Conference 2016, Proceedings. PDF. 2016, pp.448-464, 2016.
, Subcubic change of ordering for Gröbner basis: a probabilistic approach, International Symposium on Symbolic and Algebraic Computation, pp.170-177, 2014.
, Attacking (EC)DSA Given Only an Implicit Hint, Selected Areas in Cryptography, 19th International Conference, SAC 2012, pp.252-274, 2012.
, Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus, Advances in Cryptology -EUROCRYPT 2014 -33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings. PDF. 2014, pp.40-57, 2014.
, Implicit Factoring with Shared Most Significant and Middle Bits, Public Key Cryptography -PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography Proceedings. PDF. 2010, pp.70-87, 2010.
, Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields, Advances in Cryptology -EUROCRYPT 2012 -31st Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings. PDF. 2012, pp.27-44, 2012.
, Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time, Lecture Notes in Comput. Sci. PDF, pp.278-297, 2010.
, Computation schemes for splitting fields of polynomials, ISSAC 2009?Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation. PDF, pp.279-286, 2009.
, Multi-modular algorithm for computing the splitting field of a polynomial, pp.247-254, 2008.
, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, International Algorithmic Number Theory Symposium, pp.28-40, 1994.
, Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice, Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp.5-17, 2015.
, A Subfield Lattice Attack on Overstretched NTRU Assumptions -Cryptanalysis of Some FHE and Graded Encoding Schemes, Advances in Cryptology -CRYPTO 2016 -36th Annual International Cryptology Conference Proceedings, Part I. 2016, pp.153-178, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01394211
, GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias, Advances in Cryptology -ASIACRYPT 2014 -20th International Conference on the Theory and Application of Cryptology and Information Security, pp.262-281, 2014.
DOI : 10.1007/978-3-662-45611-8_14
URL : https://hal.archives-ouvertes.fr/hal-01094002
, Elliptic curves and primality proving, Mathematics of Computation 61.203 (juil. 1993), pp.29-68
DOI : 10.1090/S0025-5718-1993-1199989-X
URL : https://hal.archives-ouvertes.fr/inria-00075302
, Combined Attack on CRT-RSA -Why Public Verification Must Not Be Public, Public-Key Cryptography -PKC 2013 -16th International Conference on Practice and Theory in Public-Key Cryptography Proceedings. PDF. 2013, pp.198-215, 2013.
, A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic, Advances in Cryptology -EUROCRYPT 2014 -33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.1-16, 2014.
, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations, International Conference on Polynomial System Solving -ICPSS, pp.71-75, 2004.
, Binary Permutation Polynomial Inversion and Application to Obfuscation Techniques, To appear in 2nd ACM International Workshop on Software Protection, SPRO 2016, pp.1-9, 2016.
, Toward a Rigorous Variation of Coppersmith's Algorithm on Three Variables, Advances in Cryptology -EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings. Sous la dir. de Moni NAOR. T. 4515. Lecture Notes in Computer Science, pp.361-378, 2007.
, The shape of the Shape Lemma, Proceedings of the international symposium on Symbolic and algebraic computation. ISSAC '94, pp.129-133, 1994.
, Gröbner bases. T. 141. Graduate Texts in Mathematics . A computational approach to commutative algebra, In cooperation with Heinz Kredel, pp.574-574, 1993.
, Twisted Edwards Curves, Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology. AFRICACRYPT'08, pp.389-405, 2008.
DOI : 10.1007/978-3-540-68164-9_26
, Faster Addition and Doubling on Elliptic Curves, Advances in Cryptology : ASIACRYPT 2007. T. 4833. Lecture Notes in Computer Science, pp.29-50, 2007.
, Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences, Public-Key Cryptography -PKC 2014 -17th International Conference on Practice and Theory in Public-Key Cryptography Proceedings. PDF. 2014, pp.185-202, 2014.
, A polynomial time algorithm for computing the HNF of a module over the integers of a number field, International Symposium on Symbolic and Algebraic Computation, pp.75-82, 2012.
, Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.893-902, 2016.
, Comparative Evaluation of the Effectiveness of Constraint Solvers against Opaque Conditionals, Poster presented during the 36th IEEE Symposium on Security and Privacy
, Effectiveness of Synthesis in Concolic Deobfuscation " . working paper or preprint, 2015.
, Gröbner bases over algebraic number fields, Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, pp.16-24, 2015.
, On the Importance of Checking Cryptographic Protocols for Faults, pp.37-51, 1997.
DOI : 10.1007/3-540-69053-0_4
, Cryptanalysis of RSA with private key d less than N 0.292, IEEE Transactions on Information Theory, vol.464, p.1339, 2000.
, Factoring N = p r q for Large r, Advances in Cryptology -CRYPTO '99, 19th Annual International Cryptology Conference Proceedings, pp.326-337, 1999.
, Identity-Based Encryption from the Weil Pairing Advances in Cryptology -CRYPTO, 21st Annual International Cryptology Conference, pp.213-229, 2001.
, On De Moivre's Quintic, The American Mathematical Monthly, vol.1510, pp.171-174, 1908.
, Fast Algorithms for Zero-Dimensional Polynomial Systems Using Duality, Applicable Algebra in Engineering, Communication and Computing, pp.239-272, 2003.
, Fast Exhaustive Search for Quadratic Systems in F 2 on FPGAs, Selected Areas in Cryptography -SAC 2013 -20th International Conference, pp.205-222, 2013.
, Efficient Indifferentiable Hashing into Ordinary Elliptic Curves, pp.237-254, 2009.
, Reducing lattice bases by means of approximations, Algorithmic Number Theory ? Proc. ANTS-I. T. 877. Lecture Notes in Computer Science, pp.160-168, 1994.
, Analysis of the algebraic side channel attack, J. Cryptographic Engineering, vol.2, issue.1, pp.45-62, 2012.
, Usage des fonctions interpolaires dans la détermination des fonctions symétriques des racines d'une équation algébrique donnée, pp.473-108, 1840.
, Square Always Exponentiation, pp.40-57, 2011.
, Engineering Code Obfuscation Invited talk at EUROCRYPT'16, 2016.
, Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known, Advances in Cryptology -Proc. EUROCRYPT '96. T. 1070. Lecture Notes in Computer Science, pp.178-189, 1996.
, Finding a Small Root of a Univariate Modular Equation, Advances in Cryptology -Proc. EUROCRYPT '96. T. 1070. Lecture Notes in Computer Science, pp.155-165, 1996.
, Finding Small Solutions to Small Degree Polynomials, Cryptography and Lattices, International Conference, pp.20-31, 2001.
, Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities, In : J. Cryptology Journal version, vol.1035, issue.34, pp.233-260, 1997.
, Factoring N = p r q s for Large r and s " . In : Topics in Cryptology -CT-RSA 2016 -The Cryptographers' Track at the RSA Conference 2016, Proceedings. PDF. 2016, pp.448-464, 2016.
, The Effectiveness of Lattice Attacks Against Low-Exponent RSA, Public Key Cryptography ? Proc. PKC '99. T. 1560. Lecture Notes in Computer Science, pp.204-218, 1999.
, Galois invariant smoothness basis, In : Series on Number Theory and Its Applications World Scientific, vol.5, pp.142-167, 2008.
, Fast Decipherment Algorithm for RSA Public- Key Cryptosystem, Electronics Letters, vol.1821, pp.905-907, 1982.
, Ideals, varieties, and algorithms. Second. Undergraduate Texts in Mathematics. An introduction to computational algebraic geometry and commutative algebra, p.536, 1997.
, Galois theory, Pure and Applied Mathematics, pp.559-559
, Sharp estimates for triangular sets, Symbolic and Algebraic Computation, International Symposium ISSAC 2004 Proceedings, pp.103-110, 2004.
, An Upper Bound on the Average Number of Iterations of the LLL Algorithm, In : Theor. Comput. Sci, vol.1231, pp.95-115, 1994.
, Accelerating Lattice Reduction with FPGAs, Progress in Cryptology -LATINCRYPT 2010, First International Conference on Cryptology and Information Security in Latin America, pp.124-143, 2010.
, On the discrete logarithm problem in class groups of curves, Mathematics of Computation, vol.80, issue.273, pp.443-475, 2011.
DOI : 10.1090/S0025-5718-2010-02281-1
, Abstract, Compositio Mathematica, vol.6, issue.01, pp.75-104, 2011.
DOI : 10.1112/S0010437X10005075
, On Second-Order Fault Analysis Resistance for CRT-RSA Implementations, pp.68-83, 2009.
, Redundant Modular Reduction Algorithms, pp.102-114, 2011.
, A Normal Form for Elliptic Curves, In : Bulletin of the American Mathematical Society. T. Juil, vol.44, pp.393-422, 2007.
, An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves, J. Cryptology, vol.241, pp.24-41, 2011.
, Computing generator in cyclotomic integer rings, IACR Cryptology ePrint Archive 2016, p.957, 2016.
, Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three, Selected Areas in Cryptography , 19th International Conference, pp.135-148, 2012.
, Fast Algorithm for Change of Ordering of Zero-dimensional Gröbner Bases with Sparse Multiplication Matrices, ISSAC '11: Proceedings of the 2011 international symposium on Symbolic and algebraic computation. ISSAC '11, pp.1-8, 2011.
, A New Efficient Algorithm for Computing Gröbner Bases (F4), In : Journal of Pure and Applied Algebra, vol.139, pp.1-3, 1999.
, A New Efficient Algorithm for Computing Gröbner Bases without Reduction to Zero (F5), Proceedings of the 2002 international symposium on Symbolic and algebraic computation. ISSAC '02, pp.75-83, 2002.
, On the complexity of computing Gröbner bases for weighted homogeneous systems, J. Symb. Comput, vol.76, pp.107-141, 2016.
, Fast change of ordering with exponent !, In : (Poster abstract) ACM Commun. Comput. Algebra, vol.46, pp.92-93
, Polynomial Systems Solving by Fast Linear Algebra
, Subcubic change of ordering for Gröbner basis: a probabilistic approach, International Symposium on Symbolic and Algebraic Computation, pp.170-177, 2014.
, Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm, pp.595-635, 2014.
, Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering, Journal of Symbolic Computation, vol.164, pp.329-344, 1993.
, Attacking (EC)DSA Given Only an Implicit Hint, Selected Areas in Cryptography, 19th International Conference, SAC 2012, pp.252-274, 2012.
, Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus, Advances in Cryptology -EUROCRYPT 2014 -33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings. PDF. 2014, pp.40-57, 2014.
, Implicit Factoring with Shared Most Significant and Middle Bits, Public Key Cryptography -PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography Proceedings. PDF. 2010, pp.70-87, 2010.
, Fast Algorithm for Change of Ordering of Zero-dimensional Gröbner Bases with Sparse Multiplication Matrices, ISSAC '11: Proceedings of the 2011 international symposium on Symbolic and algebraic computation . ISSAC '11, pp.1-8, 2011.
, Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields, Advances in Cryptology -EUROCRYPT 2012 -31st Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings. PDF. 2012, pp.27-44, 2012.
, Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form, Advances in Cryptology -ASIACRYPT 2014 -20th International Conference on the Theory and Application of Cryptology and Information Security Proceedings, Part I. 2014, pp.21-41, 2014.
, Sparse Gröbner bases: the unmixed case, International Symposium on Symbolic and Algebraic Computation, pp.178-185, 2014.
, Gröbner bases of ideals invariant under a commutative group: the non-modular case, International Symposium on Symbolic and Algebraic Computation, pp.347-354, 2013.
, Computation of Galois groups of rational polynomials, In : LMS Journal of Computation and Mathematics, vol.17, issue.1, pp.141-158, 2014.
, Deterministic Encoding and Hashing to Odd Hyperelliptic Curves, Pairing-Based Cryptography -Pairing 2010 -4th International Conference, pp.265-277, 2010.
, A kilobit hidden SNFS discrete logarithm computation, IACR Cryptology ePrint Archive 2016, p.961, 2016.
, The Residue Number System, IRE Transactions on Electronic Computers, vol.86, pp.140-147, 1959.
DOI : 10.1109/tec.1959.5219515
, Modern computer algebra, pp.1-785, 2003.
DOI : 10.1017/CBO9781139856065
, An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves, Advances in Cryptology -EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, pp.19-34, 2000.
, Index Calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, Journal of Symbolic Computation, vol.4412, pp.1690-1702, 2009.
, A double large prime variation for small genus hyperelliptic index calculus, In : Math. Comput, vol.76257, pp.475-492, 2007.
, Algebraic Solution of Systems of Polynomial Equations using Gröbner Bases Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proceedings of AAECC-5, pp.247-257, 1989.
, Lattice Attacks against Elliptic-Curve Signatures with Blinded Scalar Multiplication, Selected Areas in Cryptography -SAC 2016. Sous la dir. de Roberto AVANZI et Howard HEYS. Selected Areas in Cryptography -SAC 2016, 2016.
, Cryptanalysis with COPACOBANA, IEEE Trans. Computers, vol.5711, pp.1498-1513, 2008.
, Xeon+FPGA Platform for the Data Center (presentation only), The Fourth Workshop on the Intersections of Computer Architecture and Reconfigurable Logic, 2015.
, Generating subfields, J. Symb. Comput, vol.52, pp.17-34, 2013.
, Finding Small Roots of Univariate Modular Equations Revisited, Cryptography and Coding ? Proc. IMA '97. T. 1355. Lecture Notes in Computer Science, pp.131-142, 1997.
, How to Hash into Elliptic Curves, pp.303-316, 2009.
DOI : 10.1007/978-3-642-03356-8_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5920
, On Finding Small Solutions of Modular Multivariate Polynomial Equations, Advances in Cryptology -EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, pp.158-170, 1998.
, Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time, Lecture Notes in Comput. Sci. PDF, pp.278-297, 2010.
, Reflection Groups and Invariant Theory, 2001.
, Fast Algorithms for the Characteristic Polynomial, Theor. Comput. Sci, vol.36, issue.2, pp.309-317, 1985.
, Quintic polynomials of, In : Int. J. Number Theory, vol.54, pp.555-571, 2009.
, Réflexions sur la résolution algébrique des équations, Nouveaux Mémoires de l'Académie Royale des Sciences et Belles-Lettres de Berlin, pp.1770-1771
, On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal, Proceedings of the twenty-second annual ACM symposium on Theory of computing. STOC '90, pp.555-563, 1990.
, On the Complexity of Zero-Dimensional Algebraic Systems, Effective methods in algebraic geometry. T. 94. Birkhauser, p.217, 1991.
, Polynomial Time Algorithms for Galois Groups, EUROSAM 84, International Symposium on Symbolic and Algebraic Computation Proceedings. Computation, pp.225-236, 1984.
, Solvability by Radicals is in Polynomial Time, Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp.25-27
, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations In : Computer Algebra. Sous la dir, Lecture Notes in Computer Science, pp.146-156, 1983.
, Solving zero-dimensional algebraic systems, Journal of Symbolic Computation, vol.13, issue.2, pp.117-131, 1992.
DOI : 10.1016/S0747-7171(08)80086-7
URL : http://doi.org/10.1016/s0747-7171(08)80086-7
, Computing subfields: Reverse of the primitive element problem, Computational algebraic geometry. Birkhäuser, pp.163-176, 1993.
, Algorithms for the universal decomposition algebra, International Symposium on Symbolic and Algebraic Computation, pp.234-241, 2012.
, Explicit constructions in splitting fields of polynomials, In : Riv. Mat. Univ. Parma, issue.7, pp.3-233, 2004.
, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.513-534, 1982.
DOI : 10.1007/BF01457454
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.318
, Lattices with Symmetry, In : IACR Cryptology ePrint Archive, vol.2014, p.1026, 2014.
DOI : 10.1145/2465506.2465929
, Revisiting the Gentry-Szydlo Algorithm Advances in Cryptology -CRYPTO 2014 -34th Annual Cryptology Conference, Proceedings, Part I. 2014, pp.280-296, 2014.
, Efficient Gröbner Basis Reductions for Formal Verification of Galois Field Arithmetic Circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.32, issue.9, pp.1409-1420
DOI : 10.1109/TCAD.2013.2259540
, NP-Complete decision problems for binary quadratics, In : Journal of Computer and System Sciences, vol.16, issue.2, pp.168-184, 1978.
, Using LLL-Reduction for Solving RSA and Factorization Problems, p.116, 2010.
DOI : 10.1007/978-3-642-02295-1_10
, Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint In : Public Key Cryptography -PKC, 12th International Conference on Practice and Theory in Public Key Cryptography, pp.1-14, 2009.
, Finding relations among the roots of an irreducible polynomial, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.75-77, 1997.
DOI : 10.1145/258726.258752
, Asymptotic Acceleration of Solving Multivariate Polynomial Systems of Equations, Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp.488-496, 1998.
, Software watermarking via opaque predicates: Implementation, analysis, and attacks, In : Electronic Commerce Research, vol.6, issue.2, pp.155-171, 2006.
, On Adaptive Lattice Reduction over Correlated Fading Channels, IEEE Transactions on Communications, vol.59, issue.5, pp.1224-1227, 2011.
DOI : 10.1109/TCOMM.2011.022811.090576
, An LLL Algorithm with Quadratic Complexity, SIAM Journal on Computing, vol.39, issue.3, pp.874-903, 2009.
DOI : 10.1137/070705702
URL : https://hal.archives-ouvertes.fr/hal-00550981
, The LLL Algorithm: Survey and Applications. Information Security and Cryptography, 2010.
DOI : 10.1007/978-3-642-02295-1
URL : https://hal.archives-ouvertes.fr/hal-01141414
, The Insecurity of the Digital Signature Algorithm with Partially Known Nonces, In : J. Cryptology, vol.153, pp.151-176, 2002.
, An LLL-reduction algorithm with quasi-linear time complexity: extended abstract, Proc. STOC '11, pp.403-412, 2011.
, Computation schemes for splitting fields of polynomials, ISSAC 2009?Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation. PDF, pp.279-286, 2009.
, Efficient arithmetic in successive algebraic extension fields using symmetries, In : Math. Comput. Sci, vol.63, pp.217-233, 2012.
, Word-Level Abstraction from Bit-Level Circuits using Gröbner Bases. Paper presented during the International Workshop on Logic and Synthesis
, A Modular Method for Computing the Splitting Field of a Polynomial, In : ANTS, pp.124-140, 2006.
DOI : 10.1007/11792086_10
URL : https://hal.archives-ouvertes.fr/hal-01337040
, Computation of the splitting field of a dihedral polynomial, pp.290-297, 2006.
, Introduction à la Théorie de Galois Effective In : JNCF'08: Journées Nationales du Calcul Formel (online). PDF, Slides, pp.141-197, 2008.
, Introduction à l'Algorithmique Galoisienne, Invited talk at Mathematik Park (Institut Henri Poincaré), Slides, 2011.
, On polynomial systems with structures related to the ECDLP, Invited talk during the Conference Effective Moduli Spaces and Applications to Cryptography, 2014.
, On Using Torsion Points in the Elliptic Curve Index Calculus, Invited talk during the 18th Workshop On Elliptic Curve Cryptography, 2014.
, The Heuristic Coppersmith Technique from a Computer Algebra Point of View, 2013.
, On the p-adic stability of the FGLM algorithm, p.848, 1602.
, A modular method for computing the splitting field of a polynomial, Algorithmic number theory. T. 4076. Lecture Notes in Comput. Sci, pp.124-140, 2006.
, Multi-modular algorithm for computing the splitting field of a polynomial, pp.247-254, 2008.
, On efficiently calculating small solutions of systems of polynomial equations: lattice-based methods and applications to cryptography, Thèse de doct, 2010.
, Further results on implicit factoring in polynomial time, In : Adv. in Math. of Comm, vol.3, issue.2, pp.205-217, 2009.
, Summation Polynomials and the Discrete Logarithm Problem on Elliptic Curves, Cryptology ePrint Archive Report, 2004.
, Construction of Rational Points on Elliptic Curves over Finite Fields, pp.510-524, 2006.
DOI : 10.1007/11792086_36
URL : https://works.bepress.com/andrew_shallue/1/download/
, Finite unitary reflection groups, In : Canadian J. Math, vol.6, pp.274-304, 1954.
, OAEP Reconsidered, In : J. Cryptology, vol.154, pp.223-249, 2002.
, Rational Points on Certain Hyperelliptic Curves over Finite Fields, Bulletin of the Polish Academy of Sciences Mathematics, vol.55, issue.2, pp.97-104, 2007.
DOI : 10.4064/ba55-2-1
URL : http://arxiv.org/abs/0706.1448
, Matrix-F5 algorithms over finite-precision complete discrete valuation fields, International Symposium on Symbolic and Algebraic Computation, IS- SAC '14, pp.397-404, 2014.
, Harder, better, faster, stronger: elliptic curve discrete logarithm computations on FPGAs, In : J. Cryptographic Engineering, vol.64, pp.287-297, 2016.
, Algorithms for Galois Group Computations over Multivariate Function Fields, In : Bulletin of the Australian Mathematical Society, vol.941, pp.169-170, 2016.
, Defeating RSA Multiply-Always and Message Blinding Countermeasures, pp.77-88, 2011.
, A modular method for computing the Galois groups of polynomials Algorithms for algebra, J. Pure Appl. Algebra, vol.117118, pp.617-636, 1996.
, Information Hiding in Software with Mixed Boolean-Arithmetic Transforms Information Security Applications: 8th International Workshop Revised Selected Papers. Sous la dir, pp.61-75, 2007.