We consider a charged spinless quantum particle confined to a graph consisting of a loop to which a halfline lead is attached; this system is placed into a homogeneous magnetic field perpendicular to the loop plane. We derive the reflection amplitude and show that there is an infinite ladder of resonances; analyzing the resonance pole trajectories, we show that half of them turn into true embedded eigenvalues provided the flux through the loop is an integer or half-integer multiple of the flux unit hc/e. We also describe a general method to solve the scattering problem on graphs of which the present model is a simple particular case. Finally, we discuss ways in which a state localized initially at the loop decays.

In 2017, Ward Beullens et al. submitted Lifted Unbalanced Oil and Vinegar [3], which is a modification to the Unbalanced Oil and Vinegar Scheme by Patarin. Previously, Ding et al. proposed the Subfield Differential Attack [22] which prompted a change of parameters by the authors of LUOV for the second round of the NIST post quantum standardization competition [4]. In this paper we propose a modification to the Subfield Differential Attack called the Nested Subset Differential Attack which fully breaks half of the parameter sets put forward. We also show by experimentation that this attack is practically possible to do in under 210 min for the level I security parameters and not just a theoretical attack. The Nested Subset Differential attack is a large improvement of the Subfield differential attack which can be used in real world circumstances. Moreover, we will only use what is called the “lifted” structure of LUOV, and our attack can be thought as a development of solving “lifted” quadratic systems.

The Feynman maps introduced first by Truman are examined. The domain considered here consists of the Fresnel-integrable functions in the sense of Albeverio and Hoegh-Krohn; extensions to wider classes of functions will be studied in the following paper. The original definition of the F-maps is slightly modified: we start from the underlying measures on the Hilbert space of paths in order to avoid use of improper integrals. Some new properties of the F-maps are derived. In particular, the dominated convergence theorem is shown to be not valid for the F₁-map (or Feynman integral); this fact is of a certain importance for the classical limit of quantum mechanics.

We propose a new nonmonotone filter method to promote global and fast local convergence for sequential quadratic programming algorithms. Our method uses two filters: a standard, global g-filter for global convergence, and a local nonmonotone l-filter that allows us to establish fast local convergence. We show how to switch between the two filters efficiently, and we prove global and superlinear local convergence. A special feature of the proposed method is that it does not require second-order correction steps. We present preliminary numerical results comparing our implementation with a classical filter SQP method.

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.