A Pseudo DNA Cryptography Method

The DNA cryptography is a new and very promising direction in cryptography research. DNA can be used in cryptography for storing and transmitting the information, as well as for computation. Although in its primitive stage, DNA cryptography is shown to be very effective. Currently, several DNA computing algorithms are proposed for quite some cryptography, cryptanalysis and steganography problems, and they are very powerful in these areas. However, the use of the DNA as a means of cryptography has high tech lab requirements and computational limitations, as well as the labor intensive extrapolation means so far. These make the efficient use of DNA cryptography difficult in the security world now. Therefore, more theoretical analysis should be performed before its real applications. In this project, We do not intended to utilize real DNA to perform the cryptography process; rather, We will introduce a new cryptography method based on central dogma of molecular biology. Since this method simulates some critical processes in central dogma, it is a pseudo DNA cryptography method. The theoretical analysis and experiments show this method to be efficient in computation, storage and transmission; and it is very powerful against certain attacks. Thus, this method can be of many uses in cryptography, such as an enhancement insecurity and speed to the other cryptography methods. There are also extensions and variations to this method, which have enhanced security, effectiveness and applicability.Comment: A small work that quite some people asked abou

Simulation of Ultra-Relativistic Electrons and Positrons Channeling in Crystals with MBN Explorer

A newly developed code, implemented as a part of the \MBNExplorer package \cite{MBN_ExplorerPaper,MBN_ExplorerSite} to simulate trajectories of an ultra-relativistic projectile in a crystalline medium, is presented. The motion of a projectile is treated classically by integrating the relativistic equations of motion with account for the interaction between the projectile and crystal atoms. The probabilistic element is introduced by a random choice of transverse coordinates and velocities of the projectile at the crystal entrance as well as by accounting for the random positions of the atoms due to thermal vibrations. The simulated trajectories are used for numerical analysis of the emitted radiation. Initial approbation and verification of the code have been carried out by simulating the trajectories and calculating the radiation emitted by \E=6.7 GeV and \E=855 MeV electrons and positrons in oriented Si(110) crystal and in amorphous silicon. The calculated spectra are compared with the experimental data and with predictions of the Bethe-Heitler theory for the amorphous environment.Comment: 41 pages, 11 figures. Initially submitted on Dec 29, 2012 to Phys. Rev.

Normal Inverse Gaussian Approximation for Arrival Time Difference in Flow-Induced Molecular Communications

In this paper, we consider molecular communications in one-dimensional flow-induced diffusion channels with a perfectly absorbing receiver. In such channels, the random propagation delay until the molecules are absorbed follows an inverse Gaussian (IG) distribution and is referred to as first hitting time. Knowing the distribution for the difference of the first hitting times of two molecules is very important if the information is encoded by a limited set of molecules and the receiver exploits their arrival time and/or order. Hence, we propose a moment matching approximation by a normal inverse Gaussian (NIG) distribution and we derive an expression for the asymptotic tail probability. Numerical evaluations showed that the NIG approximation matches very well with the exact solution obtained by numerical convolution of the IG density functions. Moreover, the asymptotic tail probability outperforms state-of-the-art tail approximations.Comment: This paper has been submitted to IEEE Transactions on Molecular, Biological and Multi-Scale Communication

ISI-aware channel code design for molecular communication via diffusion

© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In molecular communication via diffusion, information molecules diffusing in the environment are subject to Brownian motion. Due to probabilistic propagation, the arrival of the molecules at the receiver is spread in time, leading to the reception of some molecules belonging to the previous symbol(s) during the upcoming symbol duration. Known as inter-symbol interference (ISI), this problem has been extensively studied in the literature by applying a large spectrum of techniques, mostly inspired by approaches in the wireless communication domain, including channel coding techniques. Unfortunately, many known channel codes do not perform well in the molecular communications domain since the diffusion channel features a significant memory component. In this paper, novel methods for channel coding by incorporating the effect of ISI in the design of the channel codes for the molecular diffusion channel are proposed. The results show that the proposed methods provide significant improvements in performance in terms of the codeword error rate.Postprint (author's final draft

Low-complexity channel codes for reliable molecular communication via diffusion

It is envisioned that healthcare systems of the future will be revolutionized with the development and integration of body-centric networks into future generations of communication systems, giving rise to the so-called “Internet of Bio-nano things”. Molecular communications (MC) emerge as the most promising way of transmitting information for in-body communications. One of the biggest challenges is how to minimize the effects of environmental noise and reduce the inter-symbol interference (ISI) which in an MC via diffusion scenario can be very high. To address this problem, channel coding is one of the most promising techniques. In this paper, we study the effects of different channel codes integrated into MC systems. We provide a study of Tomlinson, Cercas, Hughes (TCH) codes as a new attractive approach for the MC environment due to the codeword properties which enable simplified detection. Simulation results show that TCH codes are more effective for these scenarios when compared to other existing alternatives, without introducing too much complexity or processing power into the system. Furthermore, an experimental proof-of-concept macroscale test bed is described, which uses pH as the information carrier, and which demonstrates that the proposed TCH codes can improve the reliability in this type of communication channel.info:eu-repo/semantics/publishedVersio

Bridging the complexity gap in Tbps-achieving THz-band baseband processing

Recent advances in electronic and photonic technologies have allowed efficient signal generation and transmission at terahertz (THz) frequencies. However, as the gap in THz-operating devices narrows, the demand for terabit-per-second (Tbps)-achieving circuits is increasing. Translating the available hundreds of gigahertz (GHz) of bandwidth into a Tbps data rate requires processing thousands of information bits per clock cycle at state-of-the-art clock frequencies of digital baseband processing circuitry of a few GHz. This paper addresses these constraints and emphasizes the importance of parallelization in signal processing, particularly for channel code decoding. By leveraging structured sub-spaces of THz channels, we propose mapping bits to transmission resources using shorter code words, extending parallelizability across all baseband processing blocks. THz channels exhibit quasi-deterministic frequency, time, and space structures that enable efficient parallel bit mapping at the source and provide pseudo-soft bit reliability information for efficient detection and decoding at the receiver