7055 search results - page 101 / 1411 » Some New 4-Designs |
158
click to vote
ACISP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Multivariate public-key cryptosystems (sometimes polynomial-based PKC’s or just multivariates) handle polynomials of many variables over relatively small fields instea...
156
click to vote
PDCAT
2005
Springer
15 years 11 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
147
click to vote
PKC
2005
Springer
15 years 11 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
140
click to vote
DOLAP
2004
ACM
15 years 11 months ago
2004
ACM
Nowadays, decision support systems are evolving in order to handle complex data. Some recent works have shown the interest of combining on-line analysis processing (OLAP) and data...
152
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...