358 search results - page 66 / 72 » GCD of Many Integers |
LATIN
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
ASIACRYPT
2003
Springer
14 years 21 days ago
2003
Springer
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
COCO
2003
Springer
14 years 21 days ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
ACISP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
LCTRTS
2001
Springer
13 years 12 months ago
2001
Springer
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...