Sciweavers

369 search results - page 32 / 74
» Arithmetic of Generalized Jacobians
Sort
View
PKC
1999
Springer
94views Cryptology» more  PKC 1999»
14 years 1 days ago
Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
Public-key implementers often face strong hardware-related constraints. In particular, modular operations required in most cryptosystems generally constitute a computational bottle...
Pascal Paillier
RC
2006
88views more  RC 2006»
13 years 7 months ago
Geometric Constructions with Discretized Random Variables
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
Hans-Peter Schröcker, Johannes Wallner
FOSSACS
2010
Springer
14 years 2 months ago
Counting CTL
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
François Laroussinie, Antoine Meyer, Eudes ...
DATE
2007
IEEE
112views Hardware» more  DATE 2007»
14 years 2 months ago
Automatic synthesis of compressor trees: reevaluating large counters
Despite the progress of the last decades in electronic design automation, arithmetic circuits have always received way less attention than other classes of digital circuits. Logic...
Ajay K. Verma, Paolo Ienne
EUROCRYPT
2005
Springer
14 years 1 months ago
Floating-Point LLL Revisited
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
Phong Q. Nguyen, Damien Stehlé