This paper gives a survey on cryptographic hash functions. It gives an overview of all types of hash functions and reviews design principals and possible methods of attacks. It also focuses on keyed hash functions and provides the applications, requirements, and constructions of keyed hash functions.

This document describes a cryptographic authentication mechanism for Babel routing protocol, updating, but not superceding RFC 6126. The mechanism allocates two new TLV types for the authentication data, uses HMAC and is both optional and backward compatible.

We believe that there is no real data protection without our own tools. Therefore, our permanent aim is to have more of our own codes. In order to achieve that, it is necessary that a lot of young researchers become interested in cryptography. We believe that the encoding of cryptographic algorithms is an important step in that direction, and it is the main reason why in this paper we present a...

Remodularization aims improving software modularity and making more explicit component and architectural information. In order to remodularize their applications, maintainers need tools enabling component and architecture recovery. There exist several approaches for the extraction of component information from Java source code. Only few of them provide automatic support taking into account mode...

Most recent papers about visual cryptography for halftone images are dedicated to get a higher contrast decoded image. However, the hidden visual pattern often blends into the background image and leads to a confused image. In this paper, we propose an improved method for halftone image hiding. By using the proposed method, the background image can be eliminated and the hidden visual pattern ca...

Goldreich-Goldwasser-Halevi (GGH) public key cryptosystem is an instance of lattice-based cryptosystems whose security is based on the hardness of lattice problems. In fact, GGH cryptosystem is the lattice version of the first code-based cryptosystem, proposed by McEliece. However, it has a number of drawbacks such as; large public key length and low security level. On the other hand, Low Densi...

Nonlinear functions have important applications in coding theory and cryptography [16, 7]. Linear codes constructed from functions with high nonlinearity [17, 11, 2, 6] can be good and have useful applications in communications [9, 19, 10, 18] or cryptography [5, 4, 3, 21]. For a code, its weight distribution is important to study its structure and to provide information on the probability of u...

In this paper, we propose a novel low-density parity-check real-number code, based on compressed sensing. A real-valued message is encoded by a coding matrix (with more rows than columns) and transmitted over an erroneous channel, where sparse errors (impulsive noise) corrupt the codeword. In the decoding procedure, we apply a structured sparse (low-density) parity-check matrix, the Permuted Bl...

Mobile code systems provide a exible and powerful platform to build distributed applications in an Internet scale, but they rise strong requirements from the security point of view. Security issues include authentication of the di erent remote parties involved and protection of the execution environments from malicious agents. Nonetheless, the most di cult task is to protect roaming agents from...

Cryptography provides the secure manner of information transmission over the insecure channel. It authenticates messages based on the key but not on the user. It requires a lengthy key to encrypt and decrypt the sending and receiving the messages, respectively. But these keys can be guessed or cracked. Moreover, Maintaining and sharing lengthy, random keys in enciphering and deciphering process...