Results 61 to 70 of about 1,010 (133)
Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3 [PDF]
Discussions about the choice of a tree hash mode of operation for a standardization have recently been undertaken. It appears that a single tree mode cannot address adequately all possible uses and specifications of a system. In this paper, we review the
Atighehchi, Kevin, Bonnecaze, Alexis
core +3 more sources
LRPS‐GCN: A millimeter wave sparse imaging algorithm based on graph signal
To address the slow speed and poor accuracy issues of traditional millimeter wave sparse imaging, a novel sparse imaging algorithm based on graph convolution model is introduced, utilising low‐rank and piecewise smoothing regular terms to construct the graph signal model and employing a denoising graph convolution network for sparse reconstruction ...
Li Che +3 more
wiley +1 more source
Whirlwind: a new cryptographic hash function [PDF]
A new cryptographic hash function Whirlwind is presented. We give the full specification and explain the design rationale. We show how the hash function can be implemented efficiently in software and give first performance numbers. A detailed analysis of
Barreto, Paulo +4 more
core +3 more sources
The role of viruses in oral mucosal lesions
Abstract The mucosa of the oral cavity is exposed to a large number of different microorganisms such as archaea, bacteria, fungi, parasites, and viruses. Among those, viruses cause specific infections, which can easily be transmitted from one person to another.
Henrik Dommisch +1 more
wiley +1 more source
Quantum authentication with key recycling [PDF]
We show that a family of quantum authentication protocols introduced in [Barnum et al., FOCS 2002] can be used to construct a secure quantum channel and additionally recycle all of the secret key if the message is successfully authenticated, and recycle ...
A Broadbent +23 more
core +2 more sources
Indifferentiable Hashing to Barreto–Naehrig Curves [PDF]
A number of recent works have considered the problem of constructing constant-time hash functions to various families of elliptic curves over finite fields. In the relevant literature, it has been occasionally asserted that constant-time hashing to certain special elliptic curves, in particular so-called BN elliptic curves, was an open problem.
Fouque, Pierre-Alain, Tibouchi, Mehdi
openaire +2 more sources
(a) Blunt force injury to calotte in fresh bone, fractures indicated by black arrows, (b) same calotte after partial cremation, black arrows indicate the same blunt force fractures, the red arrow indicates the fracture showed in (c) and (d), (c) this is the depth analysis produced by the Keyence VHX‐2000 of the fracture pointed to by the red arrow in ...
Hanna Friedlander +4 more
wiley +1 more source
MiMC:Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity [PDF]
We explore cryptographic primitives with low multiplicative complexity. This is motivated by recent progress in practical applications of secure multi-party computation (MPC), fully homomorphic encryption (FHE), and zero-knowledge proofs (ZK) where ...
Albrecht, Martin +4 more
core +4 more sources
Abstract Constraining landslide occurrence rates can help to generate landslide hazard models that predict the spatial and temporal occurrence of landslides. However, most landslide inventories do not include any temporal data due to the difficulties of dating landslide deposits.
J. B. Woodard +3 more
wiley +1 more source
Lattice Boltzmann Method for mixtures at variable Schmidt number
When simulating multicomponent mixtures via the Lattice Boltzmann Method, it is desirable to control the mutual diffusivity between species while maintaining the viscosity of the solution fixed.
Berthier J. +7 more
core +1 more source

