Key exchange protocols from the learning with errors (LWE) problem share many similarities with the Diffie–Hellman–Merkle (DHM) protocol, which plays a central role in securing our Internet. Therefore, there has been a long time effort in designing authenticated key exchange directly from LWE to mirror the advantages of DHM-based protocols. In this paper, we revisit signal leakage attacks and show that the severity of these attacks against LWE-based (authenticated) key exchange is still underestimated. In particular, by converting the problem of launching a signal leakage attack into a coding problem, we can significantly reduce the needed number of queries to reveal the secret key. Specifically, for DXL-KE we reduce the queries from 1,266 to only 29, while for DBS-KE, we need only 748 queries, a great improvement over the previous 1,074,434 queries. Moreover, our new view of signals as binary codes enables recognizing vulnerable schemes more easily. As such we completely recover the secret key of a password-based authenticated key exchange scheme by Dabra et al. with only 757 queries and partially reveal the secret used in a two-factor authentication by Wang et al. with only one query. The experimental evaluation supports our theoretical analysis and demonstrates the efficiency and effectiveness of our attacks. Our results caution against underestimating the power of signal leakage attacks as they are applicable even in settings with a very restricted number of interactions between adversary and victim.

We consider the Stokes conjecture concerning the shape of extreme 2-dimensional water waves. By new geometric methods including a non-linear frequency formula, we prove the Stokes conjecture in the original variables. Our results do not rely on structural assumptions needed in previous results such as isolated singularities, symmetry and monotonicity. Part of our results extends to the mathematical problem in higher dimensions.

No abstract uploaded!

No abstract uploaded!

Let V be a vertex operator algebra with a category C of (generalized) modules that has vertex tensor category structure, and thus braided tensor category structure, and let A be a vertex operator (super)algebra extension of V. We employ tensor categories to study untwisted (also called local) A-modules in C, using results of Huang-Kirillov-Lepowsky showing that A is a (super)algebra object in C and that generalized A-modules in C correspond exactly to local modules for the corresponding (super)algebra object. Both categories, of local modules for a C-algebra and (under suitable conditions) of generalized A-modules, have natural braided monoidal category structure, given in the first case by Pareigis and Kirillov-Ostrik and in the second case by Huang-Lepowsky-Zhang. Our main result is that the Huang-Kirillov-Lepowsky isomorphism of categories between local (super)algebra modules and extended vertex operator (super)algebra modules is also an isomorphism of braided monoidal (super)categories. Using this result, we show that induction from a suitable subcategory of V-modules to A-modules is a vertex tensor functor. We give two applications. First, we derive Verlinde formulae for regular vertex operator superalgebras and regular (1/2)ℤ-graded vertex operator algebras by realizing them as (super)algebra objects in the vertex tensor categories of their even and ℤ-graded components, respectively. Second, we analyze parafermionic cosets C=Com(V_L,V) where L is a positive definite even lattice and V is regular. If the category of either V-modules or C-modules is understood, then our results classify all inequivalent simple modules for the other algebra and determine their fusion rules and modular character transformations. We illustrate both directions with several examples.