Results 31 to 40 of about 3,133 (154)
Reversible and Plausibly Deniable Covert Channels in One-Time Passwords Based on Hash Chains
Covert channels enable stealthy communications over innocent appearing carriers. They are increasingly applied in the network context. However, little work is available that exploits cryptographic primitives in the networking context to establish such ...
Jörg Keller, Steffen Wendzel
doaj +1 more source
SMASH – A Cryptographic Hash Function [PDF]
This paper presents a new hash function design, which is different from the popular designs of the MD4-family. Seen in the light of recent attacks on MD4, MD5, SHA-0, SHA-1, and on RIPEMD, there is a need to consider other hash function design strategies. The paper presents also a concrete hash function design named SMASH.
openaire +1 more source
Bad Directions in Cryptographic Hash Functions
A 25-gigabyte “point obfuscation” challenge “using security parameter 60” was announced at the Crypto 2014 rump session; “point obfuscation” is another name for password hashing. This paper shows that the particular matrix-multiplication hash function used in the challenge is much less secure than previous password-hashing functions are believed to be.
Daniel J. Bernstein +3 more
openaire +4 more sources
A Cryptographic Hash Function from Markoff Triples
Cryptographic hash functions from expander graphs were proposed by Charles, Goren, and Lauter in [CGL] based on the hardness of finding paths in the graph. In this paper, we propose a new candidate for a hash function based on the hardness of finding paths in the graph of Markoff triples modulo p.
Elena Fuchs +3 more
openaire +3 more sources
The purpose of this article is to construct an internal function underlying the “Sponge” scheme for constructing cryptographic hash functions. An internal function in the “Sponge” scheme is a fixed-length transformation or permutation that
R. M. Ospanov +3 more
doaj +1 more source
Secure Parallel Image Cryptographic Hash Function Using a Novel 2D High-Randomness Hyperchaotic Map
For image data, the processing of each pixel using a cryptographic hash function is linear, and the existing cryptographic hash function lacks parallel processing of image width and height.
Mingrui Qi, Dongdong Wang
doaj +1 more source
ON THE UNIVERSAL TREE MODE OF HASH CODE GENERATION
Classical approaches to the construction of hash function modes, based on the using of iterative procedures, do not allow efficient processing of large amounts of data and can’t be adapted to parallel computing architectures.
Dmitriy S. Bogdanov +2 more
doaj +1 more source
Construction and Analysis of SHA-256 Compression Function Based on Chaos S-Box
To further improve the security of SHA-256, a compression function construction scheme based on chaotic S-box is proposed. Through the reasonable design of the iteration mode and using the nonlinearity, confusion, and anti-difference of chaotic S-box ...
Juan Wang, Ge Liu, Yongqi Chen, Shu Wang
doaj +1 more source
Low-Complexity Cryptographic Hash Functions .
Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which ...
Applebaum, Benny +4 more
openaire +5 more sources
Anti-disassembly using Cryptographic Hash Functions [PDF]
Computer viruses sometimes employ coding techniques intended to make analysis difficult for anti-virus researchers; techniques to obscure code to impair static code analysis are called anti-disassembly techniques. We present a new method of anti-disassembly based on cryptographic hash functions which is portable, hard to analyze, and can be used to ...
John Aycock +2 more
openaire +1 more source

