Results 51 to 60 of about 157,357 (284)
Faster 64-bit universal hashing using carry-less multiplications [PDF]
, 2015 Intel and AMD support the Carry-less Multiplication (CLMUL) instruction set in their x64 processors. We use CLMUL to implement an almost universal 64-bit hash family (CLHASH).
Kaser, Owen, Lemire, Daniel
core +2 more sources
Deterministic Detection of Single Ion Implantation
Advanced Engineering Materials, EarlyView.Focused ion beam implantation with high detection efficiencies will enable the rapid and scalable fabrication of advanced spin‐based technologies such as qubits. This work presents the detection efficiencies of a wide range of ions implanted into solid‐state hosts, with efficiencies of >90% recorded for ion species and substrate combinations of ...
Mason Adshead +6 more
wiley +1 more source
Ranking-Based Deep Hashing Network for Image Retrieval
IEEE Access, 2022 In large-scale image retrieval, the deep learning-based hashing methods have significantly progressed. However, most of the existing deep hashing methods still have the problems of low feature learning efficiency and weak ranking relationship ...
Zhisheng Zhang +5 more
doaj +1 more source
Key recycling in authentication
, 2014 In their seminal work on authentication, Wegman and Carter propose that to authenticate multiple messages, it is sufficient to reuse the same hash function as long as each tag is encrypted with a one-time pad.
Portmann, Christopher
core +1 more source
Advanced Healthcare Materials, EarlyView.Platform system to create biofabricated 3D spinal cord tissue models: Combining high resolution PCL fiber placement, a customized, hyaluronic acid‐based hydrogel, two cell types (spinal cord neurons and astrocytes) together with three distinct laminin isoforms allow the formation of functional cell–cell network interactions.
Nicoletta Murenu +12 more
wiley +1 more source
On the Indifferentiability of the Grøstl Hash Function [PDF]
, 2010 The notion of indifferentiability, introduced by Maurer et al., is an important criterion for the security of hash functions. Concretely, it ensures that a hash function has no structural design flaws and thus guarantees security against generic attacks up to the proven bounds. In this work we prove the indifferentiability of Grostl, a second round SHA-
Elena Andreeva 0001 +2 more
openaire +3 more sources
Bottom‐Up Programming of Cell States in Cancer Organoids with Defined Synthetic Adhesion Cues
Advanced Materials, EarlyView.A bottom‐up biomaterial platform is developed to program transcriptomic states in pancreatic cancer organoids by tuning adhesion cues within synthetic matrices. By combining a Design of Experiments framework with multiobjective optimization, matrix compositions are identified that enrich specific cellular programs like EMT.
Ali Nadernezhad +6 more
wiley +1 more source
Verifiable Random Functions (VRFs) [PDF]
, 2018 A Verifiable Random Function (VRF) is the public-key version of a keyed cryptographic hash. Only the holder of the private key can compute the hash, but anyone with public key can verify the correctness of the hash.
Goldberg, Sharon +3 more
core
Byzantine Modification Detection in Multicast Networks With Random Network Coding [PDF]
, 2008 An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as ...
Effros, Michelle +5 more
core +1 more source
Machine Learning for Green Solvents: Assessment, Selection and Substitution
Advanced Science, EarlyView.Environmental regulations have intensified demand for green solvents, but discovery is limited by Solvent Selection Guides (SSGs) that quantify solvent sustainability. Training a machine learning model on GlaxoSmithKline SSG, a database of sustainability metrics for 10,189 solvents, GreenSolventDB is developed. Integrated with Hansen solubility metrics,
Rohan Datta +4 more
wiley +1 more source