Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

1S. Torres.

Tools for the Design of Reliable and Efficient Functions Evaluation Libraries, Université de Lyon, September 2016.

https://tel.archives-ouvertes.fr/tel-01396907

Articles in International Peer-Reviewed Journals

2S. Bai, C. Bouvier, A. Kruppa, P. Zimmermann.

Better polynomials for GNFS, in: Mathematics of Computation / Mathematics of Computation, 2016, vol. 85, 12 p. [ DOI : 10.1090/mcom3048 ]

https://hal.inria.fr/hal-01089507
3S. Bai, C. Tong, J. Wen.

Effects of Some Lattice Reductions on the Success Probability of the Zero-Forcing Decoder, in: IEEE Communications Letters, 2016. [ DOI : 10.1109/LCOMM.2016.2594196 ]

https://hal.inria.fr/hal-01394219
4F. Benhamouda, J. Herranz, M. JOYE, B. Libert.

Efficient Cryptosystems From $2^{k}$ -th Power Residue Symbols, in: Journal of Cryptology, April 2016. [ DOI : 10.1007/s00145-016-9229-5 ]

https://hal.inria.fr/hal-01394400
5A. Bostan, M. Bousquet-Mélou, M. Kauers, S. Melczer.

On 3-dimensional lattice walks confined to the positive octant, in: Annals of Combinatorics, October 2016, 36 p, First Online: 14 October 2016. [ DOI : 10.1007/s00026-016-0328-7 ]

https://hal.archives-ouvertes.fr/hal-01063886
6A. Bostan, L. Dumont, B. Salvy.

Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity, in: Journal of Symbolic Computation, 2016. [ DOI : 10.1016/j.jsc.2016.11.006 ]

https://hal.archives-ouvertes.fr/hal-01244914
7A. Bostan, P. Lairez, B. Salvy.

Multiple binomial sums, in: Journal of Symbolic Computation, 2016. [ DOI : 10.1016/j.jsc.2016.04.002 ]

https://hal.archives-ouvertes.fr/hal-01220573
8N. Brisebarre, C. Lauter, M. Mezzarobba, J.-M. Muller.

Comparison between binary and decimal floating-point numbers, in: IEEE Transactions on Computers, 2016, vol. 65, n^o 7, pp. 2032–2044. [ DOI : 10.1109/TC.2015.2479602 ]

https://hal.archives-ouvertes.fr/hal-01021928
9S. Burrill, J. Courtiel, E. Fusy, S. Melczer, M. Mishna.

Tableau sequences, open diagrams, and Baxter families, in: European Journal of Combinatorics, November 2016, vol. 58, pp. 144 - 165. [ DOI : 10.1016/j.ejc.2016.05.011 ]

https://hal.inria.fr/hal-01394155
10J.-G. Dumas, T. Gautier, C. Pernet, J.-L. Roch, Z. Sultan.

Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination, in: Parallel Computing, September 2016, vol. 57, pp. 235–249. [ DOI : 10.1016/j.parco.2015.10.003 ]

https://hal.archives-ouvertes.fr/hal-01084238
11J.-G. Dumas, C. Pernet, Z. Sultan.

Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition, in: Journal of Symbolic Computation, November 2016, to appear. [ DOI : 10.1016/j.jsc.2016.11.011 ]

https://hal.archives-ouvertes.fr/hal-01251223
12C.-P. Jeannerod.

A radix-independent error analysis of the Cornea-Harrison-Tang method, in: ACM Transactions on Mathematical Software, 2016. [ DOI : 10.1145/2824252 ]

https://hal.inria.fr/hal-01050021
13C.-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, n^o 304, pp. 881-898. [ DOI : 10.1090/mcom/3123 ]

https://hal.inria.fr/hal-00867040
14C.-P. Jeannerod, N. Louvet, J.-M. Muller, A. Plet.

Sharp error bounds for complex floating-point inversion, in: Numerical Algorithms, November 2016, vol. 73, n^o 3, pp. 735-760. [ DOI : 10.1007/s11075-016-0115-x ]

https://hal-ens-lyon.archives-ouvertes.fr/ensl-01195625
15C.-P. Jeannerod, S. M. Rump.

On relative errors of floating-point operations: optimal bounds and applications, in: Mathematics of Computation, 2016. [ DOI : 10.1090/mcom/3234 ]

https://hal.inria.fr/hal-00934443
16M. Joldes, O. Marty, J.-M. Muller, V. Popescu.

Arithmetic algorithms for extended precision using floating-point expansions, in: IEEE Transactions on Computers, April 2016, vol. 65, n^o 4, pp. 1197 - 1210, Rapport LAAS n° 15016. [ DOI : 10.1109/TC.2015.2441714 ]

https://hal.archives-ouvertes.fr/hal-01111551
17B. Libert, M. JOYE, M. Yung.

Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares, in: Theoretical Computer Science, September 2016, vol. 645, pp. 1-24. [ DOI : 10.1016/j.tcs.2016.02.031 ]

https://hal.inria.fr/hal-01394405
18S. Melczer, M. Mishna.

Asymptotic Lattice Path Enumeration Using Diagonals, in: Algorithmica, August 2016, vol. 75, n^o 4, pp. 782 - 811. [ DOI : 10.1007/s00453-015-0063-1 ]

https://hal.inria.fr/hal-01394157
19S. M. Rump, F. Bünger, C.-P. Jeannerod.

Improved error bounds for floating-point products and Horner’s scheme, in: BIT Numerical Mathematics, March 2016, vol. 56, n^o 1, pp. 293 - 307. [ DOI : 10.1007/s10543-015-0555-z ]

https://hal.inria.fr/hal-01137652
20R. Serra, D. Arzelier, M. Joldes, J.-B. Lasserre, A. Rondepierre, B. Salvy.

Fast and Accurate Computation of Orbital Collision Probability for Short-Term Encounters, in: Journal of Guidance, Control, and Dynamics, May 2016, vol. 39, n^o 5, pp. 1009-1021. [ DOI : 10.2514/1.G001353 ]

https://hal.archives-ouvertes.fr/hal-01132149
21L. 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, August 2016. [ DOI : 10.1002/cpe.3953 ]

https://hal.archives-ouvertes.fr/hal-01236919

International Conferences with Proceedings

22S. Agrawal, B. Libert, D. Stehlé.

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions, in: Crypto 2016, Santa Barbara, United States, Crypto 2016, Springer, August 2016, vol. 9816, pp. 333 - 362. [ DOI : 10.1007/978-3-662-53015-3_12 ]

https://hal.inria.fr/hal-01228559
23M. Albrecht, S. Bai, L. Ducas.

A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and Graded Encoding Schemes, in: CRYPTO 2016, Santa Barbara, United States, 2016. [ DOI : 10.1007/978-3-662-53018-4_6 ]

https://hal.inria.fr/hal-01394211
24S. Bai, T. Laarhoven, D. Stehlé.

Tuple lattice sieving,, in: ANTS 2016, Kaiserslautern, Germany, 2016.

https://hal.inria.fr/hal-01394212
25S. Bai, D. Stehlé, W. Weiqiang.

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices, in: ICALP 2016, Roma, Italy, 2016. [ DOI : 10.4230/LIPIcs.ICALP.2016.76 ]

https://hal.inria.fr/hal-01394213
26A. Bostan, L. Dumont, B. Salvy.

Efficient Algorithms for Mixed Creative Telescoping, in: ISSAC 2016, Waterloo, Canada, Proceedings ISSAC'16, pp. 127–134, ACM Press, 2016, July 2016, 8 p. [ DOI : 10.1145/2930889.2930907 ]

https://hal.inria.fr/hal-01317940
27S. Canard, F. Laguillaumie, M. Paindavoine.

Verifiable Message-Locked Encryption, in: CANS 2016 - 15th International Conference Cryptology and Network Security, Milano, Italy, S. Foresti, G. Persiano (editors), Proc. of CANS 2016, Springer, November 2016, vol. 10052, pp. 299 - 315. [ DOI : 10.1007/978-3-319-48965-0_18 ]

https://hal.inria.fr/hal-01404486
28J. Chen, B. Libert, S. C. Ramanna.

Non-Zero Inner Product Encryption with Short Ciphertexts and Private Keys, in: 10th Conference on Security and Cryptography for Networks (SCN 2016), Amalfi, Italy, 10th Conference on Security and Cryptography for Networks (SCN 2016), August 2016.

https://hal.inria.fr/hal-01309562
29C. Chevalier, F. Laguillaumie, D. Vergnaud.

Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions, in: Computer Security - ESORICS 2016, Heraklion, Greece, I. G. Askoxylakis, S. Ioannidis, S. K. Katsikas, C. A. Meadows (editors), Computer Security – ESORICS 2016, Springer, September 2016, vol. 9878, pp. 261-278. [ DOI : 10.1007/978-3-319-45744-4_13 ]

https://hal.inria.fr/hal-01375817
30S. Collange, M. Joldes, J.-M. Muller, V. Popescu.

Parallel floating-point expansions for extended-precision GPU computations, in: The 27th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP), London, United Kingdom, July 2016.

https://hal.archives-ouvertes.fr/hal-01298206
31L. Ducas, D. Stehlé.

Sanitization of FHE Ciphertexts, in: EUROCRYPT, Wien, Austria, 2016.

https://hal.inria.fr/hal-01394216
32J.-G. Dumas, E. Kaltofen, E. Thomé, G. Villard.

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix, in: International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, X.-S. Gao (editor), ISSAC’2016, Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, ACM, July 2016.

https://hal.archives-ouvertes.fr/hal-01266041
33C.-P. Jeannerod, V. Neiger, E. Schost, G. Villard.

Fast computation of minimal interpolation bases in Popov form for arbitrary shifts, in: 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, ON, Canada, Proceedings of the 41st International Symposium on Symbolic and Algebraic Computation, July 2016. [ DOI : 10.1145/2930889.2930928 ]

https://hal.inria.fr/hal-01265983
34M. Joldes, J.-M. Muller, V. Popescu, W. Tucker.

CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications, in: 5th International Congress on Mathematical Software (ICMS), Berlin, Germany, July 2016.

https://hal.archives-ouvertes.fr/hal-01312858
35J. Le Maire, N. Brunie, F. de Dinechin, J.-M. Muller.

Computing floating-point logarithms with fixed-point operations, in: 23rd IEEE Symposium on Computer Arithmetic, Santa Clara, United States, IEEE, July 2016.

https://hal.archives-ouvertes.fr/hal-01227877
36V. Lefèvre.

Correctly Rounded Arbitrary-Precision Floating-Point Summation, in: 23rd IEEE Symposium on Computer Arithmetic (ARITH), Santa Clara, CA, United States, IEEE, July 2016. [ DOI : 10.1109/ARITH.2016.9 ]

https://hal.inria.fr/hal-01242127
37B. Libert, S. Ling, F. Mouhartem, K. Nguyen, H. Wang.

Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, in: Asiacrypt 2016, Hanoi, Vietnam, Advances in Cryptolology - Asiacrypt 2016, Springer, December 2016, vol. 10032.

https://hal.inria.fr/hal-01267123
38B. Libert, S. Ling, F. Mouhartem, K. Nguyen, H. Wang.

Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption, in: Asiacrypt 2016, Hanoi, Vietnam, Advances in Cryptolology - Asiacrypt 2016, Springer, December 2016, vol. 10032, pp. 101 - 131. [ DOI : 10.1007/978-3-662-53890-6_4 ]

https://hal.inria.fr/hal-01394087
39B. Libert, S. Ling, K. Nguyen, H. Wang.

Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors, in: Eurocrypt 2016, Vienne, Austria, Eurocrypt 2016, Springer, May 2016, vol. 9666. [ DOI : 10.1007/978-3-662-49896-5_1 ]

https://hal.inria.fr/hal-01314642
40B. Libert, F. Mouhartem, K. Nguyen.

A Lattice-Based Group Signature Scheme with Message-Dependent Opening, in: 14th International Conference on Applied Cryptography and Network Security (ACNS 2016), Guildford, United Kingdom, Applied Cryptography and Network Security (ACNS 2016), Springer, June 2016.

https://hal.inria.fr/hal-01302790
41B. Libert, F. Mouhartem, T. Peters, T. Peters, M. Yung.

Practical “Signatures with Efficient Protocols” from Simple Assumptions, in: AsiaCCS 2016, Xi'an, China, ACM, ACM, May 2016. [ DOI : 10.1145/2897845.2897898 ]

https://hal.inria.fr/hal-01303696
42B. Libert, S. C. Ramanna, M. Yung.

Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions, in: 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), Rome, Italy, 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016) – Track A (Algorithms, Complexity and Games), July 2016.

https://hal.inria.fr/hal-01306152
43S. Melczer, B. Salvy.

Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables, in: ISSAC 2016, Waterloo, Canada, ACM, 2016, 8 p. [ DOI : 10.1145/2930889.2930913 ]

https://hal.inria.fr/hal-01310691
44S. Melczer, M. C. Wilson.

Asymptotics of lattice walks via analytic combinatorics in several variables, in: Formal Power Series and Algebraic Combinatorics (FPSAC), Vancouver, Canada, DMTCS Proceedings of FPSAC 2016, July 2016, pp. 863-874.

https://hal.inria.fr/hal-01394166
45J.-M. Muller, V. Popescu, P. T. Peter Tang.

A new multiplication algorithm for extended precision using floating-point expansions, in: ARITH23, Santa Clara, United States, July 2016.

https://hal.archives-ouvertes.fr/hal-01298195
46V. Neiger.

Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations, in: 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, ON, Canada, Proceedings of the 41st International Symposium on Symbolic and Algebraic Computation, July 2016. [ DOI : 10.1145/2930889.2930936 ]

https://hal.inria.fr/hal-01266014
47C. Pernet.

Computing with quasiseparable matrices, in: International Symposium on Symbolic and Algebraic Computation (ISSAC'16), Waterloo, Canada, July 2016, pp. 389-396. [ DOI : 10.1145/2930889.2930915 ]

https://hal.archives-ouvertes.fr/hal-01264131
48S. C. Ramanna.

More Efficient Constructions for Inner-Product Encryption, in: Applied Cryptography and Network Security (ACNS 2016), Guildford, United Kingdom, Applied Cryptography and Network Security (ACNS 2016), Springer, June 2016, vol. 9696, pp. 231 - 248. [ DOI : 10.1007/978-3-319-39555-5_13 ]

https://hal.inria.fr/hal-01394288
49D. Stehlé, A. Neumaier.

Faster LLL-type reduction of lattice bases, in: ISSAC, Waterloo, Canada, 2016.

https://hal.inria.fr/hal-01394214

Scientific Books (or Scientific Book chapters)

50J.-M. Muller.

Elementary functions, algorithms and implementation, 3rd Edition, Birkhaüser Boston, 2016. [ DOI : 10.1007/978-1-4899-7983-4 ]

https://hal-ens-lyon.archives-ouvertes.fr/ensl-01398294

Scientific Popularization

51P. Montuschi, J.-M. Muller.

Modern Computer Arithmetic, in: Computer, September 2016, vol. 49, n^o 9, 12 p.

https://hal.archives-ouvertes.fr/hal-01394408

Other Publications

52B. Allombert, N. Brisebarre, A. Lasjaunias.

From a quartic continued fraction in $𝔽_{3} ((T^{-} 1))$ to a transcendental continued fraction in $Q ((T^{-} 1))$ through an infinite word over 1,2, July 2016, working paper or preprint.

https://hal.archives-ouvertes.fr/hal-01348576
53S. Bai, P. Gaudry, A. Kruppa, E. Thomé, P. Zimmermann.

Factorisation of RSA-220 with CADO-NFS, May 2016, working paper or preprint.

https://hal.inria.fr/hal-01315738
54P. Boito, Y. Eidelman, L. Gemignani.

A Real QZ Algorithm for Structured Companion Pencils, 2016, working paper or preprint.

https://hal.inria.fr/hal-01407864
55P. Boito, Y. Eidelman, L. Gemignani.

Efficient Solution of Parameter Dependent Quasiseparable Systems and Computation of Meromorphic Matrix Functions, 2016, working paper or preprint.

https://hal.inria.fr/hal-01407857
56S. Boldo, S. Graillat, J.-M. Muller.

On the robustness of the 2Sum and Fast2Sum algorithms, May 2016, working paper or preprint.

https://hal-ens-lyon.archives-ouvertes.fr/ensl-01310023
57N. Brisebarre, F. De Dinechin, S.-I. Filip, M. Istoan.

Automatic generation of hardware FIR filters from a frequency domain specification, April 2016, working paper or preprint.

https://hal.inria.fr/hal-01308377
58N. Brisebarre, S.-I. Filip, G. Hanrot.

A Lattice Basis Reduction Approach for the Design of Quantized FIR Filters, April 2016, submitted for publication.

https://hal.inria.fr/hal-01308801
59N. Brisebarre, G. Hanrot, O. Robert.

Exponential sums and correctly-rounded functions, November 2016, working paper or preprint.

https://hal.archives-ouvertes.fr/hal-01396027
60J. Courtiel, S. Melczer, M. Mishna, K. Raschel.

Weighted Lattice Walks and Universality Classes, September 2016, working paper or preprint.

https://hal.archives-ouvertes.fr/hal-01368786
61C.-P. Jeannerod, N. Louvet, J.-M. Muller, A. Plet.

A Library for Symbolic Floating-Point Arithmetic, August 2016, working paper or preprint.

https://hal.inria.fr/hal-01232159
62C.-P. Jeannerod, V. Neiger, E. Schost, G. Villard.

Computing minimal interpolation bases, June 2016, working paper or preprint.

https://hal.inria.fr/hal-01241781
63M. Joldes, V. Popescu, J.-M. Muller.

Tight and rigourous error bounds for basic building blocks of double-word arithmetic, July 2016, working paper or preprint.

https://hal.archives-ouvertes.fr/hal-01351529
64G. Labahn, V. Neiger, W. Zhou.

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix, July 2016, working paper or preprint.

https://hal.inria.fr/hal-01345627
65V. Lefèvre.

Correctly Rounded Arbitrary-Precision Floating-Point Summation, November 2016, working paper or preprint.

https://hal.inria.fr/hal-01394289
66J. Wen, X.-W. Chang.

A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design, January 2016, working paper or preprint.

https://hal.inria.fr/hal-01403929
67J. Wen, X.-W. Chang.

GfcLLL: A Greedy Selection Based Approach for Fixed-Complexity LLL Reduction, July 2016, working paper or preprint.

https://hal.inria.fr/hal-01403926

Previous |

Home