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.

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.

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

No abstract uploaded!

We combine supersymmetric localization and the conformal bootstrap to study five-dimensional superconformal field theories. To begin, we classify the admissible counter-terms and derive a general relation between the five-sphere partition function and the conformal and flavor central charges. Along the way, we discover a new superconformal anomaly in five dimensions. We then propose a precise triple factorization formula for the five-sphere partition function, that incorporates instantons and is consistent with flavor symmetry enhancement. We numerically evaluate the central charges for the rank-one Seiberg and Morrison-Seiberg theories, and find strong evidence for their saturation of bootstrap bounds, thereby determining the spectra of long multiplets in these theories. Lastly, our results provide new evidence for the F-theorem and possibly a C-theorem in five-dimensional superconformal theories.

The SMS4 block cipher is part of the Chinese WAPI wireless standard. This paper describes the specification and offers a specification for a toy version called simplified SMS4 (S-SMS4). We explore algebraic attacks on SMS4 and S-SMS4 using Gröbner basis attacks on equation systems over GF(2) and GF(2^8), as well as attacks using a SAT solver derived from the GF(2) model. A comparison of SAT and Gröbner basis attacks is provided.

In this paper, we present a new algorithm, such that, for the small integer solution (SIS) problem, if the solution is bounded ( by an integer \beta in l_\infty norm, which we call a bounded SIS (BSIS) problem, {\it and if the difference between the row dimension n and the column dimension m of the corresponding matrix is relatively small with respect the row dimension m}, we can solve it easily with a complexity of polynomial in m.

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 study knots in 3d Chern-Simons theory with complex gauge group SL(N,C), in the context of its relation with 3d N=2 theory (the so-called 3d-3d correspondence). The defect has either co-dimension 2 or co-dimension 4 inside the 6d (2,0) theory, which is compactified on a 3-manifold M^. We identify such defects in various corners of the 3d-3d correspondence, namely in 3d SL(N,C) Chern-Simons theory, in 3d N=2 theory, in 5d N=2 super Yang-Mills theory, and in the M-theory holographic dual. We can make quantitative checks of the 3d-3d correspondence by computing partition functions at each of these theories. This Letter is a companion to a longer paper, which contains more details and more results.

The SFLASH signature scheme stood for a decade as the most successful cryptosystem based on multivariate polynomials, before an efficient attack was finally found in 2007. In this paper, we review its recent cryptanalysis and we notice that its weaknesses can all be linked to the fact that the cryptosystem is built on the structure of a large field. As the attack demonstrates, this richer structure can be accessed by an attacker by using the specific symmetry of the core function being used. Then, we investigate the effect of restricting this large field to a purely linear subset and we find that the symmetries exploited by the attack are no longer present. At a purely defensive level, this defines a countermeasure which can be used at a moderate overhead. On the theoretical side, this informs us of limitations of the recent attack and raises interesting remarks about the design itself of multivariate schemes.

We propose a new efficient hardware implementation of Rainbow signature scheme. We enhance the implementation in three directions. First, we develop a new parallel hardware design for the Gauss-Jordan elimination, and solve a 12 ×12 system of linear equations with only 12 clock cycles. Second, a novel multiplier is designed to speed up multiplication of three elements over a finite field. Third, we design a novel partial multiplicative inverter to speed up the multiplicative inversion of finite field elements. Through further other minor optimizations of the parallelization process and by integrating the major optimizations above, we build a new hardware implementation, which takes only 198 clock cycles to generate a Rainbow signature, a new record in generating digital signatures and four times faster than the 804-clock-cycle Balasubramanian-Bogdanov-Carter-Ding-Rupp design with similar parameters.

Injecting a single hole into a one-dimensional Heisenberg spin chain is probably the simplest case of doping a Mott insulator. The motion of such a single hole will generally induce a many-body phase shift, which can be identified by an exact sign structure of the model known as the phase string. We show that the sign structure is nontrivial even in this simplest problem, which is responsible for the essential properties of Mott physics. We find that the characteristic momentum structure, the Luttinger liquid behavior, and the quantum phase interference of the hole under a periodic boundary condition, can all be attributed to it. We use the density matrix renormalization group (DMRG) numerical simulation to make a comparative study of the t-J chain and a model in which the sign structure is switched off. We further show that the key DMRG results can be reproduced by a variational wave function with incorporating the correct sign structure. Physical implications of the sign structure for doped Mott insulators in general are also discussed.

MFE, a multivariate public key encryption scheme proposed by Wang et al in CT-RSA 2006, was conquered by second order linearization equation (SOLE) attack by Ding et al in PKC 2007. To resist this attack, many improved schemes were proposed. Wang et al in [WFW09 and Wang in [Wan07] both modified MFE and raised the public key from quadratic to quartic equations. We call the two quartic schemes Quartic-1 and Quartic-2 respectively for convenience. They are indeed immune to the SOLE attack. However, we find that there exist many quadratization equations (QEs), which are quadratic in plaintext variables and linear in ciphertext variables and can be derived from the public keys of Quartic-1 and Quartic-2. In this paper, we utilize QEs to recover the corresponding plaintext for a given ciphertext. For Quartic-1, we firstly find there are at least 2r SOLEs, which was regarded as impossible by the original authors, furthermore, we can find at least 35r QEs with a complexity O((90r^2(15r+1)+180r^2+15r(15r+1)/2+27r+1)^w), where r is a small number denoting the degree of extension of finite fields and w ≈ 2.732. The computational complexity of deriving these equations is about 2^{37}. But to find the original plaintext, there still needs 240 times Gröbner basis computations, which needs practically 1.328 seconds each time. For Quartic-2, we make a theoretical analysis and find 18r QEs with a computational complexity O((15r+1)6r(12r+1)+180r^2+27r+1)^w. The complexity is 2^{36} for the parameter proposed in [Wan07], and we can break the scheme practically in 3110.734 seconds. Finally, we show that another improved version of MFE in [WZY07] is insecure against the linearization equation attack although its authors claimed it is secure against high order linearization equation attack. Our attack on the two quartic schemes illustrates that non-linearization equations like quadratization equations which are not degree one in plaintext variables can also be used efficiently to analyze multivariate cryptosystems.

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.

A sensor pixel integrates optical intensity across its extent, and we explore the role that this integration plays in phase space tomography. The literature is inconsistent in its treatment of this integration—some approaches model this integration explicitly, some approaches are ambiguous about whether this integration is taken into account, and still some approaches assume pixel values to be point samples of the optical intensity. We show that making a point-sample assumption results in apodization of and thus systematic error in the recovered ambiguity function, leading to underestimating the overall degree of coherence. We explore the severity of this effect using a Gaussian Schell-model source and discuss when this effect, as opposed to noise, is the dominant source of error in the retrieved state of coherence.

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 this work, we develop conformal bootstrap for Galilean conformal field theory (GCFT). In a GCFT, the Hilbert space could be decomposed into quasiprimary states and its global descendants. Different from the usual conformal field theory, the quasi-primary states in a GCFT constitute multiplets, which are block-diagonized under the Galilean boost operator. More importantly the multiplets include the states of negative norms, indicating the theory is not unitary. We compute global blocks of the multiplets, and discuss the expansion of four-point functions in terms of the global blocks of the multiplets. Furthermore we do the harmonic analysis for the Galilean conformal symmetry and obtain an inversion formula. As the first step to apply the Galilean conformal bootstrap, we construct generalized Galilean free theory (GGFT) explicitly. We read the data of GGFT by using Taylor series expansion of four-point function and the inversion formula independently, and find exact agreement. We discuss some novel features in the Galilean conformal bootstrap, due to the non-semisimpleness of the Galilean conformal algebra and the non-unitarity of the GCFTs.

We study a ground-state ansatz for the single-hole doped t-J model in two dimensions via a variational Monte Carlo (VMC) method. Such a single-hole wave function possesses finite angular momenta generated by hidden spin currents, which give rise to a novel ground state degeneracy in agreement with recent exact diagonalization (ED) and density matrix renormalization group (DMGR) results. We further show that the wave function can be decomposed into a quasiparticle component and an incoherent momentum distribution in excellent agreement with the DMRG results up to an 8×8 lattice. Such a two-component structure indicates the breakdown of Landau's one-to-one correspondence principle, and in particular, the quasiparticle spectral weight vanishes by a power law in the large sample-size limit. By contrast, turning off the phase string induced by the hole hopping in the so-called σ⋅t-J model, a conventional Bloch-wave wave function with a finite quasiparticle spectral weight can be recovered, also in agreement with the ED and DMRG results. The present study shows that a singular effect already takes place in the single-hole-doped Mott insulator, by which the bare hole is turned into a non-Landau quasiparticle with translational symmetry breaking. Generalizations to pairing and finite doping are briefly discussed.

We propose a new basic trapdoor ℓIC (ℓ-Invertible Cycles) of the mixed field type for Multivariate Quadratic public key cryptosystems. This is the first new basic trapdoor since the invention of Unbalanced Oil and Vinegar in 1997. ℓIC can be considered an extended form of the well-known Matsumoto-Imai Scheme A (also MIA or C^∗), and share some features of stagewise triangular systems. However ℓIC has very distinctive properties of its own. In practice, ℓIC is much faster than MIA, and can even match the speed of single-field MQ schemes.

Recently, the Little Dragon Two and Poly-Dragon multivariate based public-key cryptosystems were proposed as efficient and secure schemes. In particular, the inventors of the two schemes claim that Little Dragon Two and Poly-Dragon resist algebraic cryptanalysis. In this paper, we show that MXL2, an algebraic attack method based on the XL algorithm and Ding’s concept of Mutants, is able to break Little Dragon Two with keys of length up to 229 bits and Poly-Dragon with keys of length up to 299. This contradicts the security claim for the proposed schemes and demonstrates the strength of MXL2 and the Mutant concept. This strength is further supported by experiments that show that in attacks on both schemes the MXL2 algorithm outperforms the Magma’s implementation of F4.

Secure group communication systems have become increasingly important for many emerging network applications. An efficient and robust group key management approach is indispensable to a secure group communication system. Motivated by the theory of hyper-sphere, this paper presents a new group key management approach with a group controller (GC). In our new design, a hyper-sphere is constructed for a group and each member in the group corresponds to a point on the hyper-sphere, which is called the member's private point. The GC computes the central point of the hyper-sphere, intuitively, whose “distance” from each member's private point is identical. The central point is published such that each member can compute a common group key, using a function by taking each member's private point and the central point of the hyper-sphere as the input. This approach is provably secure under the pseudo-random function (PRF) assumption. Compared with other similar schemes, by both theoretical analysis and experiments, our scheme (1) has significantly reduced memory and computation load for each group member; (2) can efficiently deal with massive membership change with only two re-keying messages, i.e., the central point of the hyper-sphere and a random number; and (3) is efficient and very scalable for large-size groups.

We review some recent developments in Chern-Simons theory on a hyperbolic 3-manifold M with complex gauge group G. We focus on the case G=SL(N,C) and with M a knot complement. The main result presented in this note is the cluster partition function, a computational tool that uses cluster algebra techniques to evaluate the Chern-Simons path integral. We also review various applications and open questions regarding the cluster partition function and some of its relation with string theory.

We propose a holographic entanglement entropy prescription for general states and regions in two models of holography beyond AdS/CFT known as flat3/BMSFT and (W)AdS3/WCFT. Flat3/BMSFT is a candidate of holography for asymptotically flat three-dimensional spacetimes, while (W)AdS3/WCFT is relevant in the study of black holes in the real world. In particular, the boundary theories are examples of quantum field theories that feature an infinite dimensional symmetry group but break Lorentz invariance. Our holographic entanglement entropy proposal is given by the area of a swing surface that consists of ropes, which are null geodesics emanating from the entangling surface at the boundary, and a bench, which is a spacelike geodesic connecting the ropes. The proposal is supported by an extension of the Lewkowycz-Maldacena argument, reproduces previous results based on the Rindler method, and satisfies the first law of entanglement entropy.

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.

We bootstrap N=(1,0) superconformal field theories in six dimensions, by analyzing the four-point function of flavor current multiplets. Assuming E_8 flavor group, we present universal bounds on the central charge C_T and the flavor central charge C_J . Based on the numerical data, we conjecture that the rank-one E-string theory saturates the universal lower bound on C_J , and numerically determine the spectrum of long multiplets in the rank-one E-string theory. We comment on the possibility of solving the higher-rank E-string theories by bootstrap and thereby probing M-theory on AdS_7×S^4/Z_2.