Personnel
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 5B. Allombert, N. Brisebarre, A. Lasjaunias.
    On a two-valued sequence and related continued fractions in power series fields, in: The Ramanujan Journal, 2017, https://arxiv.org/abs/1607.07235, forthcoming. [ DOI : 10.1007/s11139-017-9892-7 ]
    https://hal.archives-ouvertes.fr/hal-01348576
  • 6P. Boito, Y. Eidelman, L. Gemignani.
    A Real QZ Algorithm for Structured Companion Pencils, in: Calcolo, July 2017, https://arxiv.org/abs/1608.05395. [ DOI : 10.1007/s10092-017-0231-6 ]
    https://hal.inria.fr/hal-01407864
  • 7P. Boito, Y. Eidelman, L. Gemignani.
    Efficient Solution of Parameter Dependent Quasiseparable Systems and Computation of Meromorphic Matrix Functions, in: Numerical Linear Algebra with Applications, 2017, forthcoming.
    https://hal.inria.fr/hal-01407857
  • 8P. Boito, R. Grena.
    Optimal focal length of primary mirrors in Fresnel linear collectors, in: Solar Energy, October 2017, vol. 155, pp. 1313 - 1318. [ DOI : 10.1016/j.solener.2017.07.079 ]
    https://hal.inria.fr/hal-01647602
  • 9S. Boldo, S. Graillat, J.-M. Muller.
    On the robustness of the 2Sum and Fast2Sum algorithms, in: ACM Transactions on Mathematical Software, July 2017, vol. 44, no 1.
    https://hal-ens-lyon.archives-ouvertes.fr/ensl-01310023
  • 10A. Bostan, L. Dumont, B. Salvy.
    Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity, in: Journal of Symbolic Computation, 2017, vol. 83, pp. 68–92, https://arxiv.org/abs/1510.04526. [ DOI : 10.1016/j.jsc.2016.11.006 ]
    https://hal.archives-ouvertes.fr/hal-01244914
  • 11A. Bostan, C.-P. Jeannerod, C. Mouilleron, E. Schost.
    On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms, in: SIAM Journal on Matrix Analysis and Applications, 2017, vol. 38, no 3, pp. 733-775, https://arxiv.org/abs/1703.03734. [ DOI : 10.1137/16M1062855 ]
    https://hal.archives-ouvertes.fr/hal-01588552
  • 12A. Bostan, P. Lairez, B. Salvy.
    Multiple binomial sums, in: Journal of Symbolic Computation, 2017, vol. 80, no 2, pp. 351–386. [ DOI : 10.1016/j.jsc.2016.04.002 ]
    https://hal.archives-ouvertes.fr/hal-01220573
  • 13N. Brisebarre, G. Hanrot, O. Robert.
    Exponential sums and correctly-rounded functions, in: IEEE Transactions on Computers, April 2017. [ DOI : 10.1109/TC.2017.2690850 ]
    https://hal.archives-ouvertes.fr/hal-01396027
  • 14Y. Bugeaud, A. Dujella, T. Pejković, B. Salvy.
    Absolute Real Root Separation, in: The American Mathematical Monthly, 2017, vol. 124, no 10, pp. 930-936. [ DOI : 10.4169/amer.math.monthly.124.10.930 ]
    https://hal.archives-ouvertes.fr/hal-01655531
  • 15J. Courtiel, S. Melczer, M. Mishna, K. Raschel.
    Weighted Lattice Walks and Universality Classes, in: Journal of Combinatorial Theory, Series A, 2017, https://arxiv.org/abs/1609.05839. [ DOI : 10.1016/j.jcta.2017.06.008 ]
    https://hal.archives-ouvertes.fr/hal-01368786
  • 16J.-G. Dumas, C. Pernet, Z. Sultan.
    Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition, in: Journal of Symbolic Computation, November 2017, vol. 83, pp. 187–210, https://arxiv.org/abs/1601.01798. [ DOI : 10.1016/j.jsc.2016.11.011 ]
    https://hal.archives-ouvertes.fr/hal-01251223
  • 17J.-C. Faugère, A. Wallet.
    The Point Decomposition Problem over Hyperelliptic Curves: toward efficient computations of Discrete Logarithms in even characteristic, in: Designs, Codes and Cryptography, 2017, forthcoming. [ DOI : 10.1007/s10623-017-0449-y ]
    https://hal.inria.fr/hal-01658573
  • 18J. Hormigo, J.-M. Muller, S. Obermann, N. Revol, A. Tisserand, J. Villalba-Moreno.
    Introduction to the Special Section on Computer Arithmetic, in: IEEE Transactions on Computers, December 2017, vol. 66, no 12, pp. 1991-1993. [ DOI : 10.1109/TC.2017.2761278 ]
    https://hal.archives-ouvertes.fr/hal-01648100
  • 19C.-P. Jeannerod, P. Kornerup, N. Louvet, J.-M. Muller.
    Error bounds on complex floating-point multiplication with an FMA, in: Mathematics of Computation, 2017, vol. 86, no 304, pp. 881-898. [ DOI : 10.1090/mcom/3123 ]
    https://hal.inria.fr/hal-00867040
  • 20C.-P. Jeannerod, V. Neiger, E. Schost, G. Villard.
    Computing minimal interpolation bases, in: Journal of Symbolic Computation, November 2017, vol. 83, pp. 272–314. [ DOI : 10.1016/j.jsc.2016.11.015 ]
    https://hal.inria.fr/hal-01241781
  • 21M. M. Joldes, J.-M. Muller, V. Popescu.
    Tight and rigourous error bounds for basic building blocks of double-word arithmetic, in: ACM Transactions on Mathematical Software, 2017, vol. 44, no 2, pp. 1 - 27. [ DOI : 10.1145/3121432 ]
    https://hal.archives-ouvertes.fr/hal-01351529
  • 22G. Labahn, V. Neiger, W. Zhou.
    Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix, in: Journal of Complexity, October 2017. [ DOI : 10.1016/j.jco.2017.03.003 ]
    https://hal.inria.fr/hal-01345627
  • 23V. Lefèvre.
    Correctly Rounded Arbitrary-Precision Floating-Point Summation, in: IEEE Transactions on Computers, 2017. [ DOI : 10.1109/TC.2017.2690632 ]
    https://hal.inria.fr/hal-01394289
  • 24S. Ling, D. H. Phan, D. Stehlé, R. Steinfeld.
    Hardness of k-LWE and Applications in Traitor Tracing, in: Algorithmica, December 2017, vol. 79, no 4, pp. 1318 - 1352. [ DOI : 10.1007/s00453-016-0251-7 ]
    https://hal.archives-ouvertes.fr/hal-01643505
  • 25L. Thévenoux, P. Langlois, M. Martel.
    Automatic source-to-source error compensation of floating-point programs: code synthesis to optimize accuracy and time, in: Concurrency and Computation: Practice and Experience, 2017, vol. 29, no 7, e3953 p. [ DOI : 10.1002/cpe.3953 ]
    https://hal.archives-ouvertes.fr/hal-01236919

Invited Conferences

  • 26N. Revol.
    Introduction to the IEEE 1788-2015 Standard for Interval Arithmetic, in: 10th International Workshop on Numerical Software Verification - NSV 2017, workshop of CAV 2017, Heidelberg, Germany, A. Abate, S. Boldo (editors), LNCS, Springer, July 2017, no 10381, pp. 14-21. [ DOI : 10.1007/978-3-319-63501-9 ]
    https://hal.inria.fr/hal-01559955

International Conferences with Proceedings

  • 27S. Agrawal, S. Bhattacherjee, D. H. Phan, D. Stehlé, S. Yamada.
    Efficient Public Trace and Revoke from Standard Assumptions, in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS'2017, Dallas, United States, October 2017.
    https://hal.archives-ouvertes.fr/hal-01643498
  • 28A. Blot, J.-M. Muller, L. Théry.
    Formal correctness of comparison algorithms between binary64 and decimal64 floating-point numbers, in: Numerical Software Verification, Heidelberg, Germany, Lecture Notes in Computer Science (LNCS), Springer, July 2017, no 10381.
    https://hal.archives-ouvertes.fr/hal-01512294
  • 29P. Boito, Y. Eidelman, L. Gemignani.
    Efficient Solution of Shifted Quasiseparable Systems and Applications, in: CMMSE 2017 - 17th International Conference on Computational and Mathematical Methods in Science and Engineering, Cadiz, Spain, July 2017, pp. 1-4.
    https://hal.inria.fr/hal-01644741
  • 30S. Boldo, M. Joldes, J.-M. Muller, V. Popescu.
    Formal Verification of a Floating-Point Expansion Renormalization Algorithm, in: 8th International Conference on Interactive Theorem Proving (ITP'2017), Brasilia, Brazil, Lecture Notes in Computer Science, September 2017, vol. 10499.
    https://hal.archives-ouvertes.fr/hal-01512417
  • 31G. Castagnos, L. Imbert, F. Laguillaumie.
    Encryption Switching Protocols Revisited: Switching Modulo p, in: CRYPTO 2017 - 37th International Cryptology Conference, Santa Barbara, United States, Advances in Cryptology – CRYPTO 2017, August 2017, vol. 10401, pp. 255-287. [ DOI : 10.1007/978-3-319-63688-7_9 ]
    https://hal-lirmm.ccsd.cnrs.fr/lirmm-01587451
  • 32J. Chen, J. Gong.
    ABE with Tag Made Easy: Concise Framework and New Instantiations in Prime-order Groups, in: Asiacrypt 2017, Hong Kong, China, December 2017.
    https://hal.inria.fr/hal-01643435
  • 33J. Chen, J. Gong, J. Weng.
    Tightly Secure IBE under Constant-size Master Public Key, in: PKC 2017 - Public Key Cryptography, Amsterdam, Netherlands, March 2017.
    https://hal.inria.fr/hal-01643457
  • 34G. Herold, M. Hoffmann, M. Klooss, C. Ràfols, A. Rupp.
    New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs, in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, United States, 2017.
    https://hal.archives-ouvertes.fr/hal-01643558
  • 35M. JOYE, B. Libert.
    Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves, in: CT-RSA 2017 - RSA Conference 2017 – Cryptographers' Track, San Francisco, United States, LNCS, Springer, February 2017, vol. 10159, pp. 19 - 35. [ DOI : 10.1007/978-3-540-72738-5_21 ]
    https://hal.inria.fr/hal-01621014
  • 36C.-P. Jeannerod, C. Monat, L. Thévenoux.
    More accurate complex multiplication for embedded processors, in: 12th IEEE International Symposium on Industrial Embedded Systems (SIES 2017), Toulouse, France, June 2017.
    https://hal.archives-ouvertes.fr/hal-01512760
  • 37C.-P. Jeannerod, J.-M. Muller, A. Plet.
    The Classical Relative Error Bounds for Computing √a2 + b2 and c/ √a2 + b2 in Binary Floating-Point Arithmetic are Asymptotically Optimal, in: ARITH-24 2017 - 24th IEEE Symposium on Computer Arithmetic, London, United Kingdom, Proceedings of the 24th IEEE Symposium on Computer Arithmetic, July 2017, 8 p.
    https://hal-ens-lyon.archives-ouvertes.fr/ensl-01527202
  • 38M. Joldes, J.-M. Muller, V. Popescu.
    Implementation and performance evaluation of an extended precision floating-point arithmetic library for high-accuracy semidefinite programming, in: IEEE Symposium on Computer Arithmetic (Arith24), London, United Kingdom, July 2017.
    https://hal.archives-ouvertes.fr/hal-01491255
  • 39V. Lefèvre, P. Zimmermann.
    Optimized Binary64 and Binary128 Arithmetic with GNU MPFR, in: 24th IEEE Symposium on Computer Arithmetic (ARITH 24), London, United Kingdom, July 2017.
    https://hal.inria.fr/hal-01502326
  • 40B. Libert, S. Ling, F. Mouhartem, K. Nguyen, H. Wang.
    Adaptive Oblivious Transfer with Access Control from Lattice Assumptions, in: ASIACRYPT 2017 - Advances in Cryptology, Hong Kong, China, T. Takagi, T. Peyrin (editors), International Conference on the Theory and Application of Cryptology and Information Security : Advances in Cryptology – ASIACRYPT 2017, Springer, December 2017, vol. 10624, pp. 533-563. [ DOI : 10.1007/978-3-319-70694-8_19 ]
    https://hal.inria.fr/hal-01622197
  • 41B. Libert, S. Ling, K. Nguyen, H. Wang.
    Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash, in: Asiacrypt 2017, Hong Kong, China, LNCS, Springer, December 2017.
    https://hal.inria.fr/hal-01621027
  • 42B. Libert, T. Peters, C. Qian.
    Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts, in: PKC 2017 - Public Key Cryptography, Amsterdam, Netherlands, LNCS, Springer, March 2017, vol. 10174, pp. 247 - 276. [ DOI : 10.1007/BFb0054113 ]
    https://hal.inria.fr/hal-01621022
  • 43B. Libert, A. Sakzad, D. Stehlé, R. Steinfeld.
    All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE, in: Crypto 2017 - 37th International Cryptology Conference, Santa Barbara, United States, LNCS, Springer, August 2017, vol. 10403, pp. 332 - 364. [ DOI : 10.1007/978-3-662-53018-4_18 ]
    https://hal.inria.fr/hal-01621025
  • 44V. Neiger, T. X. Vu.
    Computing Canonical Bases of Modules of Univariate Relations, in: ISSAC '17 - 42nd International Symposium on Symbolic and Algebraic Computation, Kaiserslautern, Germany, July 2017, 8 p, https://arxiv.org/abs/1705.10649.
    https://hal.inria.fr/hal-01457979
  • 45R. Steinfeld, A. Sakzad, M. Roșca, D. Stehlé.
    Middle-Product Learning with Errors, in: Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, United States, 2017.
    https://hal.archives-ouvertes.fr/hal-01643517
  • 46G. Villard, E. Kaltofen, L. Zhi, J.-G. Dumas.
    Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits, in: ISSAC 2017 - 42nd International Symposium on Symbolic and Algebraic Computation, Kaiserslautern, Germany, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ACM, July 2017, pp. 125-132. [ DOI : 10.1145/3087604.3087640 ]
    https://hal.archives-ouvertes.fr/hal-01657873

Conferences without Proceedings

  • 47P. R. Arantes Gilz, F. Bréhard, C. Gazzino.
    Validated Semi-Analytical Transition Matrices for Linearized Relative Spacecraft Dynamics via Chebyshev Series Approximations, in: 2018 Space Flight Mechanics Meeting, AIAA Science and Technology Forum and Exposition 2018, Kissimmee, United States, January 2018, pp. 1-23.
    https://hal.archives-ouvertes.fr/hal-01540170

Scientific Books (or Scientific Book chapters)

Books or Proceedings Editing

Other Publications

  • 51F. Bréhard, N. Brisebarre, M. Joldes.
    Validated and numerically efficient Chebyshev spectral methods for linear ordinary differential equations, July 2017, working paper or preprint.
    https://hal.archives-ouvertes.fr/hal-01526272
  • 52F. Bréhard.
    Fixed-Point Validation with Componentwise Error Enclosures and Application to Coupled Systems of Linear Ordinary Differential Equations , December 2017, working paper or preprint.
    https://hal.archives-ouvertes.fr/hal-01654396
  • 53S.-I. Filip, M. Istoan, F. de Dinechin, N. Brisebarre.
    Automatic generation of hardware FIR filters from a frequency domain specification, May 2017, working paper or preprint.
    https://hal.inria.fr/hal-01308377
  • 54J. Gong, B. Libert, S. C. Ramanna.
    Compact IBBE and Fuzzy IBE from Simple Assumptions, January 2018, working paper or preprint.
    https://hal.inria.fr/hal-01686690
  • 55C.-P. Jeannerod, V. Neiger, G. Villard.
    Fast computation of approximant bases in canonical form, January 2018, working paper or preprint.
    https://hal-unilim.archives-ouvertes.fr/hal-01683632
  • 56N. Revol.
    Influence of the Condition Number on Interval Computations: Illustration on Some Examples, in honour of Vladik Kreinovich' 65th birthday, 2017, in honour of Vladik Kreinovich' 65th birthday.
    https://hal.inria.fr/hal-01588713
  • 57D. Stehlé.
    Lattice Reduction Algorithms, 2017, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017.
    https://hal.archives-ouvertes.fr/hal-01643523