MPWide: a light-weight library for efficient message passing over wide area networks

We present MPWide, a light weight communication library which allows efficient message passing over a distributed network. MPWide has been designed to connect application running on distributed (super)computing resources, and to maximize the communication performance on wide area networks for those without administrative privileges. It can be used to provide message-passing between application, move files, and make very fast connections in client-server environments. MPWide has already been applied to enable distributed cosmological simulations across up to four supercomputers on two continents, and to couple two different bloodflow simulations to form a multiscale simulation.Comment: accepted by the Journal Of Open Research Software, 13 pages, 4 figures, 1 tabl

Using Echo State Networks for Cryptography

Echo state networks are simple recurrent neural networks that are easy to implement and train. Despite their simplicity, they show a form of memory and can predict or regenerate sequences of data. We make use of this property to realize a novel neural cryptography scheme. The key idea is to assume that Alice and Bob share a copy of an echo state network. If Alice trains her copy to memorize a message, she can communicate the trained part of the network to Bob who plugs it into his copy to regenerate the message. Considering a byte-level representation of in- and output, the technique applies to arbitrary types of data (texts, images, audio files, etc.) and practical experiments reveal it to satisfy the fundamental cryptographic properties of diffusion and confusion.Comment: 8 pages, ICANN 201

High Density Data Storage in Dna Using an Efficient Message Encoding Scheme

This paper suggests a message encoding scheme for small text files in nucleotide strands for ultra high data density storage in DNA. The proposed scheme leads to high volume data density and depends on adoption of sequence transformation algorithms. Compression of small text files must fulfill special requirement since they have small context. The use of transformation algorithm generates better context information for compression with Huffman encoding. We tested the suggested scheme on collection of small text size files. The testing result showed the proposed scheme reduced the number of nucleotides for representing text message over existing method and realization of high data density storage in DN

Steganographic techniques using modified least significant bit and modification reshape transposition methods

A message is a form of conveying information. Various ways are used to secure the information conveyed in the form of messages either in encrypted form or in the form of applying a password in the message. Messages can also be encrypted and embedded in other media such as images (steganography). This research aimed to insert a message into the form of an image by combining the Modified Least Significant Bit (MLSB) method in encrypting messages and reshape modification technique to determine at which position the message encryption will be embedded in the image. Tests were carried out to obtain the quality of the encryption process using the parameters of Fidelity, mean square error, peak signal to noise ratio, testing on file type, robustness, and comparison of message contents. The results of the tests showed that the files that can be used are files with the image file type in the lossless compression category, the rotation can be done at 90, 180, 270 without destroying the message in it, and changing the pixel in the image file will destroy the message insid

Uncoded Caching and Cross-level Coded Delivery for Non-uniform File Popularity

Proactive content caching at user devices and coded delivery is studied considering a non-uniform file popularity distribution. A novel centralized uncoded caching and coded delivery scheme, which can be applied to large file libraries, is proposed. The proposed cross-level coded delivery (CLCD) scheme is shown to achieve a lower average delivery rate than the state of art. In the proposed CLCD scheme, the same subpacketization is used for all the files in the library in order to prevent additional zero-padding in the delivery phase, and unlike the existing schemes in the literature, two users requesting files from different popularity groups can be served by the same multicast message in order to reduce the delivery rate. Simulation results indicate significant reduction in the average delivery rate for typical Zipf distribution parameter values.Comment: A shorter version of this paper has been presented at IEEE International Conference on Communications (ICC) 201

The Capability of Image Files Cover Message in Steganography

This paper is focusing on the capability of image files as cover message to send the text files. The images were classified according to their compression technique, lossless and lossy compression. The measurements are identified in order to test their capability in term of the sizeof file, the color intensity level, the integrity data and the time execution. All the measurements would be tested by using the developed tool called StegaNo. The result of the study seem to suggest BMP image as a cover message than JPEG image

The Impact of SHA-1 File Hash Collisions On Digital Forensic Imaging: A Follow-up Experiment

A previous paper described an experiment showing that Message Digest 5 (MD5) hash collisions of files have no impact on integrity verification in the forensic imaging process. This paper describes a similar experiment applied when two files have a Secure Hash Algorithm (SHA-1) collision

Synthetic speech detection and audio steganography in VoIP scenarios

The distinction between synthetic and human voice uses the techniques of the current biometric voice recognition systems, which prevent that a person’s voice, no matter if with good or bad intentions, can be confused with someone else’s. Steganography gives the possibility to hide in a file without a particular value (usually audio, video or image files) a hidden message in such a way as to not rise suspicion to any external observer. This article suggests two methods, applicable in a VoIP hypothetical scenario, which allow us to distinguish a synthetic speech from a human voice, and to insert within the Comfort Noise a text message generated in the pauses of a voice conversation. The first method takes up the studies already carried out for the Modulation Features related to the temporal analysis of the speech signals, while the second one proposes a technique that derives from the Direct Sequence Spread Spectrum, which consists in distributing the signal energy to hide on a wider band transmission. Due to space limits, this paper is only an extended abstract. The full version will contain further details on our research