Recent developments in multivariate polynomial solving algorithms have made algebraic cryptanalysis a plausible threat to many cryptosystems. However, theoretical complexity estimates have shown this kind of attack unfeasible for most realistic applications. In this paper we present a strategy for computing Gröbner basis that challenges those complexity estimates. It uses a flexible partial enlargement technique together with reduced row echelon forms to generate lower degree elements–mutants. This new strategy surpasses old boundaries and obligates us to think of new paradigms for estimating complexity of Gröbner basis computation. The new proposed algorithm computed a Gröbner basis of a degree 2 random system with 32 variables and 32 equations using 30 GB which was never done before by any known Gröbner bases solver.

No abstract uploaded!

Let A be a A -algebra with real rank zero. Let A and A be Hilbert A -modules with A being full. Suppose that A is a linear map preserving orthogonality, ie,

We proved the existence of supersymmetric Hermitian metrics with torsion on a class of non-Kaehler manifolds.

Quantum Fourier analysis is a subject that combines an algebraic Fourier transform (pictorial in the case of subfactor theory) with analytic estimates. This provides interesting tools to investigate phenomena such as quantum symmetry. We establish bounds on the quantum Fourier transform F, as a map between suitably defined L^p spaces, leading to an uncertainty principle for relative entropy. We cite several applications of quantum Fourier analysis in subfactor theory, in category theory, and in quantum information. We suggest a topological inequality, and we outline several open problems.