Sciweavers

ARITH
2007
IEEE
14 years 1 months ago
An Algorithm for Inversion in GF(2^m) Suitable for Implementation Using a Polynomial Multiply Instruction on GF(2)
An algorithm for inversion in GF(2m ) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid's algorithm...
Katsuki Kobayashi, Naofumi Takagi, Kazuyoshi Takag...
ARITH
2007
IEEE
14 years 1 months ago
Return of the hardware floating-point elementary function
The study of specific hardware circuits for the evaluation of floating-point elementary functions was once an active research area, until it was realized that these functions were...
Jérémie Detrey, Florent de Dinechin,...
ARITH
2007
IEEE
14 years 1 months ago
A Software Implementation of the IEEE 754R Decimal Floating-Point Arithmetic Using the Binary Encoding Format
The IEEE Standard 754-1985 for Binary Floating-Point Arithmetic [1] was revised [2], and an important addition is the definition of decimal floating-point arithmetic. This is inte...
Marius Cornea, Cristina Anderson, John Harrison, P...
ARITH
2007
IEEE
14 years 1 months ago
Efficient polynomial L-approximations
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
Nicolas Brisebarre, Sylvain Chevillard
ARITH
2007
IEEE
14 years 1 months ago
Robust Energy-Efficient Adder Topologies
In this paper we explore the relationship between adder topology and energy efficiency. We compare the energy-delay tradeoff curves of selected 32-bit adder topologies, to determi...
Dinesh Patil, Omid Azizi, Mark Horowitz, Ron Ho, R...
ARITH
2007
IEEE
14 years 3 months ago
Modular Multiplication using Redundant Digit Division
Most implementations of the modular exponentiation, ME mod N, computation in cryptographic algorithms employ Montgomery multiplication, ABR−1 mod N, instead of modular multiplic...
Ping Tak Peter Tang
ARITH
2007
IEEE
14 years 3 months ago
Spectral Modular Exponentiation
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
Gökay Saldamli, Çetin Kaya Koç
ARITH
2007
IEEE
14 years 3 months ago
How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm
The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed wi...
Philippe Langlois, Nicolas Louvet
ARITH
2007
IEEE
14 years 3 months ago
Optimistic Parallelization of Floating-Point Accumulation
Abstract— Floating-point arithmetic is notoriously nonassociative due to the limited precision representation which demands intermediate values be rounded to fit in the availabl...
Nachiket Kapre, André DeHon