No abstract uploaded!

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.

We investigate a class of supersymmetric quantum mechanical theories (with two supercharges) having tensor-valued degrees of freedom which are dominated by melon diagrams in the large N limit. One motivation was to examine the interplay between supersymmetry and melonic dominance and potential implications for building toy models of holography. We find a definite tension between supersymmetry (with dynamical bosons) and melonic dominance in this class of systems. More specifically, our theories attain a low energy non-supersymmetric conformal fixed point. The origin of supersymmetry breaking lies in the need to regularize bosonic and fermionic degrees of freedom independently. We investigate various aspects of the low energy spectrum and also comment on related examples with different numbers of supercharges. Along the way we also derive some technical results for SL(2, ℝ) wavefunctions for fermionic excitations.