Sciweavers

814 search results - page 24 / 163
» Analysis of Modular Arithmetic
Sort
View
JLP
2006
92views more  JLP 2006»
14 years 10 months ago
Exact real arithmetic using centred intervals and bounded error terms
Approximations based on dyadic centred intervals are investigated as a means for implementing exact real arithmetic. It is shown that the field operations can be implemented on th...
Jens Blanck
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
15 years 3 months ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
15 years 2 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater
FORMATS
2010
Springer
14 years 8 months ago
Natural Domain SMT: A Preliminary Assessment
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
Scott Cotton
CAIP
2007
Springer
176views Image Analysis» more  CAIP 2007»
15 years 4 months ago
A Modular Approach for Automating Video Analysis
Automating the steps involved in video processing has yet to be tackled with much success by vision developers and knowledge engineers. This is due to the difficulty in formulating...
Gayathri Nadarajan, Arnaud Renouf