Sciweavers

69 search results - page 13 / 14
» Prescaled Integer Division
Sort
View
ICIP
1998
IEEE
14 years 9 months ago
An Explicit Closed-Form Solution to the Limited-Angle Discrete Tomography Problem for Finite-Support Objects
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...
Andrew E. Yagle
ARITH
2005
IEEE
14 years 1 months ago
The Residue Logarithmic Number System: Theory and Implementation
— The Residue Logarithmic Number System (RLNS) represents real values as quantized logarithms which, in turn, are represented using the Residue Number System (RNS). Compared to t...
Mark G. Arnold
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
14 years 21 days ago
Faster Double-Size Modular Multiplication from Euclidean Multipliers
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
Benoît Chevallier-Mames, Marc Joye, Pascal P...
FC
2010
Springer
196views Cryptology» more  FC 2010»
13 years 11 months ago
Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...
Jorge Guajardo, Bart Mennink, Berry Schoenmakers
CADE
2005
Springer
14 years 7 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison