Public-key implementers often face strong hardware-related constraints. In particular, modular operations required in most cryptosystems generally constitute a computational bottle...
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
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...
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...
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...