Multivariate Cryptography, as one of the main candidates for establishing post-quantum cryptosystems, provides strong, efficient and well-understood digital signature schemes such as UOV, Rainbow, and Gui. While Gui provides very short signatures, it is, for efficiency reasons, restricted to very small finite fields, which makes it hard to scale it to higher levels of security and leads to large key sizes. In this paper we propose a signature scheme called HMFEv (“Hidden Medium Field Equations”), which can be seen as a multivariate version of HFEv. We obtain our scheme by applying the Vinegar Variation to the MultiHFE encryption scheme of Chen et al. We show both theoretically and by experiments that our new scheme is secure against direct and Rank attacks. In contrast to other schemes of the HFE family such as Gui, HMFEv can be defined over arbitrary base fields and therefore is much more efficient in terms of both performance and memory requirements. Our scheme is therefore a good candidate for the upcoming standardization of post-quantum signature schemes.

We consider a two-dimensional particle of charge e interacting with a homogeneous magnetic field perpendicular to the plane and a potential well which is transported along a closed loop in the plane. We show that a bound state corresponding to a simple isolated eigenvalue acquires at that Berry's phase equal to 2 sgn e times the number of flux quanta through the oriented area encircled by the loop. We also argue that this is a purely quantum effect since the corresponding Hannay angle is zero.

Let <i>A</i> and <i>B</i> be non-negative self-adjoint operators in a separable Hilbert space such that their form sum <i>C</i> is densely defined. It is shown that the Trotter product formula holds for imaginary parameter values in the <i>L</i> ²-norm, that is, one has <div class="gsh_dspfr"> \lim_{no+\infty} \int\limits^T_{-T} \left\|\left(e^{-itA/n}e^{-itB/n} ight)^nh - e^{-itC}hight\|^2dt = 0

We show that Multivariate Public Key Cryptosystems (MPKCs) over fields of small odd prime characteristic, say 31, can be highly efficient. Indeed, at the same design security of 2^{80} under the best known attacks, odd-char MPKC is generally faster than prior MPKCs over \GF{2^k}, which are in turn faster than "traditional'' alternatives. This seemingly counter-intuitive feat is accomplished by exploiting the comparative over-abundance of small integer arithmetic resources in commodity hardware, here embodied by SSE2 or more advanced special multimedia instructions on modern x86-compatible CPUs. We explain our implementation techniques and design choices in implementing our chosen MPKC instances modulo small a odd prime. The same techniques are also applicable in modern FPGAs which often contains a large number of multipliers.

No abstract uploaded!