Results 41 to 50 of about 2,222 (156)
Second-Preimage Analysis of Reduced SHA-1 [PDF]
Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-1 continues to be recommended in all applications except digital signatures ...
Christian Rechberger +1 more
core +1 more source
Sliding Motions on Non‐Euclidean State Spaces: A Differential‐Geometric Perspective
ABSTRACT This paper extends sliding‐mode control theory to nonlinear systems evolving on smooth manifolds. Building on differential geometric methods, we reformulate Filippov's notion of solutions, characterize well‐defined vector fields on quotient spaces, and provide a consistent geometric definition of higher‐order sliding modes.
Fernando Castaños
wiley +1 more source
Preimage and pseudo collision attacks on round-reduced DHA-256 hash function
A preimage attack on DHA-256 hash function reduced to 37-round and a pseudo collision attack on the func-tion reduced to 39-round were proposed respectively.Based on the meet-in-the-middle attack,the Biclique technique was used to improve the preimage ...
Jian ZOU +3 more
doaj +2 more sources
A Novel of neutrosophic τ -Structure Ring ExtB and ExtV Spaces [PDF]
In this paper, the concepts of a neutrosophic τ -structure ring spaces, neutrosophic τ -structure ring GδT1/2 spaces and neutrosophic τ -structure ring exterior B spaces and neutrosophic τ -structure ring exterior V spaces are introduced.
R. Narmada Devi
doaj +1 more source
Real‐Time Conformal Maps and Parameterizations
Abstract We present a simple algorithm to conformally map between two simple and bounded planar domains based on the concept of harmonic measure, which is a conformal invariant. With suitable preprocessing, the algorithm is fast enough to compute all possible conformal maps (having three real degrees of freedom) between the two domains in real time in
Q. Chang, C. Gotsman, K. Hormann
wiley +1 more source
An improved preimage attack on MD2 [PDF]
This paper describes an improved preimage attack on the cryptographic hash function MD2. The attack has complexity equivalent to about $2^{73}$ evaluations of the MD2 compression function.
Søren S. Thomsen
core +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
Characterizing Collision and Second-Preimage Resistance in Linicrypt [PDF]
Linicrypt (Carmer & Rosulek, Crypto 2016) refers to the class of algorithms that make calls to a random oracle and otherwise manipulate values via fixed linear operations.
Trevor Swope, Mike Rosulek, Ian McQuoid
core
Tangent Blow‐Ups for Processing Non‐Manifold Geometry
Abstract Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners, self‐intersections, branching junctions, and other singularities, rendering standard methods ill‐defined at ...
Alice Petrov +3 more
wiley +1 more source
Preimage Attacks on the Round-reduced Keccak with Cross-linear Structures
In this paper, based on the work pioneered by Aumasson and Meier, Dinur et al., and Guo et al., we construct some new delicate structures from the roundreduced versions of Keccakhash function family. The new constructed structures are called cross-linear
Ting Li +3 more
doaj +1 more source

