John Carlo L. Espineli

Bio: John Carlo L. Espineli is an academic researcher. The author has contributed to research in topics: Key space & Encryption. The author has an hindex of 1, co-authored 1 publications receiving 17 citations.

Chaotic Rivest-Shamir-Adlerman Algorithm with Data Encryption Standard Scheduling

Abstract: Cryptography, which involves the use of a cipher, describes a process of encrypting information so that its meaning is hidden and thus, secured from those who do not know how to decrypt the information. Cryptography algorithms come with the various types including the symmetric key algorithms and asymmetric key algorithms. In this paper, the authors applied the most commonly used algorithm, which is the RSA algorithm together with the Chaos system and the basic security device employed in the worldwide organizations which is the Data Encryption Standard (DES) with the objective to make a hybrid data encryption. The advantage of a chaos system which is its unpredictability through the use of multiple keys and the secrecy of the RSA which is based on integer factorization’s difficulty is combined for a more secure and reliable cryptography. The key generation was made more secure by applying the DES schedule to change the keys for encryption. The main strength of the proposed system is the chaotic variable key generator that chages the value of encrypted message whenever a different number of key is used. Using the provided examples the strength of security of the proposed system was tested and demonstrated.

A New Chaotic Map for Secure Transmission

Abstract: The secure communication through synchronization between two identic chaotic systems have recently gained a lot of interest. To implement a robust secure system based on synchronization, there is always a need to generate new discrete dynamical systems and investigate their performances in terms of amount of randomness they have and the ability to achieve synchronization smoothly. In this work, a new chaotic system, named Nahrain, is proposed and tested for the possible use in secure transmission via chaos synchronization as well as in cryptography applications. The performance of the proposed chaotic system is tested using 0-1 test, while NIST suite tests are used to check the randomness statistical properties. The nonlinear control laws are used to verify the synchronization of master-slave parts of the proposed system. The simulation results show that Nahrain system has chaotic behavior and synchronizable, while the equivalent binary sequence of the system has excellent randomness statistical properties. The numerical results obtained using MATLAB for 0-1 test was 0.9864, and for frequency test was 0.4202, while for frequency test within a block was 0.4311. As a result, the new proposed system can be used to develop efficient encryption and synchronization algorithms for multimedia secure transmission applications.

An effective meta-heuristic based multi-objective hybrid optimization method for workflow scheduling in cloud computing environment

Abstract: Cloud computing is an emerging distributed computing model that offers computational capability over internet. Cloud provides a huge level collection of powerful and scalable computational resources for computation and data-intensive large scale workflow deployment. For business as well as scientific applications, optimal scheduling of workflow is emerged as a major concern. Optimization of scheduling process leads to the reduction of execution time, cost, etc. So, this paper presents an enhanced recent ant-lion optimization (ALO) algorithm hybridized with popular particle swarm optimization (PSO) algorithm to optimize a workflow scheduling specifically for cloud. A security approach called Data Encryption Standard (DES) is used for encoding the cloud information while scheduling is carried out. The research aims to contribute an enhanced workflow scheduling more safely than the existing frameworks. Enhancement procedures are evaluated in terms of cost, load, and makespan. The simulation procedures are done by utilizing the CloudSim tool. The proposed hybrid optimization results contrasted with well-known existing approaches. The existing round-robin (RR), ALO and PSO methods are selected to compare and identify the potency of the proposed system. The outcomes indicated that the proposed technique minimizes the cost by 9.8% of GA-PSO, 10% of PSO, 20% of ALO, 30% of RR and 12% of GA. Load balancing and makespan of the proposed method reduces by 8% than GA-PSO, 10% than ALO, 20% than PSO, 35% than RR and 45% than GA. The energy consumption and reliability performance are also reasonably well.

An enhanced lossless compression with cryptography hybrid mechanism for ECG biomedical signal monitoring

Abstract: Due to their use in daily life situation, demand for remote health applications and e-health monitoring equipment is growing quickly. In this phase, for fast diagnosis and therapy, information can be transferred from the patient to the distant clinic. Nowadays, the most chronic disease is cardiovascular diseases (CVDs). However, the storage and transmission of the ECG signal, consumes more energy, bandwidth and data security which is faced many challenges. Hence, in this work, we present a combined approach for ECG data compression and cryptography. The compression is performed using adaptive Huffman encoding and encrypting is done using AES (CBC) scheme with a 256-bit key. To increase the security, we include Diffie-Hellman Key exchange to authenticate the receiver, RSA key generation for encrypting and decrypting the data. Experimental results show that the proposed approach achieves better performance in terms of compression and encryption on MIT-BIH ECG dataset.

A comparative review on symmetric and asymmetric DNA-based cryptography

Abstract: Current researchers have focused on DNA-based cryptography, in fact, DNA or deoxyribonucleic acid, has been applied in cryptography for performing computation as well as storing and transmitting information. In the present work, we made use of DNA in cryptographic, i.e. its storing capabilities (superior information density) and parallelism, in order to improve other classical cryptographic algorithms. Data encryption is made possible via DNA sequences. In this paper, two cases utilizing different DNA properties were studied by combining the DNA codes with those conventional cryptography algorithms. The first case concerned on symmetric cryptography that involved DNA coding with OTP (one time pad) algorithms. Asymmetric cryptography was considered in the second case by incorporating the DNA codes in RSA algorithm. The efficiencies of DNA coding in OTP, RSA, and other algorithms were given. As observed, the computational time of RSA algorithm combined with DNA coding was longer. In order to alleviate this problem, data redundancy was reduced by activating the GZIP compressed algorithm. The present experimental results showed that DNA symmetric cryptography worked quite well in both time and size analyses. Nevertheless, it was less efficient than the compressed DNA asymmetric cryptography.