The document describes a new algorithm called MCHF (Meiosis based Ciphering and Hash Function generation) for encryption, cryptographic hashing, and random number generation for multilevel cloud security. The algorithm emulates meiotic cell division processes using concepts from molecular biology like DNA crossover during metaphase. It uses a 1024-bit key for encryption and the Navier-Stokes equation to model DNA movement for crossover-based encryption and hashing. The algorithm aims to securely handle login, database transactions, and data storage in the cloud by generating secure cryptographic hashes. Java code is implemented to test the algorithm's encryption, hashing, random number generation and 3D login system capabilities.
Neural Cryptography for Secret Key ExchangeIJMTST Journal
The goal of any cryptography system is the exchange of information among the intended user without any leakage of information to other who may have unauthorized access to it. A common secret key could be created over a public channel accessible to any opponent. Neural networks can be used to generate common secret key. In case of neural cryptography, both the communicating networks receive an identical input vector, generate an output bit and are trained based on the output bit. The two networks and their weights vectors exhibit a new phenomenon, where the networks synchronize to a state with identical time-dependent weights. The generated secret key over a public channel is used for encryption and decryption of the message or information send over the channel.
SOM-PAD: Novel Data Security Algorithm on Self Organizing Map cscpconf
Data security is one of major challenges in the recent literature. Cryptography is the most
common phenomena used to secure data. One main aspect in cryptography is creating a hard to
guess cipher. Artificial Neural Networks (ANN) is one of the machine learning techniques
widely employed in several fields based on its characters, depending on the application area.
One of these fields is data security. The state of art in this paper is the use of self organizing
map (SOM) algorithm concept as a core idea to construct a pad; this pad is used to generate the
cipher at one end. At the other end of communication the same process is synchronized to
generate the same pad as the deciphering key. The security of the proposed model depends on
the complex nature of ANN's. The algorithm could be categorized under symmetric
cryptography, merging both stream and block cipher. A modified version of the same algorithm
also presented employs permutation and variable SOM neighborhoods. The proposal can be
applied over several file formats like videos, images, text files, data benchmarks, etc as show in
experimental results
Color Image Encryption and Decryption Using Multiple Chaotic MapsIJTET Journal
Owing to advances in communication technology, a bulk of visual digital data is being stored and transmitted over the internet now-a-days. Particularly millions and millions of images transfer through the network per day as per the statistics and a result, the security of image data is an important requirement. Image encryption algorithm is used to provide this security. In this paper, an image encryption algorithm based on confusion diffusion architecture that uses dynamic key space is proposed. An internal key generator is used to generate the initial seeds for the overall encryption scheme is proposed. With these initial seeds logistic map generates pseudo random numbers then these numbers are converted into permutation order for permutation. The diffusion bits are generated in parallel using the logistic map and manipulated with pixels confused. The image pixels are iteratively confused and diffused using permutation order and diffusion bits respectively to produce cipher image in minimum number of rounds. This paper proposes a new kind of initial seed generation that utilizes the combo of logistic and tent maps. Even all external seeds are same. The internal seeds will be totally different. This ensures the key sensitivity. The simulation results and analysis confirm that the satisfactory level of security is achieved in three rounds and overall encryption time is saved.
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
An Image Encryption using Chaotic Based Cryptosystemxlyle
NAME: MUHAMAD LUQMAN NULHAKIM BIN MANSOR
NO MATRIC: BTBL16043975
COURSE: ISM (SK) KESELAMATAN RANGKAIAN KOMPUTER
SUPERVISOR: PROF. MADYA DR AFENDEE BIN MOHAMED
UNIVERSITI SULTAN ZAINAL ABIDIN
Neural Cryptography for Secret Key ExchangeIJMTST Journal
The goal of any cryptography system is the exchange of information among the intended user without any leakage of information to other who may have unauthorized access to it. A common secret key could be created over a public channel accessible to any opponent. Neural networks can be used to generate common secret key. In case of neural cryptography, both the communicating networks receive an identical input vector, generate an output bit and are trained based on the output bit. The two networks and their weights vectors exhibit a new phenomenon, where the networks synchronize to a state with identical time-dependent weights. The generated secret key over a public channel is used for encryption and decryption of the message or information send over the channel.
SOM-PAD: Novel Data Security Algorithm on Self Organizing Map cscpconf
Data security is one of major challenges in the recent literature. Cryptography is the most
common phenomena used to secure data. One main aspect in cryptography is creating a hard to
guess cipher. Artificial Neural Networks (ANN) is one of the machine learning techniques
widely employed in several fields based on its characters, depending on the application area.
One of these fields is data security. The state of art in this paper is the use of self organizing
map (SOM) algorithm concept as a core idea to construct a pad; this pad is used to generate the
cipher at one end. At the other end of communication the same process is synchronized to
generate the same pad as the deciphering key. The security of the proposed model depends on
the complex nature of ANN's. The algorithm could be categorized under symmetric
cryptography, merging both stream and block cipher. A modified version of the same algorithm
also presented employs permutation and variable SOM neighborhoods. The proposal can be
applied over several file formats like videos, images, text files, data benchmarks, etc as show in
experimental results
Color Image Encryption and Decryption Using Multiple Chaotic MapsIJTET Journal
Owing to advances in communication technology, a bulk of visual digital data is being stored and transmitted over the internet now-a-days. Particularly millions and millions of images transfer through the network per day as per the statistics and a result, the security of image data is an important requirement. Image encryption algorithm is used to provide this security. In this paper, an image encryption algorithm based on confusion diffusion architecture that uses dynamic key space is proposed. An internal key generator is used to generate the initial seeds for the overall encryption scheme is proposed. With these initial seeds logistic map generates pseudo random numbers then these numbers are converted into permutation order for permutation. The diffusion bits are generated in parallel using the logistic map and manipulated with pixels confused. The image pixels are iteratively confused and diffused using permutation order and diffusion bits respectively to produce cipher image in minimum number of rounds. This paper proposes a new kind of initial seed generation that utilizes the combo of logistic and tent maps. Even all external seeds are same. The internal seeds will be totally different. This ensures the key sensitivity. The simulation results and analysis confirm that the satisfactory level of security is achieved in three rounds and overall encryption time is saved.
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
An Image Encryption using Chaotic Based Cryptosystemxlyle
NAME: MUHAMAD LUQMAN NULHAKIM BIN MANSOR
NO MATRIC: BTBL16043975
COURSE: ISM (SK) KESELAMATAN RANGKAIAN KOMPUTER
SUPERVISOR: PROF. MADYA DR AFENDEE BIN MOHAMED
UNIVERSITI SULTAN ZAINAL ABIDIN
RSA Based Secured Image Steganography Using DWT ApproachIJERA Editor
The need for keeping safe secrecy of secret and sensitive data has been ever increasing with the new
developments in digital system. In this paper, we present an increased way for getting embedding encrypted
secret facts in gray scale images to give high level safety of facts for news over unsecured narrow channels
Cryptography and Steganography are two closely related techniques are used in proposed system. Cryptography
gets into making one of religion the secret note into a non-recognizable chipper. Steganography is then sent in
name for using Double-Stegging to fix this encrypted data into a cover thing by which something is done and
keeps secret its existence.
In the present scenario the use of images increased extremely in the cyber world so that we can
easily transfer data with the help of these images in a secured way. Image steganography becomes
important in this manner. Steganography and cryptography are the two techniques that are often confused
with each other. The input and output of steganography looks alike, but for cryptography the output will be
in an encrypted form which always draws attraction to the attacker. This paper combines both
steganography and cryptography so that attacker doesn’t know about the existence of message and the
message itself is encrypted to ensure more security. The textual data entered by the user is encrypted using
AES algorithm. After encryption, the encrypted data is stored in the colour image by using a hash based
algorithm. Most of the steganographic algorithms available today is suitable for a specific image format
and these algorithms suffers from poor quality of the embedded image. The proposed work does not corrupt
the images quality in any form. The striking feature is that this algorithm is suitable for almost all image
formats e.g.: jpeg/jpg, Bitmap, TIFF and GIFF.
File transfer with multiple security mechanismShubham Patil
The system enhances the security and the data confidentiality between the users and receiver by the two-layer encryption mechanism and the QR code for verification. The system consists of three main components which are very important to providing the security between sender and receiver while transmitting the data
Different date block size using to evaluate the performance between different...IJCNCJournal
The different computer networks whether wired or wireless are becoming more popular with its high
security aspect. Different security algorithms and technique are using to avoid any aforementioned attacks.
One of these technique is a cryptography technique that makes the data as unreadable during the transfer
hence; there is no chance to reclaim the information. Presently, most of the users are using various media
types and internet to transfer the data but, it has the chance to retrieve the data by using these media types.
The perfect solution for this problem is to provide security on time-to-time basis; this stage is always
significant to the security related community discussions. This paper explains the comparison between the
run time of three different encryption algorithms which are DES, AES and Blowfish The compression
includes using different modes, data block size and different operation modes. As a result, Blowfish
algorithm followed by AES take less time for running compared to DES.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...IJCNCJournal
In this paper a detailed analysis of Data Encryption Standard (DES), Triple DES (3DES) and Advanced
Encryption Standard (AES) symmetric encryption algorithms in MANET was done using the Network
Simulator 2 (NS-2) in terms of energy consumption, data transfer time, End-to-End delay time and
throughput with varying data sizes. Two simulation models were adopted: the first simulates the network
performance assuming the availability of the common key, and the second simulates the network
performance including the use of the Diffie-Hellman Key Exchange (DHKE) protocol in the key
management phase. The obtained simulation results showed the superiority of AES over DES by 65%, 70%
and 83% in term of the energy consumption, data transfer time, and network throughput respectively. On
the other hand, the results showed that AES is better than 3DES by approximately 90% for all of the
performance metrics. Based on these results the AES was the recommended encryption scheme.
High Capacity and Security Steganography Using Discrete Wavelet TransformCSCJournals
The secure data transmission over internet is achieved using Steganography. In this paper High Capacity and Security Steganography using Discrete wavelet transform (HCSSD) is proposed. The wavelet coefficients of both the cover and payload are fused into single image using embedding strength parameters alpha and beta. The cover and payload are preprocessed to reduce the pixel range to ensure the payload is recovered accurately at the destination. It is observed that the capacity and security is increased with acceptable PSNR in the proposed algorithm compared to the existing algorithms
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This paper proposes a new compressive
sensing based method for simultaneous data
compression and convergent encryption for secure
deduplication to efficiently use for the cloud storage. It
performs signal acquisition, its compression and
encryption at the same time. The measurement matrix
is generated using a hash key and is exploited for
encryption. It seems that it is very suitable for the cloud
model considering both the data security and the
storage efficiently.
RSA Based Secured Image Steganography Using DWT ApproachIJERA Editor
The need for keeping safe secrecy of secret and sensitive data has been ever increasing with the new
developments in digital system. In this paper, we present an increased way for getting embedding encrypted
secret facts in gray scale images to give high level safety of facts for news over unsecured narrow channels
Cryptography and Steganography are two closely related techniques are used in proposed system. Cryptography
gets into making one of religion the secret note into a non-recognizable chipper. Steganography is then sent in
name for using Double-Stegging to fix this encrypted data into a cover thing by which something is done and
keeps secret its existence.
In the present scenario the use of images increased extremely in the cyber world so that we can
easily transfer data with the help of these images in a secured way. Image steganography becomes
important in this manner. Steganography and cryptography are the two techniques that are often confused
with each other. The input and output of steganography looks alike, but for cryptography the output will be
in an encrypted form which always draws attraction to the attacker. This paper combines both
steganography and cryptography so that attacker doesn’t know about the existence of message and the
message itself is encrypted to ensure more security. The textual data entered by the user is encrypted using
AES algorithm. After encryption, the encrypted data is stored in the colour image by using a hash based
algorithm. Most of the steganographic algorithms available today is suitable for a specific image format
and these algorithms suffers from poor quality of the embedded image. The proposed work does not corrupt
the images quality in any form. The striking feature is that this algorithm is suitable for almost all image
formats e.g.: jpeg/jpg, Bitmap, TIFF and GIFF.
File transfer with multiple security mechanismShubham Patil
The system enhances the security and the data confidentiality between the users and receiver by the two-layer encryption mechanism and the QR code for verification. The system consists of three main components which are very important to providing the security between sender and receiver while transmitting the data
Different date block size using to evaluate the performance between different...IJCNCJournal
The different computer networks whether wired or wireless are becoming more popular with its high
security aspect. Different security algorithms and technique are using to avoid any aforementioned attacks.
One of these technique is a cryptography technique that makes the data as unreadable during the transfer
hence; there is no chance to reclaim the information. Presently, most of the users are using various media
types and internet to transfer the data but, it has the chance to retrieve the data by using these media types.
The perfect solution for this problem is to provide security on time-to-time basis; this stage is always
significant to the security related community discussions. This paper explains the comparison between the
run time of three different encryption algorithms which are DES, AES and Blowfish The compression
includes using different modes, data block size and different operation modes. As a result, Blowfish
algorithm followed by AES take less time for running compared to DES.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...IJCNCJournal
In this paper a detailed analysis of Data Encryption Standard (DES), Triple DES (3DES) and Advanced
Encryption Standard (AES) symmetric encryption algorithms in MANET was done using the Network
Simulator 2 (NS-2) in terms of energy consumption, data transfer time, End-to-End delay time and
throughput with varying data sizes. Two simulation models were adopted: the first simulates the network
performance assuming the availability of the common key, and the second simulates the network
performance including the use of the Diffie-Hellman Key Exchange (DHKE) protocol in the key
management phase. The obtained simulation results showed the superiority of AES over DES by 65%, 70%
and 83% in term of the energy consumption, data transfer time, and network throughput respectively. On
the other hand, the results showed that AES is better than 3DES by approximately 90% for all of the
performance metrics. Based on these results the AES was the recommended encryption scheme.
High Capacity and Security Steganography Using Discrete Wavelet TransformCSCJournals
The secure data transmission over internet is achieved using Steganography. In this paper High Capacity and Security Steganography using Discrete wavelet transform (HCSSD) is proposed. The wavelet coefficients of both the cover and payload are fused into single image using embedding strength parameters alpha and beta. The cover and payload are preprocessed to reduce the pixel range to ensure the payload is recovered accurately at the destination. It is observed that the capacity and security is increased with acceptable PSNR in the proposed algorithm compared to the existing algorithms
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This paper proposes a new compressive
sensing based method for simultaneous data
compression and convergent encryption for secure
deduplication to efficiently use for the cloud storage. It
performs signal acquisition, its compression and
encryption at the same time. The measurement matrix
is generated using a hash key and is exploited for
encryption. It seems that it is very suitable for the cloud
model considering both the data security and the
storage efficiently.
Data security and protection is one of the most common technologies used in the field of computer science. This is because of its great importance in all fields related to daily life, whether political, economic, and other aspects change. In this research paper, a new intelligent system that concentrates on image and text encryption and decryption is proposed. Furthermore, the image recognition rate is increased. In this paper, the Rivest Shamir Adleman 3 key (RSA3k) algorithm is used but in a new technique to encrypt and decrypt text. The proposed technique relies on using square root of public key as private key. XOR operation for colored images encryption and decryption is performed. By calculating signal to noise ratio (PSNR), mean square error (MSE), and bit error rate (BER), the most important things that we address how to provide data security for large data based on encryption techniques and increase the security of multimedia data and texture date and address the problem of time and accuracy in image matching. the results show that the quality of images after decryption is good.
HYBRID CHAOTIC METHOD FOR MEDICAL IMAGES CIPHERINGIJNSA Journal
Healthcare is an essential application of e-services, where for diagnostic testing, medical imaging acquiring, processing, analysis, storage, and protection are used. Image ciphering during storage and transmission over the networks used has seen implemented using many types of ciphering algorithms for security purpose. Current cyphering algorithms are classified into two types: traditional classical cryptography using standard algorithms (DES, AES, IDEA, RC5, RSA, ...) and chaos cryptography using continuous (Chau, Rossler, Lorenz, ...) or discreet (Logistics, Henon, ...) algorithms. The traditional algorithms have struggled to combat image data as compared to regular textual data. Whereas, the chaotic algorithms are more efficient for image ciphering. The Significancecharacteristics of chaos are its extreme sensitivity to initial conditions and algorithm parameters.
In this paper, medical image security based on hybrid/mixed chaotic algorithms is proposed. The proposed method is implemented using MATLAB. Where the image of the Retina of the Eye to detect Blood Vessels is ciphered. The Pseudo-Random Numbers Generators (PRNGs) from the different chaotic algorithms are implemented, and their statistical properties are evaluated using the National Institute of Standards and Technology NIST and other statistical test-suits. Then, these algorithms are used to secure the data, where the statistical properties of the cipher-text are also tested. We propose two PRNGs to increase the complexity of the PRNGs and to allow many of the NIST statistical tests to be passed: one based on twohybrid mixed chaotic logistic maps and one based on two-hybrid mixed chaotic Henon maps, where each chaotic algorithm runs side-by-side andstarts with random initial conditions and parameters (encryption keys). The resulting hybrid PRNGs passed many of the NIST statistical test suits.
Securing sensitive and important information from intruders is a tedious task in the 21st century. In order to protect information different ciphering techniques has been used. Quantum Cryptography has taken a new path in the field of crypto systems where all the presently used crypto systems are classified as classical cryptography systems. Classical cryptography systems use mathematical formulas where quantum cryptography uses the principles of photon polarization and heisenberg uncertainty principle. As the south
asian region is developing rapidly in almost all the sectorsthe need of securing information has become a difficult task. Therefore, the need of starting extensive research on quantum cryptography for the south asian region to safeguard information from intruders has been the purpose of this study. Comparative study of the growth of the telecommunication sector in the south asian region and how quantum
cryptography could assist in securing information has been discussedas results.In the end, details of the need to research on quantum cryptography in the south asian region to overcome future predicted cyber threats are also discussed.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Network Intrusion Detection System (NIDS) monitors a network for malicious activities or policy violations [1]. The Kernel-based Virtual Machine (KVM) is a full virtualization solution for Linux on x86 hardware virtualization extensions [2]. We design and implement a back-propagation network intrusion detection system in KVM. Compared to traditional Back Propagation (BP) NIDS, the Particle Swarm Optimization (PSO) algorithm is applied to improve efficiency. The results show an improved system in terms of recall and precision along with missing detection rates.
Wireless Network Security Architecture with Blowfish Encryption ModelIOSR Journals
Abstract: In this research paper ,we developed a model for a large network, wireless nodes are interconnected and each can be considered as a node processor that offer services to other node processors connected to a specific network. A very high proportion of the nodes that offer services need to carry out an authentication process so as to make an access request to the node offering the service. In this context, an integrated reconfigurable network security architecture moved to the application layer has become the need of the day for secure wireless data sharing. The security schemes of the seven layer OSI architecture need to be placed intrinsically in the wireless node itself and should be capable of supporting the MAC layer, IP address based layer and the routing protocols of the network layer. This work focuses on the use of emulator and embedded hardware architectures for wireless network security. In this work, the individual nodes can have a unique security signature pattern maintained by respective wireless nodes using an encryption algorithm and this is made dynamic. The metrics includes latency, throughput, Scalability, Effects of data transfer operation on node processor and application data located in the processor Keywords:Wireless Network security, Embedded hardware, Reconfigurable architecture, blowfish algorithm
Analyzing and Securing Data Transmission in Wireless Sensor Networks through ...ijtsrd
Wireless Sensor Networks are gaining popularity in various fields and areas. But these nodes are vulnerable as they are open networks and easily accessible. The major challenge is to have a secure data transmission between the nodes. To establish a secure transmission, we require a security scheme like a cryptographic algorithm, but this also requires a secure key distribution between nodes. The WSN’s have constraints like limited area, power and memory which restrict all the categories of cryptographic algorithm. Depending upon the criteria’s and constraints, cryptographic algorithm like Elliptic Curve Cryptography ECC is best suitable for WSN’s environment. ECC has a smaller key size, high security and less computation time which makes the node an efficient crypto system. In order to protect the security of data, we propose a novel secure transmission strategy based on Cryptography. In this design, we acquire sensitive information securely so as to make use of the advantage of encryption. Our approach deal with the weakness of limitation in sensor node resources and the security threats, it is suitable for stream data in sensor nodes. The simulation experiments also demonstrate that this approach is effective in transmitting sensitive data covertly with the characteristics of lower energy consumptions and invisibility. This paper describes the implementation of ECC cryptosystem for WSN for secure key and data transmission between the nodes. Shahid Ishaq | Rashmi Raj "Analyzing & Securing Data Transmission in Wireless Sensor Networks through Cryptography Techniques" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-3 , April 2020, URL: https://www.ijtsrd.com/papers/ijtsrd30328.pdf Paper Url :https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/30328/analyzing-and-securing-data-transmission-in-wireless-sensor-networks-through-cryptography-techniques/shahid-ishaq
Wireless communication systems, multi-input multi-output (MIMO) technology has been recognized as the key ingredient to support higher data rate as well as better transmission quality after using this algorithm of a XTEA or MTEA scheme. Modified TEA is used for encryption of the text. Then decryption unit for decrypting the cipher text and convert that to plain text. Key generation unit is to generate 128bit key and these keys are send along with cipher text. Encryption and decryption system ensures the original data are send and received by the users in secured environment. The Received data are retrieving by the authorized users by providing key generation like private keys this Key Pattern generations provide more security to the messages. Extended tiny encryption algorithm or modified tiny encryption algorithm and tiny encryption algorithm are used to enhance the size, speed and security in the system. These algorithms are better compared to configurable joint detection decoding algorithm (CJDD) and valid symbol finder algorithm.
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
A PPLICATION OF C LASSICAL E NCRYPTION T ECHNIQUES FOR S ECURING D ATA -...IJCI JOURNAL
The process of protecting information by transformi
ng (encrypting) it into an unreadable format is cal
led
cryptography. Only those who possess secret key can
decipher (decrypt) the message into plain text.
Encrypted messages can sometimes be broken by crypt
analysis, also called code breaking, so there is a
need for strong and fast cryptographic methods for
securing the data from attackers. Although modern
cryptography techniques are virtually unbreakable,
sometimes they also tend to attack.
As the Internet, big data, cloud data storage and
other forms of electronic communication become more
prevalent, electronic security is becoming increasi
ngly important. Cryptography is used to protect e-m
ail
messages, credit card information, corporate data,
cloud data and big data so on... So there is a need
for
best and fast cryptographic methods for protecting
the data. In this paper a method is proposed to pro
tect
the data in faster way by using classical cryptogra
phy. The encryption and decryption are done in par
allel
using threads with the help of underlying hardware.
The time taken by sequential and parallel method i
s
analysed
Over the last twenty years, chaos-based encryption has been an increasingly popular way to encrypt and decrypt data using nonlinear dynamics and deterministic chaos. Discrete chaotic systems based on iterative maps have gotten a lot of interest because of their simplicity and speed. In this paper, three kinds of chaotic maps are utilized to build a digital image encryption strategy depending on a chaotic system. These chaotic maps are the logistic map, Arnold Cat’s map, and Baker’s map. In addition to using the triple data encryption standard (3DES) encryption scheme with the chaotic maps mentioned. The results of the experiments revealed that the suggested digital image encryption technique is both efficient and secure, making it ideal for usage in insecure networks. The transmission control protocol (TCP)/internet protocol (IP) protocol was used for the purpose of transferring data from server to client through the network and vice versa.
A NOVEL DNA ENCRYPTION SYSTEM USING CELLULAR AUTOMATAijsptm
DNA Cryptography is a new born cryptographic field emerged with the research of DNA Computing in which DNA is used as an Information carrier. Cellular automata is dynamic in nature so it provide dynamic behavior in the system which may increase the security in the system. DNA cryptography is
provide a secure way to encrypt the text and automata changes the state of the system based on the present
state, it will occur in discrete time. These qualities are most impressive in these techonology which help us to provide a highly secured security system for the users. Most of the encryption techniques based on the cellular automata have limitations. To overcome this lacuna, we propose a novel DNA cryptography algorithm with cellular automata to achieve randomness, parallelism, uniformity, reversibility and stable.
An algorithm implemented and its results obtained are depicts here, and a result analysis is done with other algorithms.
Three Party Authenticated Key Distribution using Quantum CryptographyIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
GridMate - End to end testing is a critical piece to ensure quality and avoid...ThomasParaiso2
End to end testing is a critical piece to ensure quality and avoid regressions. In this session, we share our journey building an E2E testing pipeline for GridMate components (LWC and Aura) using Cypress, JSForce, FakerJS…
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Communications Mining Series - Zero to Hero - Session 1
G04433953
1. IOSR Journal of Engineering (IOSRJEN) www.iosrjen.org
ISSN (e): 2250-3021, ISSN (p): 2278-8719
Vol. 04, Issue 04 (April. 2014), ||V3|| PP 39-53
International organization of Scientific Research 39 | P a g e
Mchf Algorithm for Multilevel Cloud Security
Bijoy Boban1
, Ankur Sodhi2
1
(School of Computer Science, Dept. of Science and Technology, Lovely Professional University)
2
(Asst. Professor, Lovely Faculty of technology, Lovely Professional University)
Abstract: - In this research work I introduce a new system named meiosis based ciphering and hash function
generation (MCHF) algorithm for encryption, cryptographic hash function generation, pseudo random number
generation, 3D login system and optimisation for various security levels of cloud computing using the concepts
of meiosis rendered from molecular biology and willing to give light to a sector in computer science called
Digital Cell Emulation Technique which can further be used for other purposes for better results than one which
I included in this research work; here I render the concept of meiotic cell division process undergone during
fertilization which is the real reason (chromosomal cross over) for dissimilarity of an individual (Genetically) to
another. I consider the latest finding of chaotic movement of DNA during meiosis and the motion that takes
place in the fluid is theoretically implemented using 3D Navier Stokes equation which is meant for calculating
the movement of Newtonian fluids like DNA in 3D space, which I render to emulate the cross over during
metaphase of meiosis. Initial encryption is carried out which imitates the cross over and then the hash code
generation that imitates the nucleotide formation or DNA shrinking to form chromosomes. This algorithm
ensures all the requirement standards for a good hash code algorithm with secure encryption using 1024 bit key
and can be used for pseudo code generator as it maintain a good proportion between the no. of 0’s and 1’s in the
binary output. Further the hash code will be implemented for 3D login system to 100% override brute force
attack as the process of login will be 100% human interaction based. Then I will be demonstrating the
optimisation pseudo code generation and will be comparing it with the existing algorithm to show the betterment
in time, throughput and power with statistical result created dynamically during each execution.
Keywords: - Cloud security, Genetic algorithm, Meiosis based cryptography, Navier-stokes equation.
I. INTRODUCTION
Meiosis based Cryptographic encryption and hash function generator is a research topic which is not as
explored as an individual event to be emulated although we have the genetic algorithm to be used for
cryptographic purposes. The reason why this topic is of much importance is that even taught we have many
optimisation algorithms we rely on genetic algorithm as it is more precise and is a pure emulation of human
mutation. So the sole purpose of this paper is to develop and show an encryption technique as well as a hash
function generation technique which can be implemented in cloud environment to provide security which is hard
to break without the authentic user intervention. The reason why the organisms that live on earth is intelligent
and different from one another stays in the cells from which we all are born. The organic bimolecular reactions
create highly proficient, complex, self-correcting and self-directing processes such as meiotic replication,
transcription and translation [1]. These processes, along with mutations form the basis of evolution, there by
forming the foundation for the building of an intelligent life. These concepts form the basis of technological
advancements for emulating computational intelligence in many engineering applications [2]. The prime reason
for the dissimilarity of all the individuals who exist in this planet with different parental origin is chiasma
formation during meiosis process of fertilization where the nucleotide strands from the mother and father
undergoes cross over for the generation of 4 diploid cells. If we can undergo the same principles of meiosis in
data with a virtual construction of A-DNA from the data bits following the conventions of Cryptography and
rendering of state at which the meiosis takes place, which include the centroidal based movement of the
chromosome in the nucleoplasm which we can emulate with the help of 3D Chaotic flow states for Accelerated
DNA replication which uses 3D Navier-Stokes Equation in R3
Euclidian space [3], then we can generate a
highly secure Hash function that satisfies all the constrains of hash code and pseudo code which can be used at
various levels of security in cloud. Security is a complex property and difficult to design or optimize. The
existence of so many methods of attack makes the protection of an information system very complicated. The
secrecy of transmitted information using encipherment and also with authentication of information verifying the
identity of people, preventing the stealing of information and controlling access to both data and software have
become such vital issues today, that data security is highly essential. In cryptography, the message is
transformed so as to be unintelligible even though its existence is apparent [7]. Prior encryption with the help of
chiasma formation is carried out before the hash code generation, the encryption consist of ‘n’ rounds which
will be selected so that it support the non-retrieval or close encounter of the cipher code back to the plain code
2. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 40 | P a g e
when implementing the encryption in 256 bit ASCII (we are starting the test with 128 rounds). Padding is done
at every node with each node having a size of 1024 bits with 896 bit of data and 128 bit of padding, the first 8
bits of all the prime numbers from 3 to 1000 is used for the padding. Last 128 bit shows the length of the
original message. The padding will be done on the basis of the emulation of the conditions for PCR during
meiosis considering the onset of flow and transition to convective turbulence as determined by the
dimensionless Rayleigh number: (Ra = [gβ(T2–T1)h3]/να which explains the chaotic advection in micro-scale
flow geometries which can be harnessed to greatly enhance the rate of thermally activated PCR [2]. For the
encryption technique we use SHA512 like data handling with the ASCII intake similar to elliptical curve
encryption which can be called an elliptical- modified version to the RC4 swapping. One of the main issues
involved in cryptography is the existence of a global key [8]. A global key of appropriate length is chosen for
the encryption process from which, at each stage, a sub-key is derived.
We use the Navier- Strokes Equation to emulate the cross over encryption, in Mathematics the Navier–
Stokes equations are a system of nonlinear partial differential equations for abstract vector fields of any size, in
physics and engineering, they are a system of equations that models the motion of liquids or non-rarefied gases
using continuum mechanics. The equations are a statement of Newton's second law, with the forces modelled
according to those in a viscous Newtonian fluid as the sum of contributions by pressure, viscous Stress and an
external body force. Rheology is the study of the flow of matter, primarily in the liquid state, but also as 'soft
solids' or solids under conditions in which they respond with plastic flow rather than deforming elastically in
response to an applied force [3]. It applies to substances which have a complex molecular structure, such as
mud, sludge, suspensions, polymers and other glass formers (e.g. silicates), as well as many foods and additives,
bodily fluids (e.g. blood) and other biological materials. Newtonian fluids can be characterized by a single
coefficient of viscosity for a specific temperature. Although this viscosity will change with temperature, it does
not change with the flow rate or strain rate. Only a small group of fluids exhibit such constant viscosity, and
they are known as Newtonian fluids. So we consider DNA as a Newtonian fluid. So it proves that we can use
Navier- Strokes equation on DNA movement and we consider DNA as a Continuum Particle. The reason behind
using a biological phenomenon can be well explained when considering evolutionary algorithms, their
importance and success.
II. METHODOLOGY
According to the current scenario in networking we use quantum cryptographic techniques when we
are using fibre optic cables to transmit data especially when we are using high speed Giga byte Ethernet
switching technology. So quantum cryptography has a prime role in encrypted data transmission than encryption
at the user end for confidentiality. Even NASA has banned encryption inside their vicinity. When we moved on
to the cloud we were hit with the issues of security again, the prime reason was the heterogeneity and chance of
open wormholes in the architecture where data is exposed. So from research I have found that the 3 prime weak
spot of attack in cloud is the login area, database transactions, and data storage. What if we has a technology that
can 100% avoid brute force, then it has to be fully depending on user interaction for login, thus the method of
using hash code to save password and further retrieval for authentication from a 3D login system developed in
java 3D came into my consideration, so that there is no loophole for any black hat to embed a brute force. Then
further securing the database using a 1024 bit key hash code was the next step to avoid SQL injection attack on
database, even if anyone can access the database illegally, he won’t be able to read the data at any point of time
as it uses a 1024 bit key hash, which takes approximately 21023
operation of brute force which takes
1.797693134862315907729305190789 * e308
keys at 2.4 GHz processor at 80% processor capacity for billions
of years to hack the code. For securing the data we will be using hash codes as explained, but how secure can a
hash code be when handling millions of users in the cloud. In this case we are in need of a better hash code
generation algorithm. Here we are coming up with the same reason why genetic algorithm is better than any
optimisation algorithm, the phenomenon of emulating mutation i.e. meiosis, this is what that we are using to
make meiosis based cryptographic hash function generation algorithm. Securing and maintaining the integrity
of authorised data in cloud level is handled by the techniques involving hash codes added as digest to the
document. In this research we are introducing a technique involving emulation of meiosis in DNA based
cryptography. For the emulation we consider the states at which the meiosis takes place, as it’s a motion of
chromosomes in a Newtonian fluid in 3 dimensional spaces, we consider the Navier Stokes equation to emulate
the meiosis and the transposition of bits according to the equation. Then a conflict that could arise might be the
use of 1204 bit key telling that it’s too long; not at all, it’s the same reason we moved from SHA128 to SHA256
to SHA386 to SHA512 that made us to move to a 1024 bit key length, The processor speed of super computers
are increasing day by day and increased to 33 petaflops as per 2014, and storing a 1024 bit key in cloud is not an
issue now as memory is not a tradeoffs factor in 2014. And as sectors of 1024 bits are used in cloud, there won’t
be any fragmentation issues in cloud storage is another advantage. So making it 1024 bit key can make even the
super computers to take a really long time to break the security of the code using brute force. The
3. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 41 | P a g e
implementation, demonstration, throughput, power analysis and application level solution to the security issues
in cloud will be done using j2SE. We have gone through the process that is required as general for the
implementation of the proposed algorithm and have come up with an algorithm as shown below.
Fig 1: Proposed sample algorithm.
Considering the algorithm we are going to generate the code part to implement the execution part of each phase
in the given algorithm.
2.1 CROSSOVER PHASE.
The code for chiasma swap is as in Fig 2.
Fig 2. Chiasma formation
4. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 42 | P a g e
1. We consider the entire data bits like a sine wave, in which each 512 bit is one entire DNA strand
2. Traversal is from the 512th
bit to the last bit minus 512 bit, because its reserved for the cross over to mutate
the key.
3. Each 512 bit strand is further divided into 64 bits of segment which represent the base pairs A, T, C, and G.
4. One segment of 64 bit is crossovered with its adjacent segment of another DNA segment, but not all
segments are crossovered, in the odd round even segment numbers are crossed and vice versa.
2.2 KEY CROSSOVER PHASE
We avoid the 1st
and last 512 bits of the data bit as we do the chiasma of those bits with the key bits and it
modifies the key as shown in Fig 3.
Fig 3. Chiasma modifies the key.
1. Similar to the cross over phases in the data bits, we do crossover on the keys with the 0-511 bits and the last
512 bits of data with the keys at both ends of 1024 bits each.
After the sequence of encryption we move on to the hash code, there we use the Navier- stokes equation;
Here we assume, Let v(x, t) be a 3-dimensional vector, the velocity of the fluid, and let p(x, t) be the pressure of
the fluid which we take as random prime numbers. The Navier–Stokes equations are supported by:
where v>0 is the kinematic viscosity, f(x, t) the external force,▼ is the gradient operator and Δ is the Laplacian
operator, which is also denoted by ▼.▼ . Note that this is a vector equation, i.e. it has three scalar equations.
Writing down the coordinates of the velocity and the external force as:
then for each i=1,2,3 there is the corresponding scalar Navier–Stokes equation is:
This Equation is then used to initiate the hash code generation, after that we will make an isomer for the 1st
512
DNA bit sequence so as to make is satisfy the constrains of good pseudo code, then we permute the code with
the prime or the key according to the polynomial equation based condition like a polymerase, and then the hash
code is generated after performing 54 rounds of the above steps as we use 54 prime numbers. Actually the
polymerase round alter the equality formed during isomer round in the totality of 0’s and 1’s in the binary
sequence.
5. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 43 | P a g e
Fig 4. Polymerase formation.
After this step the 1024 bit hash code will be shown which when go through can see the equality in the number
of 0’s and 1’s and the satisfaction of all the constrains of a good hash code generator which is low in
susceptibility towards regeneration of data.
III. IMPLIMENTATION AND RESULTS
The code for meiosis based cryptographic encryption and hash function generation(MCHF) has been
made in C and using JNI header it has been ported as .dll file and is used as an interface in Java swing
application development to show the working of the algorithm. Now we will be going through each phases of
the application starting with the front start window. From this we will be moving on to the application window
where the multiple options will be shown as in Fig 5.
Figure 5: Option Window with Algorithm chart.
Here there are multiple options given such as
1. OPEN FILE option to select the file to be encrypted and hashed and to add digital signature.
2. READ FILE option to read the content of the file.
3. Encryption option to encrypt the data using a key of greater than size 10 which will be taken in the text box
below the read window.
4. Decryption option to decrypt the data using the same key.
5. Hash Code option to generate the hash code of the file and show the digital signature as well as a
comparative analysis between the time complexities of each different algorithm used for hashing with
respect to MCHF.
6. 3D Login option to test the accessibility of cloud servers using a user interacted 3D login system to avoid
100% brute force attack and DDOS attack to the server. The MCHF is used to encrypt the 3D login output
6. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 44 | P a g e
when user touches or clicks each objects in the Java 3D interface. There after the output from encryption is
hashed and saved in the database so that the SQL injection attacks can be avoided permanently.
a. So the main security issues in the cloud
i. Login security
ii. Database security
is avoided when using this application.
b. User friendly logic method.
c. Secure 1024 bit key based hashing using DNA emulation.
7. Random Number Generation option to generate random numbers from the generated hash as the initial
entry and to find optimal output using special tools.
8. Throughput analysis option is used to take different file of various formats like .c, .docx, .pdf, .doc, .pptx
etc of various file size from 10kb to 10Mb to test the throughput (file size/delay), Power factor
(throughput/delay) and the improvement factor (power of other algorithms/power of MCHF) of our
algorithm MCHF and other algorithms such as MD4, MD5, SHA, SHA1, SHA128, SHA256, SHA384 and
SHA512.
9. Stegnography option is to use the MCHF algorithm to encrypt the data taken from a table entry and to store
the value using a key in a png file of small size.
10. Cryptanalysis option will be used to do a cryptanalysis on the encrypted output as well as the has code to
test and to verify the security reliability of the MCHF algorithm.
3.1 IMPLEMENTATION PHASES
Here we read a file of any format as shown in Fig 6, I selected a file of c format to be signed and encrypted and
to generate the hash code.
Figure 6: File content is read.
The read file content which is displayed in the test field will act as the entry to the encryption process
as shown in Fig 6. Then a key of size greater than 10 is provided for encryption. Key size is set as 10 to make
the encryption strong as it will generate a key bit of (10+size)*8 bit which is greater than 80 bits user key and
the remaining will only be the padding. The encryption and decryption is using the MCHF encryption phase as
shown in Fig 7 and further the same key can be used to decrypt the data, if the key is different, then the
decryption output won’t be displayed in the text field.
7. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 45 | P a g e
Figure 7: Encryption phase.
After the encryption the data which is generated as a multiple of 1024 will be fed into the hash code
generator and at the same time the digital signature of the file will be created and it will be appended in the data
which is shown at that time and in another phase the genuinely of the digital signature is checked by recreating
the digest, here we use a java generated public key file to assist in public key exchange during digital signature.
At the same time multiple hash code on the same data is generated using
1. MCHF
2. MD5
3. MD4
4. SHA
5. SHA1
6. SHA256
7. SHA384
8. SHA512
And the start time and end time of response from each algorithm in nano seconds is retrieved and then the
difference is shown in micro seconds.
Figure 8: Hash code of the data (generated after ciphering)
8. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 46 | P a g e
Figure 9: Digital Signature of the file content.
Figure 10: Comparative analysis between different hash code algorithms.
Figure 11: Time complexity analysis and other QoS factors.
From the output of hash code, we generated the time complexity test for different algorithms which has
different key size as shown in Fig 10 and Fig 11. As we can see our algorithm is 3rd
in the list, which shows that
the trial 128 loop even gives a better time complexity, testing of loop can be further improved by reducing the
no. of loops in the hash code phase.
Now let us move on to the application of the hash code in 3D login and random number generation and
optimisation.
In this phase the hash code generates a random plot ‘a’, ’c’ and ‘m’ value and is forwarded to the RNG
to generate the graph and to generate the plot values as shown in Fig 12. Further we will go for the analysis
phase using Data Tool developed by MIT and we will b using the function to transfer our data to the Data Tool
to plot the graph so as to find the min and max values to find the optimal plots as shown in Fig 13.
9. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 47 | P a g e
Figure 12: Random number generation.
Figure 13: Data Tool plots the generated random point.
Here the Data Tool will plot the random points and the global maxima are shown as the 2nd
value in the table
which is highlighted in Fig 14.
Figure 14: Data Tool output of global maxima, local maximas’ and local minimas’.
10. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 48 | P a g e
So the algorithm can be used for optimization purpose and it will be using stimulated annealing to find the
global maxima out of all local maximas’.
Now we move on to the use of 3D log in system for cloud. Here the login is based up on pure user
interaction in the 3D environment. There will be different type of objects in the environment as shown in Fig 15,
the sequence of the objects that the user clicks will be his password and the data will be taken as a com object as
shown in Fig 16 and then it will be encrypted and a hash code will be generated as stored in database.
Figure 15: 3D Login interface
Figure 16: Data generated in Command Prompt when the user access each objects.
So the system can avoid 100 % brute force attack on login and DDOS in the login and SQL injection at
the backend. This is the working of Meiosis based cryptographic algorithm and its applications created in java
swing and java 3D environment and the coding is done in JVM for hashing using JNI interface so that the C
program can directly access the JVM as a .dll file.
Now let us consider the stegnographic application of the encryption. For this purpose I have created an
interphase in java swing to show a set of tables in which the user can provide his/ her credentials which will be
stored using a key as a PNG file as shown in the Figure 17:
Figure 17: Stegnographic application of MCHF algorithm (Frame work of stegnographic application
rendered from secret painter open source code)
11. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 49 | P a g e
When the generate image button is pressed the file will be created in its given location, the application
closes by itself to show that no data is stored in the application interface as soon as the image is generated. Now
let us move on to the decryption phase.
Figure 18: Decryption of the data from the image.
After selecting the image for decryption the key has to be given and if the key is wrong the data won’t be
shown.
Figure 19: Decrypted data
IV. CRYPTANALYSIS AND BRUTEFORCE TESTING
Now let us move on to cryptanalysis, for the purpose of cryptanalysis we will be using CrypTool where we pass
the hash code for various cryptanalysis techniques to find the possibilities to crack the code.
Figure 20: Generated hash code in cryptool console.
Now we select the hash analysis window which is used to search whether another file containing the fake
message can generate a hash code similar to the data in the original message for which we generated the hash
code.
12. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 50 | P a g e
Figure 21: Console showing the chance of faking the hash code with a fake message.
It shows in the console that the process takes 2.6*e93
years to crack the hash code for a 2.4GHz processor.
Which shows that our hash code is safe from attack in the sense that the fastest super computer of speed 33.5
petaflops (36833639530496Hz) takes 7.05876 * e79
sec which is 2.238 * e72
years.
Now we will be trying brute force attack on the output from encryption phase using cryptool. For this we will be
passing the encrypted value and will be testing brute force.
Figure 22: Brute force set up to crack the key up to 256 bits.
Figure 23: Brute force for attack execution
In the output we can see that the process takes 2.1*e65
years to complete the task to decrypt the cipher up to a
key length of 256 bits so for 1024 bit key it will be approximately 2.1*e511
years. And the test decryption output
is
13. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 51 | P a g e
Figure 24: Brute force output after temporary retrieval.
Now we will be considering the 3D visualisation of the hash output to see the equal distribution of variables in
the output to show that the function is strong because the formation of pattern shows weak points when there are
more digrams trigrams and n-grams.
Figure 25: 3D output which shows the distribution of alphabets in the cipher output (no patters).
The floating point output shows equality in all different characters per 64 byte blocks throughout the distribution
to show that there is no specific flaws due to patterns which help in cryptanalysis.
Figure 26: Floating point graphic representation of byte distribution
14. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 52 | P a g e
Figure 27: N-grams in the encrypted data as well as digrams and trigrams
Figure 28: Histogram pf encrypted data.
Figure 29: Auto correction to check for cryptanalysis loop holes
Figure 30: mean deviation and standard deviation as well as variance of the cipher
15. Mchf Algorithm for Multilevel Cloud Security
International organization of Scientific Research 53 | P a g e
V. CONCLUSION
Whenever we go through security in cloud, a new loop hole or a backdoor opens for intrusion,
mechanisms such as encryption and security model always played the way to improving the security in cloud
and still the weakness that there is always a path for a black hat to go through the front door like a user still
remains an issue, as demonstrated above
A pure 100% human interactive login system at the front end
A hash code using 1024 bit key which is used for data base
A hash code based splay tree algorithm to randomly change the hash code value every 30 minutes which
refers to the memory location of the file
All these 3 techniques at 3 most vulnerable points on cloud security architecture can avoid more than
90% attack on cloud users and its authenticity [9]. The implementation as well as the performance of the
proposed and shows security mechanism using hash code will be easy on cloud as the cloud provides
homogeneity in its deployment as it can be implemented at different deployment models even if its private cloud
or public cloud, the performance of the system will be progressively immune to attacks. The future scope of this
MCHF algorithm is the deployment of this security implementations as a cloud architecture or a security model
for cloud as security is of prime importance in cloud computing.
VI. ACKNOWLEDGEMENTS
The topic was inter disciplinary, which included not just cryptography but also the basics of
fertilization and mutation, fluid mechanics, continuum mechanics etc, I thank Asst. Prof Ankur Sodhi for the
help he provided in sorting out the problem and for the other technical and advisory support. I extend my thanks
to the department of Computer science in Lovely Professional University.
REFERENCES
Journal Papers:
[1] Bijoy Boban, Meiosis Based Cryptographic Hash Function Generation with the Influence of 3D Navier
Stokes Equation on Chromosomal Chaotic Movement in Nucleoplasm, international journal for advanced
research in computer science, Vol-4, No. 8, May- June 2013.
[2] R. Siddharth and Rajeev Kumar, Formulation of an Encryption Algorithm on the Basis of Molecular
Genetics and Image Patterns by M. Prashant, Department of Computer Science & Information Systems,
Birla Institute of Technology & Science, Pilani – 333 031, India.
[3] Aashish Priye, Radha Muddu, Yassin A. Hassan, and Victor M. Ugaz, Selecting 3D Chaotic flow states
for Accelerated DNA replication in MICRO-SCALE convective PCR, Department of Chemical
Engineering, Texas A&M University, College Station, TX 77843, USA.
[4] Thomas Y. Hou1
, Zhen Lei2
, On the Partial Regularity of a 3D Model of the Navier-Stokes Equations, 1.
Applied and Compute. Math, Caltech, Pasadena, CA 91125, USA. 2. School of Mathematical Sciences,
Fudan University, Shanghai 200433, P.R. China.
[5] Ashish Gehani, Thomas LaBean, and John Reif, DNA-Based Cryptography, Department of Computer
Science, Duke University.
[6] H. Z. Hsu and R. C. T. Lee, DNA Based Encryption Methods , Department of Computer Science
National Chi Nan University, Puli, Nantou Hsieh, Taiwan 545.
[7] k.s tang, k.f man, s. kwong, q. he, Genetic Algorithm and their applications, IEEE signal processing
magazine, November 1996.
Books:
[8] Herskowitz,H. I., Basic Principles of Molecular Genetics, Thomas Nelson, England, 1968.
[9] Bijoy Boban, Comparative analysis between Grid and Cloud computing, Grin Publications, California,
2012.