Évaluation polynomiale en-ligne de fonctions élémentaires sur FPGA (2008)
Beuchat, Jean-Luc, Tisserand, Arnaud
Cet article présente une architecture matérielle pour l'évaluation de fonctions élémentaires en arithmétique en-ligne sur circuits FPGA. Les points particuliers traités sont la détermination...
Small Multiplier-based Multiplication and Division Operators for Virtex-II Devices (2008)
Beuchat, Jean-Luc, Tisserand, Arnaud
This paper presents integer multiplication and division operators dedicated to Virtex-II FPGAs from Xilinx. Those operators are based on small 18 x 18 multiplier blocks available in the Virtex-II...
Boullis, Nicolas, Tisserand, Arnaud
Cet article présente une méthode de génération automatique d'opérateurs arithmétiques matériels pour des calculs basés sur des multiplications par des constantes et des additions. A partir...
Évaluation polynomiale en-ligne de fonctions élémentaires sur FPGA (2008)
Beuchat, Jean-Luc, Tisserand, Arnaud
Cet article présente une architecture matérielle pour l'évaluation de fonctions élémentaires en arithmétique en-ligne sur circuits FPGA. Les points particuliers traités sont la détermination...
Small Multiplier-based Multiplication and Division Operators for Virtex-II Devices (2008)
Beuchat, Jean-Luc, Tisserand, Arnaud
This paper presents integer multiplication and division operators dedicated to Virtex-II FPGAs from Xilinx. Those operators are based on small 18 x 18 multiplier blocks available in the Virtex-II...
Boullis, Nicolas, Tisserand, Arnaud
Cet article présente une méthode de génération automatique d'opérateurs arithmétiques matériels pour des calculs basés sur des multiplications par des constantes et des additions. A partir...
FPGA Implementation of a Recently Published Signature Scheme (2008)
Beuchat, Jean-Luc, Sendrier, Nicolas, Tisserand, Arnaud, Villard, Gilles
An algorithm producing cryptographic digital signatures less than 100 bits long with a security level matching nowadays standards has been recently proposed by Courtois, Finiasz, and Sendrier. This...
FPGA Implementation of a Recently Published Signature Scheme (2008)
Beuchat, Jean-Luc, Sendrier, Nicolas, Tisserand, Arnaud, Villard, Gilles
An algorithm producing cryptographic digital signatures less than 100 bits long with a security level matching nowadays standards has been recently proposed by Courtois, Finiasz, and Sendrier. This...
A floating-point library for integer processors (2008)
Bertin, C., Brisebarre, Nicolas, Dupont De Dinechin, Benoît, Jeannerod, Claude-Pierre, Monat, C., Muller, Jean-Michel, ...
This paper presents a C library for the software support of single precision floating-point (FP) arithmetic on processors without FP hardware units such as VLIW or DSP processor cores for embedded...
A floating-point library for integer processors (2008)
Bertin, C., Brisebarre, Nicolas, Dupont De Dinechin, Benoît, Jeannerod, Claude-Pierre, Monat, C., Muller, Jean-Michel, ...
This paper presents a C library for the software support of single precision floating-point (FP) arithmetic on processors without FP hardware units such as VLIW or DSP processor cores for embedded...
On digit-recurrence division algorithms for self-timed circuits (2008)
Boullis, Nicolas, Tisserand, Arnaud
The optimization of algorithms for self-timed or asynchronous circuits requires specific solutions. Due to the variable-time capabilities of asynchronous circuits, the average computation time should...
On digit-recurrence division algorithms for self-timed circuits (2008)
Boullis, Nicolas, Tisserand, Arnaud
The optimization of algorithms for self-timed or asynchronous circuits requires specific solutions. Due to the variable-time capabilities of asynchronous circuits, the average computation time should...
Tisserand, Arnaud, Michard, Romain, Veyrat-Charvillon, Nicolas
Ce travail porte sur l'étude et l'implantation FPGA d'opérateurs arithmétiques, à base d'additions et de décalages, pour l'approximation polynomiale et rationnelle de fonctions. Ces opérateurs...
Division by Constant for the ST100 DSP Microprocessor (2008)
Muller, Jean-Michel, Tisserand, Arnaud, Dupont De Dinechin, Benoît, Monat, Christophe
Algorithms for Euclidean (i.e., integer) division by a constant operation are presented. They allow fast computation for some values of the divisor (known at compile time) or also when both quotient...
Some Improvements on Multipartite Table Methods (2008)
Dupont De Dinechin, Florent, Tisserand, Arnaud
This paper presents an unified view of most previous table-lookup-and-addition methods: bipartite tables, SBTM, STAM and multipartite method. This new definition allows a more accurate computation of...
Hardware Reciprocation using Degree-3 Polynomials but Only 1 Complete Multiplication (2008)
This paper presents a dedicated operator for the reciprocal evaluation in hardware. It uses a degree-3 polynomial approximation that only requires one complete multiplication and a small number of...
Hardware Reciprocation using Degree-3 Polynomials but Only 1 Complete Multiplication (2008)
This paper presents a dedicated operator for the reciprocal evaluation in hardware. It uses a degree-3 polynomial approximation that only requires one complete multiplication and a small number of...
Byrne, Andrew, Meloni, Nicolas, Tisserand, Arnaud, Popovici, Emanuel, Marnane, William
There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks such as Simple Power Analysis (SPA) attacks. Algorithms for elliptic curve point...
Byrne, Andrew, Meloni, Nicolas, Tisserand, Arnaud, Popovici, Emanuel, Marnane, William
There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks such as Simple Power Analysis (SPA) attacks. Algorithms for elliptic curve point...
Amélioration de la sécurité des circuits intégrés par codage de linformation (2007)
Francq, Julien, Rigaud, Jean-Baptiste, Manet, Pascal, Bajard, Jean-Claude, Tisserand, Arnaud
La carte à puce, comme tout autre processeur de traitement dinformations confidentielles peut faire lobjet de manipulations frauduleuses, appelées communément attaques. Cet article décrit les...
Amélioration de la sécurité des circuits intégrés par codage de linformation (2007)
Francq, Julien, Rigaud, Jean-Baptiste, Manet, Pascal, Bajard, Jean-Claude, Tisserand, Arnaud
La carte à puce, comme tout autre processeur de traitement dinformations confidentielles peut faire lobjet de manipulations frauduleuses, appelées communément attaques. Cet article décrit les...
SPA Resistant Elliptic Curve Cryptosystem Using Addition Chains (2007)
Byrne, Andrew, Crowe, Francis, Marnane, William, Meloni, Nicolas, Tisserand, Arnaud, Popovici, Emanuel
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...
SPA Resistant Elliptic Curve Cryptosystem Using Addition Chains (2007)
Byrne, Andrew, Crowe, Francis, Marnane, William, Meloni, Nicolas, Tisserand, Arnaud, Popovici, Emanuel
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...
Multi-Mode Operator for SHA-2 Hash Functions (2007)
Glabb, Ryan, Imbert, Laurent, Jullien, Graham, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
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...
Multi-Mode Operator for SHA-2 Hash Functions (2007)
Glabb, Ryan, Imbert, Laurent, Jullien, Graham, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
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...
Automatic Generation of Low-Power Circuits for the Evaluation of Polynomials (2007)
This paper presents a method for the automatic generation of high-performance and low-power arithmetic operators based on polynomial approximations. It deals with the bit-level representation of the...
Automatic Generation of Low-Power Circuits for the Evaluation of Polynomials (2007)
This paper presents a method for the automatic generation of high-performance and low-power arithmetic operators based on polynomial approximations. It deals with the bit-level representation of the...
SPA Resistant Elliptic Curve Cryptosystem using Addition Chains (2007)
Byrne, Andrew, Meloni, Nicolas, Crowe, Francis, Marnane, William, Tisserand, Arnaud, Popovici, Emanuel
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...
Carry Prediction and Selection for Truncated Multiplication (2007)
Michard, Romain, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
This paper presents an error compensation method for truncated multiplication. From two $n$-bit operands, the operator produces an n-bit product with small error compared to the 2n-bit exact product....
SPA Resistant Elliptic Curve Cryptosystem using Addition Chains (2007)
Byrne, Andrew, Meloni, Nicolas, Crowe, Francis, Marnane, William, Tisserand, Arnaud, Popovici, Emanuel
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...
Carry Prediction and Selection for Truncated Multiplication (2007)
Michard, Romain, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
This paper presents an error compensation method for truncated multiplication. From two $n$-bit operands, the operator produces an n-bit product with small error compared to the 2n-bit exact product....
Some Optimizations of Hardware Multiplication by Constant Matrices (2007)
Boullis, Nicolas, Tisserand, Arnaud
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...
High-Performance Hardware Operators for Polynomial Evaluation (2007)
This paper presents some recent works on hardware evaluation of functions. A method for the automatic generation of high-performance arithmetic operators based on polynomial approximations is...
High-Performance Hardware Operators for Polynomial Evaluation (2007)
This paper presents some recent works on hardware evaluation of functions. A method for the automatic generation of high-performance arithmetic operators based on polynomial approximations is...
Some Optimizations of Hardware Multiplication by Constant Matrices (2007)
Boullis, Nicolas, Tisserand, Arnaud
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...
High-performance hardware operators for polynomial evaluation (2007)
This paper presents some recent works on hardware evaluation of functions. A method for the automatic generation of high-performance arithmetic operators based on polynomial approximations is...
High-performance hardware operators for polynomial evaluation (2007)
This paper presents some recent works on hardware evaluation of functions. A method for the automatic generation of high-performance arithmetic operators based on polynomial approximations is...
Multi-mode Operator for SHA-2 Hash Functions (2007)
Glabb, Ryan, Imbert, Laurent, Jullien, Graham, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
We propose an improved implementation of the SHA-2 hash family to include a multi-mode of operation with minimal latency and hardware requirements over the entire operator. The multi-mode...
Function Evaluation on FPGAs using On-Line Arithmetic Polynomial Approximation (2007)
Beguenane, Rachid, Simard, Stephane, Tisserand, Arnaud
This paper presents the first results of a young collaboration between ERMETIS and LIRMM on hardware arithmetic operators for digital control and digital signal processing. It presents on-line...
Computing Machine-Efficient Polynomial Approximations (2007)
Brisebarre, Nicolas, Muller, Jean-Michel, Tisserand, Arnaud, Torres, Serge
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)...
Beguenane, Rachid, Mailloux, Jean-Gabriel, Simard, Stephane, Tisserand, Arnaud
The aim of this research is to implement sensorless vector control algorithms on a single, eventually reconfigurable, chip, with a computation timing constraint of, at most, 1-6 microseconds, and a...
Simple Seed Architectures for Reciprocal and Square Root Reciprocal (2007)
Ercegovac, Milos, Muller, Jean-Michel, Tisserand, Arnaud
This paper presents a simple hardware architecture for computing the seed values for reciprocal and square root reciprocal. These seeds are used in the initialization of floating-point division and...
Multi-mode Operator for SHA-2 Hash Functions (2007)
Glabb, Ryan, Imbert, Laurent, Jullien, Graham, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
We propose an improved implementation of the SHA-2 hash family to include a multi-mode of operation with minimal latency and hardware requirements over the entire operator. The multi-mode...
Function Evaluation on FPGAs using On-Line Arithmetic Polynomial Approximation (2007)
Beguenane, Rachid, Simard, Stephane, Tisserand, Arnaud
This paper presents the first results of a young collaboration between ERMETIS and LIRMM on hardware arithmetic operators for digital control and digital signal processing. It presents on-line...
Beguenane, Rachid, Mailloux, Jean-Gabriel, Simard, Stephane, Tisserand, Arnaud
The aim of this research is to implement sensorless vector control algorithms on a single, eventually reconfigurable, chip, with a computation timing constraint of, at most, 1-6 microseconds, and a...
Computing Machine-Efficient Polynomial Approximations (2007)
Brisebarre, Nicolas, Muller, Jean-Michel, Tisserand, Arnaud, Torres, Serge
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)...
Simple Seed Architectures for Reciprocal and Square Root Reciprocal (2007)
Ercegovac, Milos, Muller, Jean-Michel, Tisserand, Arnaud
This paper presents a simple hardware architecture for computing the seed values for reciprocal and square root reciprocal. These seeds are used in the initialization of floating-point division and...
Hardware Operator for Simultaneous Sine and Cosine Evaluation (2007)
This work deals with hardware evaluation of the sine and cosine functions for the same argument simultaneously. The proposed method uses trigonometric identities, small lookup tables and low-degree...
Hardware Operator for Simultaneous Sine and Cosine Evaluation (2007)
This work deals with hardware evaluation of the sine and cosine functions for the same argument simultaneously. The proposed method uses trigonometric identities, small lookup tables and low-degree...
Optimisation d'opérateurs arithmétiques matériels à base d'approximations polynomiales (2007)
Michard, Romain, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
Cet article présente une méthode pour l'optimisation d'opérateurs arithmétiques matériels dédiés à l'évaluation de fonctions par des polynômes. La méthode, basée sur des outils récents,...
Optimisation d'opérateurs arithmétiques matériels à base d'approximations polynomiales (2007)
Michard, Romain, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
Cet article présente une méthode pour l'optimisation d'opérateurs arithmétiques matériels dédiés à l'évaluation de fonctions par des polynômes. La méthode, basée sur des outils récents,...
Hardware operators for function evaluation using sparse-coefficient polynomials (2007)
Muller, Jean-Michel, Tisserand, Arnaud, Torrès, Serge, Brisebarre, Nicolas
This article presents dedicated hardware arithmetic operators for function evaluation. The proposed solution uses polynomial approximations with sparse coefficients which leads to efficient hardware...
Hardware operators for function evaluation using sparse-coefficient polynomials (2007)
Muller, Jean-Michel, Tisserand, Arnaud, Torrès, Serge, Brisebarre, Nicolas
This article presents dedicated hardware arithmetic operators for function evaluation. The proposed solution uses polynomial approximations with sparse coefficients which leads to efficient hardware...
Computing machine-efficient polynomial approximations (2006)
Muller, Jean-Michel, Brisebarre, Nicolas, Tisserand, Arnaud
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)...
Simple Seed Architectures for Reciprocal and Square-Root Reciprocal (2006)
Muller, Jean-Michel, Tisserand, Arnaud, Ercegovac, Milos
This paper presents a simple hardware architecture for computing the seed values for reciprocal and square root reciprocal. These seeds are used in the intitialization of floating-point division and...
Simple Seed Architectures for Reciprocal and Square-Root Reciprocal (2006)
Muller, Jean-Michel, Tisserand, Arnaud, Ercegovac, Milos
This paper presents a simple hardware architecture for computing the seed values for reciprocal and square root reciprocal. These seeds are used in the intitialization of floating-point division and...
Computing machine-efficient polynomial approximations (2006)
Muller, Jean-Michel, Brisebarre, Nicolas, Tisserand, Arnaud
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)...
Simple Seed Architectures for Reciprocal and Square Root Reciprocal (2006)
Ercegovac, Milos, Muller, Jean-Michel, Tisserand, Arnaud
This report presents a simple hardware architecture for computing the seed values for reciprocal and square root reciprocal. These seeds are used in the initialization of floating-point division and...
Étude statistique de l'activité de la fonction de sélection dans l'algorithme de E-méthode (2006)
Michard, Romain, Veyrat-Charvillon, Nicolas, Tisserand, Arnaud
Ce travail porte sur l'étude statistique de l'activité liée à la fonction de sélection dans l'algorithme d'approximation de polynômes connu sous le nom de E-méthode proposé par M. Ercegovac...
Michard, Romain, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
This paper presents small FPGA implementations of low precision polynomial approximations of functions without multipliers. Our method uses degree-$2$ or degree-$3$ polynomial approximations with at...
Simple Seed Architectures for Reciprocal and Square Root Reciprocal (2006)
Ercegovac, Milos, Muller, Jean-Michel, Tisserand, Arnaud
This report presents a simple hardware architecture for computing the seed values for reciprocal and square root reciprocal. These seeds are used in the initialization of floating-point division and...
Étude statistique de l'activité de la fonction de sélection dans l'algorithme de E-méthode (2006)
Michard, Romain, Veyrat-Charvillon, Nicolas, Tisserand, Arnaud
Ce travail porte sur l'étude statistique de l'activité liée à la fonction de sélection dans l'algorithme d'approximation de polynômes connu sous le nom de E-méthode proposé par M. Ercegovac...
Michard, Romain, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
This paper presents small FPGA implementations of low precision polynomial approximations of functions without multipliers. Our method uses degree-$2$ or degree-$3$ polynomial approximations with at...
Tisserand, Arnaud, Michard, Romain, Veyrat-Charvillon, Nicolas
Ce travail porte sur l'étude et l'implantation FPGA d'opérateurs arithmétiques, à base d'additions et de décalages, pour l'approximation polynomiale et rationnelle de fonctions. Ces opérateurs...
Division by Constant for the ST100 DSP Microprocessor (2006)
Muller, Jean-Michel, Tisserand, Arnaud, Dupont De Dinechin, Benoît, Monat, Christophe
Algorithms for Euclidean (i.e., integer) division by a constant operation are presented. They allow fast computation for some values of the divisor (known at compile time) or also when both quotient...
Some Improvements on Multipartite Table Methods (2006)
Dupont De Dinechin, Florent, Tisserand, Arnaud
This paper presents an unified view of most previous table-lookup-and-addition methods: bipartite tables, SBTM, STAM and multipartite method. This new definition allows a more accurate computation of...
Simple Seed Architectures for Reciprocal and Square Root Reciprocal (2005)
Ercegovac, Milos, Muller, Jean-Michel, Tisserand, Arnaud
This report presents a simple hardware architecture for computing the seed values for reciprocal and square root reciprocal. These seeds are used in the initialization of floating-point division and...
High-Radix Floating-Point Division Algorithms for Embedded VLIW Integer Processors (2005)
Jeannerod, Claude-Pierre, Raina, Saurabh-Kumar, Tisserand, Arnaud
13 p., tableaux, figures, 1 référence bibliographique
Étude statistique de l'activité de la fonction de sélection dans l'algorithme de E-méthode (2005)
Michard, Romain, Veyrat-Charvillon, Nicolas, Tisserand, Arnaud
Ce travail porte sur l'étude statistique de l'activité liée à la fonction de sélection dans l'algorithme d'approximation de polynômes connu sous le nom de E-méthode proposé par M. Ercegovac...
Michard, Romain, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
This paper presents small FPGA implementations of low precision polynomial approximations of functions without multipliers. Our method uses degree-$2$ or degree-$3$ polynomial approximations with at...
Michard, Romain, Tisserand, Arnaud, Veyrat-Charvillon, Nicolas
(eng) This paper presents small FPGA implementations of low precision polynomial approximations of functions without multipliers. Our method uses degree-2 or degree-3 polynomial approximations with...
Tisserand, Arnaud, Michard, Romain, Veyrat-Charvillon, Nicolas
Ce travail porte sur l'étude et l'implantation FPGA d'opérateurs arithmétiques, à base d'additions et de décalages, pour l'approximation polynomiale et rationnelle de fonctions. Ces opérateurs...
Michard, Romain, Tisserand, Arnaud
(eng) This work deals with FPGA arithmetic operators, based on shift-and-add algorithm, for polynomial and rational approximation of functions. These operators are high-radix iterations of the...
Division by Constant for the ST100 DSP Microprocessor (2004)
Muller, Jean-Michel, Tisserand, Arnaud, Dupont De Dinechin, Benoît, Monat, Christophe
Algorithms for Euclidean (i.e., integer) division by a constant operation are presented. They allow fast computation for some values of the divisor (known at compile time) or also when both quotient...
Division by Constant for the ST100 DSP Microprocessor. (2004)
Muller, Jean-Michel, Tisserand, Arnaud, Dupont De Dinechin, Benoît, Monat, C.
(eng) Algorithms for Euclidean (i.e., integer) division by a constant operation are presented. They allow fast computation for some values of the divisor (known at compile time) or also when both...
Laboratoire de l'Informatique du Paralllisme (2004)
Arnaud Tisserand, Jean-luc Beuchat, Nicolas Sendrier, Arnaud Tisser, Gilles Villard
An algorithm producing cryptographic digital signatures less than 100 bits long with a security level matching nowadays standards has been recently proposed by Courtois, Finiasz, and Sendrier. This...
FPGA Implementation of a Recently Published Signature Scheme (2004)
Beuchat, Jean-Luc, Sendrier, Nicolas, Tisserand, Arnaud, Villard, Gilles
An algorithm producing cryptographic digital signatures less than 100 bits long with a security level matching nowadays standards has been recently proposed by Courtois, Finiasz, and Sendrier. This...