This paper describes an improved, IEEE conforming oating-point addition algorithm. This algorithm has only one addition step involving the signi cand in the worst-case path, hence o ering a considerable speed advantage over the existing algorithms, which typically require two to three addition steps.

Solving constraints over the oating point numbers is a key issue in the process of software validation and veri cation. Techniques to solve such constraints on the basis of projection functions have been successfully developed. However, though correct, this approach can lead to slow convergence phenomena for very common constraints like addition and subtraction constraints. In this paper, we in...

The successful application to elliptic curve cryptography of side-channel attacks, in which information about the secret key can be recovered from the observation of side channels like power consumption, timing, or electromagnetic emissions, has motivated the recent development of unified formulæ for elliptic curve point operations. In this paper, we show how an attack introduced by Walter can ...

ÐThis paper presents a floating-point addition algorithm and adder pipeline design employing a packet forwarding pipeline paradigm. The packet forwarding format and the proposed algorithms constitute a new paradigm for handling data hazards in deeply pipelined floating-point pipelines. The addition and rounding algorithms employ a four stage execution phase pipeline with each stage suitable for...