Sciweavers

13 search results - page 3 / 3
» Non-interactive Proofs for Integer Multiplication
Sort
View
141
Voted
FDTC
2006
Springer
102views Cryptology» more  FDTC 2006»
15 years 10 months ago
Non-linear Residue Codes for Robust Public-Key Arithmetic
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very hi...
Gunnar Gaubatz, Berk Sunar, Mark G. Karpovsky
176
Voted
ASIAN
2006
Springer
118views Algorithms» more  ASIAN 2006»
15 years 10 months ago
An Approach to Formal Verification of Arithmetic Functions in Assembly
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
Reynald Affeldt, Nicolas Marti
177
Voted
SPAA
2006
ACM
16 years 9 days ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...