In this paper we show how to totally break the fully homomorphic encryption scheme of eprint 2017/458.

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.

No abstract uploaded!

A product formula is proved which involves the unitary group generated by a semibounded self-adjoint operator and an orthogonal projection P. It gives a partial answer to the question about existence of the limit which describes quantum Zeno dynamics in the subspace Ran P.

The mutual intensity and its equivalent phase-space representations quantify an optical field's state of coherence and are important tools in the study of light propagation and dynamics, but they can only be estimated indirectly from measurements through a process called coherence retrieval, otherwise known as phase-space tomography. As practical considerations often rule out the availability of a complete set of measurements, coherence retrieval is usually a challenging high-dimensional ill-posed inverse problem. In this paper, we propose a trace-regularized optimization model for coherence retrieval and a provably convergent adaptive accelerated proximal gradient algorithm for solving the resulting problem. Applying our model and algorithm to both simulated and experimental data, we demonstrate an improvement in reconstruction quality over previous models as well as an increase in convergence speed compared to existing first-order methods.

We combine the method of searching for an invariant subspace of the unbalanced Oil and Vinegar signature scheme and the Minrank method to defeat the new TTS signature scheme, which was suggested for low-cost smart card applications at CHES 2004. We show that the attack complexity is less than 2^{50}.

Recent studies have shown that the entropy production rate for the master equation consists of two nonnegative terms: the adiabatic and non-adiabatic parts, where the non-adiabatic part is also known as the dissipation rate of a Boltzmann-Shannon relative entropy. In this paper, we provide some nonzero lower bounds for the relative entropy, the entropy production rate, and its adiabatic and non-adiabatic parts. These nonzero lower bounds not only reveal some novel dissipative properties for general nonequilibrium processes which are much stronger than the second law of thermodynamics, but also impose some new constraints on thermodynamic constitutive relations. Moreover, we also provide a mathematical application of these nonzero lower bounds by studying the long-time behavior of the master equation. Extensions to the Tsallis statistics are also discussed, including the nonzero lower bounds for the Tsallis-type relative entropy and its dissipation rate.

We give exact formulas for the growth of the ideal Aλ for λ a quadratic element of the algebra of Boolean functions over the Galois field GF(2). That is, we calculate dim A_k λ where A_k is the subspace of elements of degree less than or equal to k. These results clarify some of the assertions made in the article of Yang, Chen and Courtois [22,23] concerning the efficiency of the XL algorithm.

We prove that a random map drawn from any class \mathfrak{C} of polynomial maps from (F_q)^n to (F_q)^{n+r} that is (i) totally random in the affine terms, and (ii) has a negligible chance of being not strongly one-way, provides a secure PRNG (hence a secure stream cipher) for any q. Plausible choices for are semi-sparse (i.e., the affine terms are truly random) systems and other systems that are easy to evaluate from a small (compared to a generic map) number of parameters. To our knowledge, there are no other positive results for provable security of specialized polynomial systems, in particular sparse ones (which are natural candidates to investigate for speed). We can build a family of provably secure stream ciphers a rough implementation of which at the same security level can be more than twice faster than an optimized QUAD (and any other provably secure stream ciphers proposed so far), and uses much less storage. This may also help build faster provably secure hashes. We also examine the effects of recent results on specialization on security, e.g., Aumasson-Meier (ICISC 2007), which precludes Merkle-Damgaard compression using polynomials systems {uniformly very sparse in every degree} from being universally collision-free. We conclude that our ideas are consistent with and complements these new results. We think that we can build secure primitives based on specialized (versus generic) polynomial maps which are more efficient.

Schrodinger operators with strongly singular interactions, typically supported by a set of Lebesgue measure zero, eg, by a nite or countable set of points, appeared in quantum mechanics from the very beginning~cf., eg,[35, 28]. Their use had essentially two motivations. First of all, they were expected to provide a reasonable description in the physical situations when the real interaction has a very small range comparing to the other characteristic lengths of the problem, for instance, to the wavelength of the scattered particles. On the other hand, the fact that the interaction support is small and outside it a free solution of the corresponding Schrodinger equation may be used often makes such models explicitly solvable. Until the beginning of the sixties, however, the occasional use of these point interactions remained purely formal. Only after the work of Berezin and Faddeev [11] did it become clear they can be

In this paper, we will systematically study who indeed are the hard lattice cases in LLL reduction. The “hard” cases here mean for their special geometric structures, with a comparatively high “failure probability” that LLL can not solve SVP even by using a powerful relaxation factor. We define the perfect lattice as the “Beauty”, which is given by basis of vectors of the same length with the mutual angles of any two vectors to be exactly 60°. Simultaneously the “Beasts” lattice is defined as the lattice close to the Beauty lattice. There is a relatively high probability (e.g. 15.0% in 3 dimensions) that our “Beasts” bases can withstand the exact-arithmetic LLL reduction (relaxation factors δ close to 1), comparing to the probability (corresponding <0.01%) when apply same LLL on random bases from TU Darmstadt SVP Challenge. Our theoretical proof gives us a direct explanation of this phenomenon. Moreover, we give rational Beauty bases of 3 and 8 dimensions, an irrational Beauty bases of general high dimensions. We also give a general way to construct Beasts lattice bases from the Beauty ones. Experimental results show the Beasts bases derived from Beauty can withstand LLL reduction by a stable probability even for high dimensions. Our work in a way gives a simple and direct way to explain how to build a hard lattice in LLL reduction.

Consider an unstable quantum system that has been found undecayed at an instant s and denote by R(t,s) the rate of its regeneration into an original (undecayed) state at a later instant t+s. It is proved that the reduced evolution is a semigroup, i.e., there is no regeneration at all, provided R(t,s)1/2 can be estimated by a sufficiently regular function that is nondecreasing in s and has zero derivative with respect to t at t=0 for every s. This generalizes the theorem of Misra and Sinha [Helv. Phys. Acta 45, 619 (1972)] in a different direction than in a recent paper by Nishioka [J. Math. Phys. 29, 1860 (1988)].

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.

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.

The notion of a vector space is obtained by axiomatization of the properties of the threedimensional space of Euclidean geometry, or of configuration spaces of classical mechanics. A vector (or linear) space V is a set {x, y,...} equipped with the operations of summation,[x, y] x+ y V, and multiplication by a complex or real number ,[, x] x V, such that (i) The summation is commutative, x+ y= y+ x, and associative,(x+ y)+ z= x+(y+ z). There exist a zero element 0 V, and an inverse element x V, to any x V so that x+ 0= x and x+( x)= 0 holds for all x V.(ii) (x)=() x and 1x= x.(iii) The summation and multiplication are distributive, (x+ y)= x+ y and (+ ) x= x+ x.

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.

Some electromagnetic materials exhibit, in a given frequency range, effective dielectric permittivity and/or magnetic permeability which are negative. In the literature, they are called negative index materials, left-handed materials or meta-materials. We propose in this paper a numerical method to solve a wave transmission between a classical dielectric material and a meta-material. The method we investigate can be considered as an alternative method compared to the method presented by the second author and co-workers. In particular, we shall use the abstract framework they developed to prove well-posedness of the exact problem. We recast this problem to fit later discretization by the staggered discontinuous Galerkin method developed by the first author and co-worker, a method which relies on introducing an auxiliary unknown. Convergence of the numerical method is proven, with the help of explicit infsup

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.

Properties of the subset of polygonal paths in the Hilbert space of paths referring to a<i>d</i>-dimensional quantum-mechanical system are examined. The results are used to discuss various types of polygonal-path approximations appearing in the functional-integration theory. The uniform approximation is applied to extend the definition of the Feynman maps from our previous paper and to prove consistency of this extension. Relations of the extended<i>F</i> _<i>i</i> map to the Wiener integral are given.

This paper proposes a two-level continuum transportation system approach to modeling a dynamic taxi traffic assignment (DTTA) problem in a dense network with real-time traffic information provision and three types of vehicles, including private cars, occupied taxis, and vacant taxis. The proposed approach treats the dense network as a continuum in the first level, in which private car and occupied taxi drivers are free to choose their paths in a two-dimensional continuous space. The proposed approach also divides the modeling region into many identical squares to form a cell-based network in the second level, in which the cells are classified into two categories: target cell with an acceptable expected rate of return (EROR) to vacant taxi drivers and non-target cell with an unacceptable EROR. The EROR associated with a cell is the ratio of the cumulative expected profit of a taxi driver who successfully picks up a customer during the customer search that starts from that cell to the sum of expected search time for this customer and expected occupied travel time to serve this customer. Based on the cell-based network, we develop a cell-based intervening opportunity model to capture the fact that vacant taxi drivers can meet a customer on the way to their destination zones and estimate the EROR. Each vacant taxi driver has a mixed strategy to determine his/her customer-search direction according to the EROR: Each vacant taxi driver in a target cell selects its neighbor cells with maximum EROR, and each vacant taxi driver in a non-target cell selects the travel time-based shortest path to his/her target cell. Meanwhile, each private car driver chooses the path that minimizes his/her own generalized travel cost, and each occupied taxi driver chooses the path that minimizes his/her customer's generalized in-vehicle travel cost. In our model, traffic density in the system is governed by the conservation law (CL), and the flow directions of different vehicles are determined by the path-choice strategies of their drivers, which are captured by Hamilton–Jacobi (HJ) equations. Both the proposed CL and HJ equations can be solved by the Lax–Friedrichs scheme, which forms the backbone of the developed solution algorithm. Finally, numerical examples and a case study are used to demonstrate the properties of the model, the performance of the solution algorithm, and the value of using our methodology for estimating network performance.

No abstract uploaded!

The most general admissible boundary conditions are derived for an idealized AharonovBohm flux intersecting the plane at the origin on the background of a homogeneous magnetic field. A standard technique based on self-adjoint extensions yields a four-parameter family of boundary conditions; the other two parameters of the model are the AharonovBohm flux and the homogeneous magnetic field. The generalized boundary conditions may be regarded as a combination of the AharonovBohm effect with a point interaction. Spectral properties of the derived Hamtonians are studied in detail.

The initial decay rate of a mixed state is discussed; is shown to be zero for finite energy states. In the previous paper [1] we investigated a general scheme for description of unstable systems. One of our results concerned the initial decay rate. Generalizing the earlier results of Horwitz and Marchand (see [2] and other references contained in [1]) we proved there, that the initial decay rate of any pure state of the unstable system equals to zero, if this state is so called finite energy state. Here we shall be interested in the same problem, assuming now the state of the decaying system to be in general mixed. Such assumption seems to be reasonable: firstly, from the point of view of an experiment it is too restrictive to treat only pure states of unstable systems. In particular, mixed states are generally considered in the recent studies about the influence of measuring devices on the time evolution of the unstable system [3

We consider a Schrdinger particle on a graph consisting of <i>N</i> links joined at a single point. Each link supports a real locally integrable potential <i>V</i> _<i>j</i>; the self-adjointness is ensured by the type boundary condition at the vertex. If all the links are semi-infinite and ideally coupled, the potential decays as <i>x</i> ¹ along each of them, is nonrepulsive in the mean and weak enough, the corresponding Schrdinger operator has a single negative eigenvalue; we find its asymptotic behavior. We also derive a bound on the number of bound states and explain how the coupling constant may be interpreted in terms of a family of squeezed potentials.