Results 201 to 210 of about 546,820 (245)

Digestibility, Passage Rate, Growth, and Digesta Properties in Windsnyer Pigs Fed Increasing Potato Hash Silage. [PDF]

Animals (Basel)
Ncobela CN, Kanengoni AT, Chimonyo M.
europepmc   +1 more source

Design and evaluation of a resilient IBN architecture: Integrating post-quantum cryptography with adaptive threat detection using machine learning. [PDF]

PLoS One
Roy KS, Singh S, Goswami H, Panchal S, Hassan SM.   +4 more
europepmc   +1 more source

Rapid Exploration of the Assembly Chemical Space of Molecular Graphs. [PDF]

J Chem Inf Model
Seet I, Patarroyo KY, Siebert G, Walker SI, Cronin L.   +4 more
europepmc   +1 more source

BAAR: A framework for blockchain-based anonymous and revocable user authentication scheme. [PDF]

PLoS One
Ahmed M, Ahmad A, Zeshan F, Akram S.
europepmc   +1 more source

PSEUDO-CHAINING IN HASH TABLES

, 1978
HALATSIS, C, PHILOKYPROU, G
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Hash chains with diminishing ranges for sensors

International Journal of High Performance Computing and Networking, 2004
Sensors and other constrained devices periodically transmit small information packets motivating the study of hash chains with small domains and ranges. Hash chain based protocols use deferred disclosure and it is often assumed their hash functions are one-way, thus essentially unbreakable.
Phillip G. Bradford, Olga V. Gavrylyako
exaly   +4 more sources

Infinite length hash chains and their applications

Proceedings. Eleventh IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2003
Hash chains are used extensively in various cryptography applications such as one-time passwords, server-supported signatures and micropayments. In this paper, we present a method, called infinite length hash chains to improve the flexibility of this chaining idea by using public-key techniques.
Kemal Bicakci, Nazife Baykal
openaire   +4 more sources

Improved Scalable Hash Chain Traversal

Lecture Notes in Computer Science, 2003
Yaron Sella recently proposed a scalable version of Jakobsson’s algorithm to traverse a hash chain of size n. Given the hash chain and a computation limit m (k=m+1 and \(b=\sqrt[k]{n}\)), Sella’s algorithm traverses the hash chain using a total of kb memory. We improve the memory usage to k(b-1).
exaly   +3 more sources

The application of hash chains and hash structures to cryptography [PDF]

, 2009
In this thesis we study how hash chains and other hash structures can be used in various cryptographic applications. In particular we focus on the applications of entity authentication, signatures and key establishment. We study recursive application of hash functions to create hash chains, hash trees and other hash structures.
Page, Thomas
core   +5 more sources

Determining Minimum Hash Width for Hash Chains

Proceedings of the Third Central European Cybersecurity Conference, 2019
Cryptographic hash functions are used in authentication, and repeated application in hash chains is used in communication protocols. In embedded devices, the width of hash values and the associated effort to evaluate the hash function is crucial, and hence the hash values should be as short as possible but should still be sufficient to guarantee the ...
Martin Dietzfelbinger, Jörg Keller 0001
openaire   +2 more sources