Theoretical and Experimental Analysis of Cryptographic Hash Functions
The paper presents a theoretical introduction to the cryptographic hash function theory and a statistical experimental analysis of selected hash functions.
Jacek Tchórzewsk +1 more
doaj +1 more source
High Throughput Implementation of the Keccak Hash Function Using the Nios-II Processor
Presently, cryptographic hash functions play a critical role in many applications, such as digital signature systems, security communications, protocols, and network security infrastructures.
Argyrios Sideris +2 more
doaj +1 more source
Ramanujan graphs in cryptography [PDF]
In this paper we study the security of a proposal for Post-Quantum Cryptography from both a number theoretic and cryptographic perspective. Charles-Goren-Lauter in 2006 [CGL06] proposed two hash functions based on the hardness of finding paths in ...
Costache, Anamaria +4 more
core +2 more sources
SPHINCS$^+$ post-quantum digital signature scheme with Streebog hash function
Many commonly used public key cryptosystems will become insecure once a scalable quantum computer is built. New cryptographic schemes that can guarantee protection against attacks with quantum computers, so-called post-quantum algorithms, have emerged in
Anufriev, M. N. +5 more
core +1 more source
An application of residue number system arithmetics to secure hash functions design [PDF]
This paper presents a cryptographic hash function based on the Residue Number System (RNS), designed to enhance security and computational efficiency. The function leverages the parallelism and modular properties of RNS to achieve high-speed processing ...
Pavlović Milija +3 more
doaj +1 more source
Formally based semi-automatic implementation of an open security protocol [PDF]
International audienceThis paper presents an experiment in which an implementation of the client side of the SSH Transport Layer Protocol (SSH-TLP) was semi-automatically derived according to a model-driven development paradigm that leverages formal ...
Alfredo Pironti +37 more
core +3 more sources
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
The chaining lemma and its application [PDF]
We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called “chain” of random variables, defined by a source distribution X(0)with high min-entropy and a number (say, t in total) of arbitrary functions (T1 ...
D. Boneh +22 more
core +2 more sources
Efficient hardware implementations of high throughput SHA-3 candidates keccak, luffa and blue midnight wish for single- and multi-message hashing [PDF]
In November 2007 NIST announced that it would organize the SHA-3 competition to select a new cryptographic hash function family by 2012. In the selection process, hardware performances of the candidates will play an important role.
Akın, Abdulkadir +6 more
core +2 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

