Sciweavers

814 search results - page 36 / 163
» Analysis of Modular Arithmetic
Sort
View
LPAR
2010
Springer
14 years 7 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...
JUCS
2010
124views more  JUCS 2010»
14 years 8 months ago
Performance Optimizations for DAA Signatures on Java enabled Platforms
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
Kurt Dietrich, Franz Röck
CASC
2011
Springer
262views Mathematics» more  CASC 2011»
13 years 10 months ago
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
William Hart, Andrew Novocin
FMCAD
2009
Springer
15 years 4 months ago
Mixed abstractions for floating-point arithmetic
stractions for Floating-Point Arithmetic Angelo Brillout Computer Systems Institute, ETH Zurich Daniel Kroening and Thomas Wahl Oxford University Computing Laboratory Abstract—Fl...
Angelo Brillout, Daniel Kroening, Thomas Wahl
MOC
2011
14 years 4 months ago
Fast evaluation of modular functions using Newton iterations and the AGM
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
Régis Dupont