Sciweavers

20 search results - page 4 / 4
» Verification of Integer Multipliers on the Arithmetic Bit Le...
Sort
View
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
13 years 9 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
ARITH
2007
IEEE
13 years 12 months ago
Decimal Floating-Point Multiplication Via Carry-Save Addition
Decimal multiplication is important in many commercial applications including financial analysis, banking, tax calculation, currency conversion, insurance, and accounting. This p...
Mark A. Erle, Michael J. Schulte, Brian J. Hickman...
SPAA
1990
ACM
13 years 9 months ago
Hardware Speedups in Long Integer Multiplication
We present various experiments in Hardware/Software designtradeoffs met in speeding up long integer multiplications. This work spans over a year, with more than 12 different hardw...
Mark Shand, Patrice Bertin, Jean Vuillemin
TPCD
1994
157views Hardware» more  TPCD 1994»
13 years 6 months ago
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
John W. O'Leary, Miriam Leeser, Jason Hickey, Mark...
AES
2000
Springer
117views Cryptology» more  AES 2000»
13 years 10 months ago
A Comparison of AES Candidates on the Alpha 21264
We compare the five candidates for the Advanced Encryption Standard based on their performance on the Alpha 21264, a 64-bit superscalar processor. There are several new features o...
Richard Weiss, Nathan L. Binkert