Latest publication updates
- Note on FastTwoSum with Directed Roundings, S. Corbineau, P. Zimmermann.
- Algorithms for computing norms and characteristic polynomials on general Drinfeld modules, X. Caruso, A. Leudière.
- Discrete Logarithm Factory, H. Al Aswad, C. Pierrot, E. Thomé.
- A Note on Related-Tweakey Impossible Differential Attacks, X. Bonnetain, V. Lallemand.
- A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level, D.F. Aranha, G. Fotiadis, A. Guillevic.
- Belenios with cast-as-intended: towards a usable interface, V. Cortier, P. Gaudry, A. Goetschmann, S. Lemonnier.
- Accuracy of Complex Mathematical Operations and Functions in Single and Double Precision, P. Caprioli, V. Innocente, P. Zimmermann.
- Morphisms of Drinfeld Modules and their Algorithms, A. Leudière.
- Single-Query Quantum Hidden Shift Attacks, X. Bonnetain, A. Schrottenloher.
- Accuracy of Mathematical Functions in Single, Double, Double Extended, and Quadruple Precision, B. Gladman, V. Innocente, J. Mather, P. Zimmermann.
- Quadratic Short Division, J. Sukop, P. Zimmermann.
- On Impossible Boomerang Attacks, X. Bonnetain, M. Cordero, V. Lallemand, M. Minier, M. Naya Plasencia.
- Belenios: the Certification Campaign, A. Bossuat, E. Brocas, V. Cortier, P. Gaudry, S. Glondu, N. Kovacs.
- Correctly-rounded evaluation of a function: why, how, and at what cost?, N. Brisebarre, G. Hanrot, J.-M. Muller, P. Zimmermann.
- Can we cast a ballot as intended and be receipt free?, H. Devillez, O. Pereira, T. Peters, Q. Yang.
- Flatness and structural analysis for the design of stream ciphers involving hybrid automata, H. Boukerrou, G. Millérioux, M. Minier, T. Boukhobza.
- Masked Iterate-Fork-Iterate: A New Design Paradigm for Tweakable Expanding Pseudorandom Function, E. Andreeva, B. Cogliati, V. Lallemand, M. Minier, A. Purnal, A. Roy.
- Note on the Veltkamp/Dekker Algorithms with Directed Roundings, P. Zimmermann.
- Automatic boomerang attacks search on Rijndael, L. Rouquette, M. Minier, C. Solnon.
- Towards a correctly-rounded and fast power function in binary64 arithmetic, T. Hubrecht, C.-P. Jeannerod, P. Zimmermann, L. Rideau, L. Théry.