In this paper, self-similarity is illustrated and compared in deterministic and stochastic dissipative systems. Examples are (1) deterministic self-similarity in reaction-diffusion system and Navier-Stokes equations, where solutions eventually decay to zero due to balance of diffusion (viscosity) and nonlinearity;(2) statistical self-similarity in randomly advected passive scalar model of Kraichnan where solutions undergo turbulent decay due to roughness of advection;(3) selfsimilarity in blowup of solutions of fourth order nonlinear parabolic equations of the Cahn-Hillard type. Problems for future research are mentioned, especially those where self-similarity is conjectured based on numerical evidence or physical grounds but mathematically open.

In this paper we prove an existence theorem of global smooth solutions for the Cauchy problem of a class of quasilinear hyperbolic systems with nonlinear dissipative terms under the assumption that only the <i>C</i>⁰-norm of the initial data is sufficiently small, while the <i>C</i>¹-norm of the initial data can be large. The analysis is based on <i>a priori</i> estimates, which are obtained by a generalised Lax transformation.

In this paper we prove the equidistribution of the restriction of the mass of automorphic newforms to a nonsplit torus in the depth aspect. This result is better than the current known results on the similar problem in the eigenvalue aspect. The method is relatively elementary and makes use of the known effective QUE result in the depth aspect.

In this paper, we study how the algebraic attack on the HFE multivariate public key cryptosystem works if we build an HFE cryptosystem on a finite field whose characteristic is not two. Using some very basic algebraic geometry we argue that when the characteristic is not two the algebraic attack should not be polynomial in the range of the parameters which are used in practical applications. We further support our claims with extensive experiments using the Magma implementation of F_4, which is currently the best publicly available implementation of the Gröbner basis algorithm. We present a new variant of the HFE cryptosystems, where we project the public key of HFE to a space of one dimension lower. This protects the system from the Kipnis-Shamir attack and makes the decryption process avoid multiple candidates for the plaintext. We propose an example for a practical application on GF(11) and suggest a test challenge on GF(7).

No abstract uploaded!