Based on the analysis made by van Oorschot and Wiener for the complexity of parallel memoryless collision search [5], we show that the memoryless meet-in-the-middle attack which is one part of the whole preimage attack of Khovratovich et. al. [3] on EDON-R hash function has complexity bigger than 2n.

Using direct numerical simulations of rotating Rayleigh-B\'enard convection, we explore the transitions between turbulent states from a 3D flow state towards quasi-2D condensate known as large-scale vortex (LSV). We vary Rayleigh number $Ra$ control parameter and study system response (strength LSV) in terms order parameters assessing energetic content upscale energy flux. By sensitively probin...

In this paper, a pole assignmentproblem of lineartime invariantcontrol system by memoryless output feedback is posed as a least squares poles assignmentproblem and analysed. The coat functions are appropriately modified so M to obtain existenceof global minimumand convergence of the correspondinggradientflow. This approachis also extended to accommodate the output pole assignmentproblem with in...

The contents of this report reflect the views of the authors who are responsible for the facts and the accuracy of the data presented herein. The contents do not necessarily reflect the official views or policies of the State of California. This report does not constitute a standard, specification , or regulation. Abstract We study the real-time estimation of a Markov process over a memoryless ...

A recently-introduced multiscale framework is used to develop efficient analysis and design tech-' niques for networks with self-similar traffic. These allow the interarrival density function for fractal point processes under Bernoulli random erasure to be determined, as well as the counting process distribution for superpositions of these processes. The results suggest that fractal characteris...

The joint Laplace transform of the two sided boundary crossing stopping rule is known for negative exponential model only under certain conditions. In this paper we eliminate need such Our results also apply to problem geometric models. We further illustrate how can be used obtain distribution multidimensional rules memoryless

A lossy compression algorithm for binary redundant memoryless sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryless sequences can be compressed. We propose a linear complexity compressor based on the extended belief propagation, into which an inertia term is heuristically introduced, and show that it has near-optimal ...

In an Achlioptas process two random pairs of {1, . . . , n} arrive in each round and the player has to choose one of them. We study the very restrictive version where player’s decisions cannot depend on the previous history and only one vertex from the two random edges is revealed. We prove that the player can create a giant component in (2 √ 5 − 4 + o(1))n = (0.4721 . . . + o(1))n rounds and t...