We present a new method for building pairs of HFE polynomials of high degree, such that the map constructed with such a pair is easy to invert. The inversion is accomplished using a low degree polynomial of Hamming weight three, which is derived from a special reduction via Hamming weight three polynomials produced by these two HFE polynomials. This allows us to build new candidates for multivariate trapdoor functions in which we use the pair of HFE polynomials to fabricate the core map. We performed the security analysis for the case where the base field is GF(2) and showed that these new trapdoor functions have high degrees of regularity, and therefore they are secure against the direct algebraic attack. We also give theoretical arguments to show that these new trapdoor functions over GF(2) are secure against the MinRank attack as well.

For every smooth complex projective variety W of dimension d and nonnegative Kodaira dimension, we show the existence of a universal constant m depending only on d and two natural invariants of the very general fibres of an Iitaka fibration of W such that the pluricanonical system |mK_W| defines an Iitaka fibration. This is a consequence of a more general result on polarized adjoint divisors. In order to prove these results we develop a generalized theory of pairs, singularities, log canonical thresholds, adjunction, etc.

Given a loop on a surface, its homotopy class can be specified as a word consisting of letters representing the homotopy group generators. One of the interesting problems is how to compute the shortest word for a given loop. This is an NP-hard problem in general. However, for a closed surface that allows a hyperbolic metric and is equipped with a canonical set of fundamental group generators, the shortest word problem can be reduced to finding the shortest loop that is homotopic to the given loop, which can be solved efficiently. In this paper, we propose an efficient algorithm to compute the shortest words for loops given on triangulated surface meshes. The design of this algorithm is inspired and guided by the work of Dehn and BirmanSeries. In support of the shortest word algorithm, we also propose efficient algorithms to compute shortest paths and shortest loops under hyperbolic metrics using a novel

We initiate the study of a three dimensional disordered supersymmetric field theory. Specifically, we consider a N = 2 large N Wess-Zumino like model with cubic superpotential involving couplings drawn from a Gaussian random ensemble. Taking inspiration from analyses of lower dimensional SYK like models we demonstrate that the theory flows to a strongly coupled superconformal fixed point in the infra-red. In particular, we obtain leading large N spectral data and operator product coefficients at the critical point. Moreover, the analytic control accorded by the model allows us to compare our results against those derived in the conformal bootstrap program and demonstrate consistency with general expectations.

Value-at-risk measures the worst loss to be expected of a portfolio over a given time horizon at a given confidence level. Calculation of VaR frequently involves estimating the volatility of return processes and quantiles of standardized returns. In this paper, several semiparametric techniques are introduced to estimate the volatilities. In addition, both parametric and nonparametric techniques are proposed to estimate the quantiles of standardized return processes. The newly proposed techniques also have the flexibility to adapt automatically to the changes in the dynamics of market prices over time. The combination of newly proposed techniques for estimating volatility and standardized quantiles yields several new techniques for evaluating multiple period VaR. The performance of the newly proposed VaR estimators is evaluated and compared with some of existing methods. Our simulation results and empirical