In this paper, we show that the coupled modified KdV equations possess rich mathematical structures and some remarkable properties. The connections between the system and skew orthogonal polynomials, convergence acceleration algorithms and Laurent property are discussed in detail.

A reconstruction theorem for genus 0 gravitational quantum cohomology and quantum K-theory is proved. A new linear equivalence in the Picard group of the moduli space of genus 0 stable maps relating the pull-backs of line bundles from the target via different markings is used for the reconstruction result. Examples of calculations in quantum cohomology and quantum K-theory are given.

We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security properties and potential feasibility, where the compression functions are randomly chosen high-degree polynomials, and show that under some plausible assumptions, high-degree polynomials as compression functions has good properties. Next, we propose to improve on the efficiency of the system by using some specially designed polynomials generated by a small number of random parameters, where the security of the system would then relies on stronger assumptions, and we give empirical evidence for the validity of using such polynomials.

No abstract uploaded!

No abstract uploaded!