#### Filter Results:

- Full text PDF available (44)

#### Publication Year

1995

2017

- This year (3)
- Last 5 years (20)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Florent de Dinechin, Arnaud Tisserand
- IEEE Trans. Computers
- 2005

A unified view of most previous table-lookup-and-addition methods (bipartite tables, SBTM, STAM, and multipartite methods) is presented. This unified view allows a more accurate computation of the error entailed by these methods, which enables a wider design space exploration, leading to tables smaller than the best previously published ones by up to 50… (More)

- Nicolas Boullis, Arnaud Tisserand
- IEEE Trans. Computers
- 2003

This paper presents some improvements on the optimization of hardware multiplication by constant matrices. We focus on the automatic generation of circuits that involve constant matrix multiplication (CMM), i.e. multiplication of a vector by a constant matrix. The proposed method, based on number recoding and dedicated common sub-expression factorization… (More)

- Milos D. Ercegovac, Tomás Lang, Jean-Michel Muller, Arnaud Tisserand
- IEEE Trans. Computers
- 2000

ÐThis paper deals with the computation of reciprocals, square roots, inverse square roots, and some elementary functions using small tables, small multipliers, and, for some functions, a final alargeo (almost full-length) multiplication. We propose a method, based on argument reduction and series expansion, that allows fast evaluation of these functions in… (More)

- Vincent Lefèvre, Arnaud Tisserand, Jean-Michel Muller
- IEEE Symposium on Computer Arithmetic
- 1997

The Table Maker’s Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that have helped us to solve this problem for the double-precision exponential function in a small domain. These new results show that this problem can be… (More)

We propose an improved implementation of the SHA-2 hash family, with minimal operator latency and reduced hardware requirements. We also propose a high frequency version at the cost of only two cycles of latency per message. Finally we present a multi-mode architecture able to perform either a SHA-384 or SHA-512 hash or to behave as two independent SHA-224… (More)

- Andrew Byrne, Nicolas Meloni, Francis M. Crowe, William P. Marnane, Arnaud Tisserand, Emanuel M. Popovici
- Fourth International Conference on Information…
- 2007

There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks. Algorithms for elliptic curve point scalar multiplication such as the double and add method are prone to such attacks. By making use of special addition chains, it is possible to implement a simple power analysis (SPA) resistant cryptosystem.… (More)

The Table Maker's Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that have helped us to solve this problem for the double-precision exponential function in a small domain. These new results show that this problem can be… (More)

- Sylvain Collange, David Defour, Arnaud Tisserand
- ICCS
- 2009

GPUs are now considered as serious challengers for highperformance computing solutions. They have power consumptions up to 300 W. This may lead to power supply and thermal dissipation problems in computing centers. In this article we investigate, using measurements, how and where modern GPUs are using energy during various computations in a CUDA environment.

- Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand
- ACM Trans. Math. Softw.
- 2006

Polynomial approximations are almost always used when implementing functions on a computing system. In most cases, the polynomial that best approximates (for a given distance and in a given interval) a function has coefficients that are not exactly representable with a finite number of bits. And yet, the polynomial approximations that are actually… (More)

- Pascal Giorgi, Thomas Izard, Arnaud Tisserand
- PARCO
- 2009

We present below our first implementation results on a modular arithmetic library for cryptography on GPUs. Our library, in C++ for CUDA, provides modular arithmetic, finite field arithmetic and some ECC support. Several algorithms and memory coding styles have been compared: local, shared and register. For moderate sizes, we report up to 2.6 speedup… (More)