Results 51 to 60 of about 2,377,005 (278)
A Standalone FPGA-based Miner for Lyra2REv2 Cryptocurrencies
, 2020 Lyra2REv2 is a hashing algorithm that consists of a chain of individual hashing algorithms, and it is used as a proof-of-work function in several cryptocurrencies.
Balatsoukas-Stimming, Alexios +4 more
core +2 more sources
Reliable, Secure, and Efficient Hardware Implementation of Password Manager System Using SRAM PUF
IEEE Access, 2021 Using Physical Unclonable Functions (PUFs) within the server-side has been recently proposed to address security vulnerabilities of the password (PW) authentication mechanism, including attacks on the database (DB) of user credentials.
Mohammad Mohammadinodoushan +4 more
doaj +1 more source
Covert Channels in One-Time Passwords Based on Hash Chains [PDF]
Proceedings of the European Interdisciplinary Cybersecurity Conference, 2020 We present a covert channel between two network devices where one authenticates itself with Lamport's one-time passwords based on a cryptographic hash function. Our channel enables plausible deniability. We also present countermeasures to detect the presence of such a covert channel, which are non-trivial because hash values are randomly looking binary
Keller, Jörg, Wendzel, Steffen
openaire +2 more sources
On the Error Resilience of Ordered Binary Decision Diagrams [PDF]
, 2014 Ordered Binary Decision Diagrams (OBDDs) are a data structure that is used in an increasing number of fields of Computer Science (e.g., logic synthesis, program verification, data mining, bioinformatics, and data protection) for representing and ...
Bernasconi, Anna +2 more
core +3 more sources
Novel self-renewal hash chain scheme based on (t,n) threshold and division tree
Tongxin xuebao, 2013 The introduction of renewal hash chain overcame resource-constrained defect in traditional hash chains,but the existing renewable schemes had still held unsatisfactory performance especially on security and complexity.The definitions of repetition ...
Hai-ping HUANG +4 more
doaj +2 more sources
, 2016 We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$ the expected ...
Knudsen, Mathias Bæk Tejs
core +1 more source
A Fair and Secure Cluster Formation Process for Ad Hoc Networks [PDF]
, 2010 An efficient approach for organizing large ad hoc networks is to divide the nodes into multiple clusters and designate, for each cluster, a clusterhead which is responsible for holding intercluster control information. The role of a clusterhead entails
H. Rifà-Pous +6 more
core +1 more source
Digital signatures over HMAC entangled chains
Engineering Science and Technology, an International Journal, 2022 In this work we present a new digital signature method based on hash chains and the hash message authentication code (HMAC). Unlike Blockchain technology, our approach establishes that the database of transactions is distributed among users, so each one ...
Luis Adrián Lizama-Pérez
doaj +1 more source
Designing Physical Unclonable Functions From Optically Active Materials
Advanced Materials, EarlyView.Assigning unforgeable “fingerprints” to manufactured goods is a key strategy to fight global counterfeiting. Optical physical unclonable functions (PUFs) are chemically generated random patterns of optically active materials serving as unique authenticators.
Maxime Klausen +2 more
wiley +1 more source
Energy-Efficient Hash Chain Traversal
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011 A hash chain H for a one-way hash function h(·) is a sequence of hash values , where vn is a secret value, vi is generated by vi=h(vi+1) for i=n-1,n-2,...,0 an0d v0 is a public value. A hash chain traversal algorithm T computes and outputs the hash chain H, returning vi in time period (called round) i for 1≤i≤n.
Yum, DH, Seo, JW, Lee, PJ
openaire +3 more sources