| 2008 |
|---|
| 11 | EE | Jean-Luc Beuchat,
Nicolas Brisebarre,
Jérémie Detrey,
Eiji Okamoto,
Francisco Rodríguez-Henríquez:
A Comparison between Hardware Accelerators for the Modified Tate Pairing over F2m and F3m.
Pairing 2008: 297-315 |
| 10 | EE | Nicolas Brisebarre,
Jean-Michel Muller:
Correctly Rounded Multiplication by Arbitrary Precision Constants.
IEEE Trans. Computers 57(2): 165-174 (2008) |
| 2007 |
|---|
| 9 | EE | Jean-Luc Beuchat,
Nicolas Brisebarre,
Jérémie Detrey,
Eiji Okamoto:
Arithmetic Operators for Pairing-Based Cryptography.
CHES 2007: 239-255 |
| 8 | EE | Nicolas Brisebarre,
Sylvain Chevillard:
Efficient polynomial L-approximations.
IEEE Symposium on Computer Arithmetic 2007: 169-176 |
| 7 | EE | Nicolas Brisebarre,
Guillaume Hanrot:
Floating-point L2-approximations to functions.
IEEE Symposium on Computer Arithmetic 2007: 177-186 |
| 6 | EE | Jean-Luc Beuchat,
Nicolas Brisebarre,
Masaaki Shirase,
Tsuyoshi Takagi,
Eiji Okamoto:
A Coprocessor for the Final Exponentiation of the eta T Pairing in Characteristic Three.
WAIFI 2007: 25-39 |
| 2006 |
|---|
| 5 | EE | Nicolas Brisebarre,
Jean-Michel Muller,
Arnaud Tisserand:
Computing machine-efficient polynomial approximations.
ACM Trans. Math. Softw. 32(2): 236-256 (2006) |
| 2005 |
|---|
| 4 | EE | Nicolas Brisebarre,
Jean-Michel Muller:
Correctly Rounded Multiplication by Arbitrary Precision Constants.
IEEE Symposium on Computer Arithmetic 2005: 13-20 |
| 3 | EE | Nicolas Brisebarre,
David Defour,
Peter Kornerup,
Jean-Michel Muller,
Nathalie Revol:
A New Range-Reduction Algorithm.
IEEE Trans. Computers 54(3): 331-339 (2005) |
| 2004 |
|---|
| 2 | EE | Nicolas Brisebarre,
Jean-Michel Muller,
Saurabh Kumar Raina:
Accelerating Correctly Rounded Floating-Point Division when the Divisor Is Known in Advance.
IEEE Trans. Computers 53(8): 1069-1072 (2004) |
| 2003 |
|---|
| 1 | EE | Nicolas Brisebarre,
Jean-Michel Muller:
Finding the "truncated" polynomial that is closest to a function
CoRR cs.MS/0307009: (2003) |
