We study the large time asymptotic speeds (turbulent flame speeds sT) of the simplified HamiltonJacobi (HJ) models arising in turbulent combustion. One HJ model is G-equation describing the front motion law in the form of local normal velocity equal to a constant (laminar speed) plus the normal projection of fluid velocity. In level set formulation, G-equations are HJ equations with convex (L1 type) but non-coercive Hamiltonians. The other is the quadratically nonlinear (L2 type) inviscid HJ model of MajdaSouganidis derived from the KolmogorovPetrovskyPiskunov reactive fronts. Motivated by a question posed by Embid, Majda and Souganidis (1995)[10], we compare the turbulent flame speeds sTs from these inviscid HJ models in two-dimensional cellular flows or a periodic array of steady vortices via sharp asymptotic estimates in the regime of large amplitude. The estimates are obtained by analyzing the action minimizing trajectories in the Lagrangian representation of solutions (Lax formula and its extension) in combination with delicate gradient bound of viscosity solutions to the associated cell problem of homogenization. Though the inviscid turbulent flame speeds share the same leading order asymptotics, their difference due to nonlinearities is identified as a subtle double logarithm in the large flow amplitude from the sharp growth laws. The turbulent flame speeds differ much more significantly in the corresponding viscous HJ models. 2013 Elsevier Masson SAS. All rights reserved.

No abstract uploaded!

In this article, the authors cryptanalyze a k-out-of-n oblivious transfer protocol proposed in [12]. Their protocol is one of the most efficient k-out-of-n oblivious transfer protocols and is directly built from a 1-out-of-n oblivious transfer protocol. However, their analysis shows that the proposed k-out-of-n oblivious transfer protocol is insecure, though the primitive 1-out-of-n oblivious transfer protocol is secure. The weakness is that with high probability the receiver in their protocol can get all n secret messages encrypted by the sender. Finally, they fix the serious flaw and introduce an improved k-out-of-n oblivious transfer protocol without increasing any cost.

No abstract uploaded!

No abstract uploaded!