In this paper, we show the claims in the original Kipnis-Shamir attack on the HFE cryptosystems and the improved attack by Courtois that the complexity of the attacks is polynomial in terms of the number of variables are invalid. We present computer experiments and a theoretical argument using basic algebraic geometry to explain why it is so. Furthermore we show that even with the help of the powerful new Gröbner basis algorithm like F_4, the Kipnis-Shamir attack still should be exponential but not polynomial. This again is supported by our theoretical argument.

No abstract uploaded!

Using the complex coloring method, we present the graphs of the quantum dilogarithm function Gb(z) and visualize its analytic and asymptotic behaviours. In particular we demonstrate the limiting process when the modified Gb(z)→Γ(z) as b→0. We also survey the relations of Gb(z) with different variants of the quantum dilogarithm function.

No abstract uploaded!

We investigate approximations of the vertex coupling on a star-shaped graph by families of operators with singularly scaled rank-one interactions. We find a family of vertex couplings, generalizing the <i></i>-interaction on the line, and show that with a suitable choice of the parameters they can be approximated in this way in the norm-resolvent sense. We also analyze spectral properties of the involved operators and demonstrate the convergence of the corresponding on-shell scattering matrices.