128 search results - page 13 / 26 » Fast Integer Multiplication using Modular Arithmetic |
118
click to vote
MASCOTS
2001
15 years 3 months ago
2001
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
74
Voted
ICCD
2001
IEEE
15 years 10 months ago
2001
IEEE
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...
123
Voted
IACR
2011
14 years 1 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
125
Voted
ASIAN
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
109
Voted
TVLSI
2010
14 years 8 months ago
2010
The selective use of carry-save arithmetic, where appropriate, can accelerate a variety of arithmetic-dominated circuits. Carry-save arithmetic occurs naturally in a variety of DSP...