A cryptanalytic attack on the use of short RSA secret exponents is described. This attack makes use of an algorithm based on continued fractions which finds the numerator and denominator of a fraction in polynomial time when a close enough estimate of the fraction is known. The public exponent e and the modulus pq can be used to create an estimate of a fraction which involves the secret exponen...

This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify a correct gadget that characterizes smoothness of functions, either a modulus of smoothness or a Kfunctional, the two of which are often equivalent. We will...

In this study four statistical grapheme-to-phoneme (G2P) conversion methods for canonical German are compared. The G2P models differ in terms of usage of morphologic information and of phoneme history (left context) information. In order to evaluate our models we introduce two measures, namely mean normalized Levenshtein distance for classification accuracy and conditional relative entropy for ...

Let F be a class of functions deened on a d-dimensional domain. Our task is to compute H m-norm "-approximations to solutions of 2mth-order elliptic boundary-value problems Lu = f for a xed L and for f 2 F. We assume that the only information we can compute about f 2 F is the value of a nite number of continuous linear functionals of f, each evaluation having cost c(d). Previous work has assume...