The use of key-dependent shiftRows can be considered as one of the applied methods for altering the quality of a cryptographic algorithm. This article describes one approach for changing the ShiftRows transformation employed in the algorithm AES. The approach employs methods inspired from DNA processes and structure which depended on the key while the parameters of the created new ShiftRows have characteristics identical to those of the original algorithm AES in addition to increase its resistance against attacks. The proposed new ShiftRows were tested for coefficient correlation for dynamic and static independence between the input and output. The NIST Test Suite tests were used to test the randomness for the block cipher that used the new transformation.
A new dna based approach of generating keydependentmixcolumnsIJCNCJournal
The use of key-dependent MixColumns can be regarded as one of the applied techniques for changing the
quality of a cryptographic algorithm. This article explains one approach for altering the MixColumns
transformation engaged in the AES algorithm. The approach employed methods inspired from DNA
processes and structure, which relied on the key.The parameters of the proposedMixCloumns have
characteristics identical to those of the original algorithm AES besides increasing its resistance against
attack.The original transformation uses single static MDS matrix while the proposed methods used
dynamic MDS. The security of the new MixColumns was analyzed, and the NIST Test Suite tests were used
to test the randomness for the block cipher that used the new transformation.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document summarizes a research paper that proposes a new symmetric block cipher algorithm similar to AES but with a 200-bit block size instead of 128 bits. It compares the power consumption and strict avalanche criteria of the proposed algorithm to other AES standards. The power consumption during encryption is up to 30% lower but decryption is 20% higher. The strict avalanche criteria shows the proposed algorithm meets security levels of AES. The algorithm is described in detail including key schedule, byte substitution, shift row, mix column, and add round key transformations.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document summarizes a research paper that proposes a new symmetric block cipher algorithm similar to AES but with a 200-bit block size instead of 128 bits. It compares the power consumption and strict avalanche criteria of the proposed algorithm to other AES standards. The power consumption during encryption is up to 30% lower but decryption is 20% higher. The strict avalanche criteria shows the proposed algorithm meets security levels of AES. The algorithm is described in detail including key schedule, byte substitution, shift row, mix column, and add round key transformations.
GROUP SESSION KEY EXCHANGE MULTILAYER PERCEPTRON BASED SIMULATED ANNEALING GU...ijwmn
This document describes a new technique called GSMLPSA for secure group key exchange and encryption in wireless communication. It uses a multilayer perceptron neural network to generate a session key shared between parties. Plaintext is encrypted in multiple levels using a metamorphosed code table, comparison-based encryption, and a keystream generated by simulated annealing. The keystream is further encrypted using a finite state automaton before being XORed with the session key and sent. This allows secure key exchange among a group of parties with only logarithmic complexity. Experimental results show the technique provides comparable security to existing methods.
This document describes the design and implementation of a hybrid cryptosystem using the AES and SHA-2 algorithms. The system integrates AES, a symmetric encryption algorithm, with SHA-2, a cryptographic hash function, to improve data security. AES encrypts data using a 128-bit key generated by hashing the input message with SHA-2. The combined system was synthesized using Xilinx ISE software and implemented on a Virtex-5 FPGA, utilizing under 2% of slice registers and 5% of slice LUTs. This provides higher security than AES alone through increased algorithm complexity.
Simulation of Quantum Cryptography and use of DNA based algorithm for Secure ...IOSR Journals
This document describes a simulation of quantum cryptography and the use of a DNA-based algorithm for secure communication. It discusses the fundamentals of quantum cryptography based on no-cloning theorem and Heisenberg's uncertainty principle. The document then proposes a system with modules for BB84 protocol-based key exchange and authentication, followed by encryption/decryption of messages using a DNA-based symmetric block cipher algorithm. Screenshots of a simulation of the system are provided along with analysis of its time and space complexity.
International journal of computer science and innovation vol 2015-n2-paper5sophiabelthome
This document proposes a new method for encrypting and transferring data safely using a position weight matrix. A position weight matrix is typically used to represent DNA sequences, but is rarely used for data encryption. The proposed method assigns character values from a message to positions in a matrix based on nucleotide labels. Random values are added to make the matrix appear like a real position weight matrix representing biological data rather than encrypted text. This obscures the encrypted message and makes decryption difficult without knowing the encryption process. The summary concludes the method provides a safe way to transfer data since an intercepted matrix would likely be interpreted as biological data rather than an encrypted message.
Signal Processing Approach for Recognizing Identical Reads From DNA Sequencin...IOSR Journals
The document discusses a signal processing approach using wavelet transforms to identify identical reads from DNA sequencing data. It proposes representing DNA sequences numerically based on electron-ion interaction pseudo potentials and applying multi-level Haar wavelet transforms. This reduces sequence lengths to one-eighth their original size, allowing efficient element-by-element comparisons to find identical reads. Testing on Bacillus sequencing data showed the method identified up to 17% identical reads, reducing redundant data by up to 11% and computation time compared to string processing methods.
A new dna based approach of generating keydependentmixcolumnsIJCNCJournal
The use of key-dependent MixColumns can be regarded as one of the applied techniques for changing the
quality of a cryptographic algorithm. This article explains one approach for altering the MixColumns
transformation engaged in the AES algorithm. The approach employed methods inspired from DNA
processes and structure, which relied on the key.The parameters of the proposedMixCloumns have
characteristics identical to those of the original algorithm AES besides increasing its resistance against
attack.The original transformation uses single static MDS matrix while the proposed methods used
dynamic MDS. The security of the new MixColumns was analyzed, and the NIST Test Suite tests were used
to test the randomness for the block cipher that used the new transformation.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document summarizes a research paper that proposes a new symmetric block cipher algorithm similar to AES but with a 200-bit block size instead of 128 bits. It compares the power consumption and strict avalanche criteria of the proposed algorithm to other AES standards. The power consumption during encryption is up to 30% lower but decryption is 20% higher. The strict avalanche criteria shows the proposed algorithm meets security levels of AES. The algorithm is described in detail including key schedule, byte substitution, shift row, mix column, and add round key transformations.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document summarizes a research paper that proposes a new symmetric block cipher algorithm similar to AES but with a 200-bit block size instead of 128 bits. It compares the power consumption and strict avalanche criteria of the proposed algorithm to other AES standards. The power consumption during encryption is up to 30% lower but decryption is 20% higher. The strict avalanche criteria shows the proposed algorithm meets security levels of AES. The algorithm is described in detail including key schedule, byte substitution, shift row, mix column, and add round key transformations.
GROUP SESSION KEY EXCHANGE MULTILAYER PERCEPTRON BASED SIMULATED ANNEALING GU...ijwmn
This document describes a new technique called GSMLPSA for secure group key exchange and encryption in wireless communication. It uses a multilayer perceptron neural network to generate a session key shared between parties. Plaintext is encrypted in multiple levels using a metamorphosed code table, comparison-based encryption, and a keystream generated by simulated annealing. The keystream is further encrypted using a finite state automaton before being XORed with the session key and sent. This allows secure key exchange among a group of parties with only logarithmic complexity. Experimental results show the technique provides comparable security to existing methods.
This document describes the design and implementation of a hybrid cryptosystem using the AES and SHA-2 algorithms. The system integrates AES, a symmetric encryption algorithm, with SHA-2, a cryptographic hash function, to improve data security. AES encrypts data using a 128-bit key generated by hashing the input message with SHA-2. The combined system was synthesized using Xilinx ISE software and implemented on a Virtex-5 FPGA, utilizing under 2% of slice registers and 5% of slice LUTs. This provides higher security than AES alone through increased algorithm complexity.
Simulation of Quantum Cryptography and use of DNA based algorithm for Secure ...IOSR Journals
This document describes a simulation of quantum cryptography and the use of a DNA-based algorithm for secure communication. It discusses the fundamentals of quantum cryptography based on no-cloning theorem and Heisenberg's uncertainty principle. The document then proposes a system with modules for BB84 protocol-based key exchange and authentication, followed by encryption/decryption of messages using a DNA-based symmetric block cipher algorithm. Screenshots of a simulation of the system are provided along with analysis of its time and space complexity.
International journal of computer science and innovation vol 2015-n2-paper5sophiabelthome
This document proposes a new method for encrypting and transferring data safely using a position weight matrix. A position weight matrix is typically used to represent DNA sequences, but is rarely used for data encryption. The proposed method assigns character values from a message to positions in a matrix based on nucleotide labels. Random values are added to make the matrix appear like a real position weight matrix representing biological data rather than encrypted text. This obscures the encrypted message and makes decryption difficult without knowing the encryption process. The summary concludes the method provides a safe way to transfer data since an intercepted matrix would likely be interpreted as biological data rather than an encrypted message.
Signal Processing Approach for Recognizing Identical Reads From DNA Sequencin...IOSR Journals
The document discusses a signal processing approach using wavelet transforms to identify identical reads from DNA sequencing data. It proposes representing DNA sequences numerically based on electron-ion interaction pseudo potentials and applying multi-level Haar wavelet transforms. This reduces sequence lengths to one-eighth their original size, allowing efficient element-by-element comparisons to find identical reads. Testing on Bacillus sequencing data showed the method identified up to 17% identical reads, reducing redundant data by up to 11% and computation time compared to string processing methods.
The document discusses stream ciphers and block ciphers. It explains that stream ciphers encrypt data bit-by-bit or byte-by-byte, requiring a randomly generated keystream, while block ciphers encrypt fixed-length blocks, allowing for broader applications. It then focuses on the Feistel cipher structure for block ciphers, proposed by Feistel to approximate an ideal block cipher for large block sizes. The Feistel structure uses a product cipher approach involving substitutions and permutations to provide diffusion and confusion and resist statistical cryptanalysis.
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 document summarizes a presentation on fault detection in the Advanced Encryption Standard (AES) algorithm. It begins with an introduction to AES, which is a symmetric key algorithm that operates on 128-bit blocks using 128, 192, or 256-bit keys. It then discusses related work on improving AES performance and fault detection. The proposed system describes the AES algorithm and its transformations in more detail. A fault detection scheme is proposed that calculates parities of blocks in the AES S-box and inverse S-box. Implementation results show the proposed scheme achieves high error coverage for single and multiple faults with low area and delay costs.
This document contains definitions and explanations of various cryptographic concepts and techniques:
- It defines traffic analysis attacks, rail fence transposition, block ciphers vs stream ciphers, cryptanalysis vs brute force attacks, unconditionally secure vs computationally secure ciphers, the Caesar cipher, monoalphabetic ciphers, Playfair ciphers, one-time pads, transposition ciphers, steganography, and Feistel ciphers.
- It also explains concepts like diffusion vs confusion, the purpose of S-boxes in DES, the avalanche effect, monoalphabetic vs polyalphabetic ciphers, and criteria for evaluating AES candidates.
Security Analysis of AES and Enhancing its Security by Modifying S-Box with a...IJCNCJournal
The document analyzes the security of the Advanced Encryption Standard (AES) algorithm and proposes a modification to enhance its security. It summarizes AES, including its key expansion process, rounds, and steps. It then evaluates AES-128 security based on time security against brute force attacks and avalanche effect criteria. The authors propose modifying AES by XORing an additional random byte with the s-box value to increase time security and strict avalanche criterion. Security measurements of the modified AES sometimes fluctuate due to the random additional key.
DARE Algorithm: A New Security Protocol by Integration of Different Cryptogra...IJECEIAES
This document proposes a new hybrid cryptographic algorithm called DARE that integrates Digital Signature Algorithm (DSA) for key generation, Data Encryption Standard (DES) for key scheduling, and Advanced Encryption Standard (AES) and Rivest–Shamir–Adleman (RSA) algorithms for encryption. It presents a block diagram of the algorithm and describes the key generation, encryption, and decryption processes. As an example, it generates keys using a passphrase and encrypts a sample message to demonstrate that the algorithm is achievable.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
This document summarizes the key aspects of cryptanalysis and the Data Encryption Standard (DES) algorithm. It discusses the tasks of a cryptanalyst in breaking encryption systems and outlines the basic structure and operation of DES. DES encrypts 64-bit blocks using a 56-bit key and 16 rounds of encryption. Each round uses a 48-bit subkey and the Feistel network structure to provide diffusion and confusion. The document also notes concerns about the cryptographic strength of DES' 56-bit keys and 8 substitution boxes against attacks over time.
1) The document proposes a hybrid 128-bit key AES-DES algorithm to enhance data security and transmission security for next generation networks.
2) It discusses some weaknesses in the AES encryption algorithm against algebraic cryptanalysis and outlines a hybrid approach that combines AES and DES algorithms.
3) The hybrid approach integrates the AES encryption process within the Feistel network structure of DES, using AES transformations like byte substitution and shift rows within each round of the DES Feistel network. This is intended to strengthen security by combining the advantages of both algorithms while reducing individual weaknesses.
K-mer frequency statistics of biological sequences is a very important and important problem in biological information processing. This paper addresses the problem of index k-mer for large scale data reading DNA sequences in a limited memory space and time. Using the hash algorithm to establish index, the index model is set up to base pairing, and get the length of k-mer statistic information quickly, so as to avoid
searching all the sequences of the index. At the same time, the program uses hash table to establish index and build search model, and uses the zipper method to resolve the conflict in the case of address conflict.Algorithm of time complexity analysis and experimental results show that compared with the traditional indexing methods, the algorithm of the performance improvement is obvious, and very suitable for to be used in the k-mer length change with a wide range .
On Linear Complexity of Binary Sequences Generated Using Matrix Recurrence Re...ijdpsjournal
This paper discusses the linear complexity property of binary sequences generated using matrix recurrence relation defined over Z4. Generally algorithm to generate random number is based on recursion with seed value/values. In this paper a linear recursion sequence of matrices or vectors over Z4 is generated from which random binary sequence is obtained. It is shown that such sequences have large linear complexity.
Symmetric Key based Encryption and Decryption using Lissajous Curve EquationsYayah Zakaria
Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This
application makes use of all ASCII characters which makes brute force attack impossible.
Symmetric Key based Encryption and Decryption using Lissajous Curve EquationsIJECEIAES
Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This application makes use of all ASCII characters which makes brute force attack impossible.
This document discusses a proposed design for secure military communications using AES encryption with Vedic mathematics, OFDM modulation, and QPSK. Specifically, it proposes using AES to encrypt data, applying Vedic math techniques to improve efficiency during the MixColumns step. The encrypted data would then be modulated using OFDM and QPSK to provide high throughput communication. Key aspects of the design include AES encryption/decryption, OFDM using QPSK and an IFFT/FFT, and applying Vedic math during AES encryption to reduce complexity and power consumption for military applications.
EFFICIENT DIGITAL ENCRYPTION ALGORITHM BASED ON MATRIX SCRAMBLING TECHNIQUEIJNSA Journal
This paper puts forward a safe mechanism of data transmission to tackle the security problem of information which is transmitted in Internet. We propose a new technique on matrix scrambling which is based on random function, shifting and reversing techniques of circular queue. We give statistical analysis, sequence random analysis, and sensitivity analysis to plaintext and key on the proposed scheme. The experimental results show that the new scheme has a very fast encryption speed and the key space is expanded and it can resist all kinds of cryptanalytic, statistical attacks, and especially, our new method can be also used to solve the problem that is easily exposed to chosen plaintext attack. We give our detailed report to this algorithm, and reveal the characteristic of this algorithm by utilizing an example.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
The document proposes a new clustering protocol called Enhanced Threshold Sensitive Stable Election Protocol (ETSEP) for heterogeneous wireless sensor networks. ETSEP aims to improve network lifetime, stability, and throughput compared to other clustering protocols like Stable Election Protocol (SEP), Threshold Sensitive Stable Election protocol (TSEP), and Zonal Stable Election Protocol (ZSEP). In ETSEP, cluster head election probability dynamically changes based on three levels of node energy: normal nodes, intermediate nodes with half the energy of advance nodes, and advance nodes with the most energy. Simulation results show that ETSEP performs better than SEP, TSEP, and ZSEP in terms of stability and network lifetime.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...IJECEIAES
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
More Related Content
Similar to A NEW DNA BASED APPROACH OF GENERATING KEYDEPENDENT SHIFT ROWS TRANSFORMATION
The document discusses stream ciphers and block ciphers. It explains that stream ciphers encrypt data bit-by-bit or byte-by-byte, requiring a randomly generated keystream, while block ciphers encrypt fixed-length blocks, allowing for broader applications. It then focuses on the Feistel cipher structure for block ciphers, proposed by Feistel to approximate an ideal block cipher for large block sizes. The Feistel structure uses a product cipher approach involving substitutions and permutations to provide diffusion and confusion and resist statistical cryptanalysis.
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 document summarizes a presentation on fault detection in the Advanced Encryption Standard (AES) algorithm. It begins with an introduction to AES, which is a symmetric key algorithm that operates on 128-bit blocks using 128, 192, or 256-bit keys. It then discusses related work on improving AES performance and fault detection. The proposed system describes the AES algorithm and its transformations in more detail. A fault detection scheme is proposed that calculates parities of blocks in the AES S-box and inverse S-box. Implementation results show the proposed scheme achieves high error coverage for single and multiple faults with low area and delay costs.
This document contains definitions and explanations of various cryptographic concepts and techniques:
- It defines traffic analysis attacks, rail fence transposition, block ciphers vs stream ciphers, cryptanalysis vs brute force attacks, unconditionally secure vs computationally secure ciphers, the Caesar cipher, monoalphabetic ciphers, Playfair ciphers, one-time pads, transposition ciphers, steganography, and Feistel ciphers.
- It also explains concepts like diffusion vs confusion, the purpose of S-boxes in DES, the avalanche effect, monoalphabetic vs polyalphabetic ciphers, and criteria for evaluating AES candidates.
Security Analysis of AES and Enhancing its Security by Modifying S-Box with a...IJCNCJournal
The document analyzes the security of the Advanced Encryption Standard (AES) algorithm and proposes a modification to enhance its security. It summarizes AES, including its key expansion process, rounds, and steps. It then evaluates AES-128 security based on time security against brute force attacks and avalanche effect criteria. The authors propose modifying AES by XORing an additional random byte with the s-box value to increase time security and strict avalanche criterion. Security measurements of the modified AES sometimes fluctuate due to the random additional key.
DARE Algorithm: A New Security Protocol by Integration of Different Cryptogra...IJECEIAES
This document proposes a new hybrid cryptographic algorithm called DARE that integrates Digital Signature Algorithm (DSA) for key generation, Data Encryption Standard (DES) for key scheduling, and Advanced Encryption Standard (AES) and Rivest–Shamir–Adleman (RSA) algorithms for encryption. It presents a block diagram of the algorithm and describes the key generation, encryption, and decryption processes. As an example, it generates keys using a passphrase and encrypts a sample message to demonstrate that the algorithm is achievable.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
This document summarizes the key aspects of cryptanalysis and the Data Encryption Standard (DES) algorithm. It discusses the tasks of a cryptanalyst in breaking encryption systems and outlines the basic structure and operation of DES. DES encrypts 64-bit blocks using a 56-bit key and 16 rounds of encryption. Each round uses a 48-bit subkey and the Feistel network structure to provide diffusion and confusion. The document also notes concerns about the cryptographic strength of DES' 56-bit keys and 8 substitution boxes against attacks over time.
1) The document proposes a hybrid 128-bit key AES-DES algorithm to enhance data security and transmission security for next generation networks.
2) It discusses some weaknesses in the AES encryption algorithm against algebraic cryptanalysis and outlines a hybrid approach that combines AES and DES algorithms.
3) The hybrid approach integrates the AES encryption process within the Feistel network structure of DES, using AES transformations like byte substitution and shift rows within each round of the DES Feistel network. This is intended to strengthen security by combining the advantages of both algorithms while reducing individual weaknesses.
K-mer frequency statistics of biological sequences is a very important and important problem in biological information processing. This paper addresses the problem of index k-mer for large scale data reading DNA sequences in a limited memory space and time. Using the hash algorithm to establish index, the index model is set up to base pairing, and get the length of k-mer statistic information quickly, so as to avoid
searching all the sequences of the index. At the same time, the program uses hash table to establish index and build search model, and uses the zipper method to resolve the conflict in the case of address conflict.Algorithm of time complexity analysis and experimental results show that compared with the traditional indexing methods, the algorithm of the performance improvement is obvious, and very suitable for to be used in the k-mer length change with a wide range .
On Linear Complexity of Binary Sequences Generated Using Matrix Recurrence Re...ijdpsjournal
This paper discusses the linear complexity property of binary sequences generated using matrix recurrence relation defined over Z4. Generally algorithm to generate random number is based on recursion with seed value/values. In this paper a linear recursion sequence of matrices or vectors over Z4 is generated from which random binary sequence is obtained. It is shown that such sequences have large linear complexity.
Symmetric Key based Encryption and Decryption using Lissajous Curve EquationsYayah Zakaria
Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This
application makes use of all ASCII characters which makes brute force attack impossible.
Symmetric Key based Encryption and Decryption using Lissajous Curve EquationsIJECEIAES
Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This application makes use of all ASCII characters which makes brute force attack impossible.
This document discusses a proposed design for secure military communications using AES encryption with Vedic mathematics, OFDM modulation, and QPSK. Specifically, it proposes using AES to encrypt data, applying Vedic math techniques to improve efficiency during the MixColumns step. The encrypted data would then be modulated using OFDM and QPSK to provide high throughput communication. Key aspects of the design include AES encryption/decryption, OFDM using QPSK and an IFFT/FFT, and applying Vedic math during AES encryption to reduce complexity and power consumption for military applications.
EFFICIENT DIGITAL ENCRYPTION ALGORITHM BASED ON MATRIX SCRAMBLING TECHNIQUEIJNSA Journal
This paper puts forward a safe mechanism of data transmission to tackle the security problem of information which is transmitted in Internet. We propose a new technique on matrix scrambling which is based on random function, shifting and reversing techniques of circular queue. We give statistical analysis, sequence random analysis, and sensitivity analysis to plaintext and key on the proposed scheme. The experimental results show that the new scheme has a very fast encryption speed and the key space is expanded and it can resist all kinds of cryptanalytic, statistical attacks, and especially, our new method can be also used to solve the problem that is easily exposed to chosen plaintext attack. We give our detailed report to this algorithm, and reveal the characteristic of this algorithm by utilizing an example.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
The document proposes a new clustering protocol called Enhanced Threshold Sensitive Stable Election Protocol (ETSEP) for heterogeneous wireless sensor networks. ETSEP aims to improve network lifetime, stability, and throughput compared to other clustering protocols like Stable Election Protocol (SEP), Threshold Sensitive Stable Election protocol (TSEP), and Zonal Stable Election Protocol (ZSEP). In ETSEP, cluster head election probability dynamically changes based on three levels of node energy: normal nodes, intermediate nodes with half the energy of advance nodes, and advance nodes with the most energy. Simulation results show that ETSEP performs better than SEP, TSEP, and ZSEP in terms of stability and network lifetime.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Similar to A NEW DNA BASED APPROACH OF GENERATING KEYDEPENDENT SHIFT ROWS TRANSFORMATION (20)
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...IJECEIAES
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Null Bangalore | Pentesters Approach to AWS IAMDivyanshu
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.
artificial intelligence and data science contents.pptxGauravCar
What is artificial intelligence? Artificial intelligence is the ability of a computer or computer-controlled robot to perform tasks that are commonly associated with the intellectual processes characteristic of humans, such as the ability to reason.
› ...
Artificial intelligence (AI) | Definitio
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Mechanical Engineering on AAI Summer Training Report-003.pdf
A NEW DNA BASED APPROACH OF GENERATING KEYDEPENDENT SHIFT ROWS TRANSFORMATION
1. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
DOI : 10.5121/ijnsa.2015.7107 79
A NEW DNA BASED APPROACH OF GENERATING KEY-
DEPENDENT SHIFT ROWS TRANSFORMATION
Auday H. Al-Wattar1
, Ramlan Mahmod2
, Zuriati Ahmad Zukarnain3
, and Nur
Izura Udzir4
,
1
Faculty of Computer Science and Information Technology
Universiti Putra Malaysia,
43400 UPM, Serdang, Selangor.
ABSTRACT
The use of key-dependent shiftRows can be considered as one of the applied methods for altering the
quality of a cryptographic algorithm. This article describes one approach for changing the ShiftRows
transformation employed in the algorithm AES. The approach employs methods inspired from DNA
processes and structure which depended on the key while the parameters of the created new ShiftRows have
characteristics identical to those of the original algorithm AES in addition to increase its resistance
against attacks. The proposed new ShiftRows were tested for coefficient correlation for dynamic and static
independence between the input and output. The NIST Test Suite tests were used to test the randomness for
the block cipher that used the new transformation.
KEYWORDS
ShiftRows, Block cipher, DNA, AES, NIST, Coefficient correlation
1.INTRODUCTION
Through the rapid expansion of the Internet and increasing the reliance upon in all areas of life,
the need for a highly effective way to achieve security is fateful and crucial. Cryptography has
been and remains the most efficient approach used to achieve security. Rijndael is a symmetric
key block cipher that was chosen by (NIST) (National Institute of Standards and Technology), [1]
in 2001 as (advanced Encryption Standard, FIPS 197) AES.This encryption is dependent on
substitution-permutation network Shannon (SPN).
Generally, it is based on repeated rounds of transformation that convert input plaintext to
ciphertext (encrypted text) output. Each round includes several procedures and always involves a
relying on the private cryptographic key. Multiple cycles determine inverse transforming
ciphertext into the original, using the same cryptographic key. AES has fixed block size (128-bit),
and a key length is 128, 192 or 256 bits, relating to the number of rounds for the algorithm. It is
runs a byte array called state of 4x4 size in each round of encryption / decryption methods. Most
of the algorithm calculations are achieved in finite fields [2,3].
In AES, the ShiftRows is transformation is one of linear unit of symmetric encryption
algorithms.It is a transposition action where each row of the state cyclically shifted a number of
times. The aim of this function is to scramble the byte order within each 128-bit block, to supply
2. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
80
diffusion of bits across multiple rounds. This transformation includes shifting the state rows as:
The first row in the state does not move, the second row is circular left shifted by 1 byte, the
Figure 1. AES ShitRows transformation
third row is circular left shifted by 2 bytes, and the last row is circular left shifted by 3 bytes.
Figure 1 shows the AES ShiftRows transformation.
According to [4], AES without ShiftRows stage are more than that of AES, their values
differ very little for different rounds. This is assign of poor encryption quality
The most challenging for AES algorithm is the linear and differential cryptanalysis where,
Rijndael can be issue to standard techniques of differential and linear cryptanalysis.
From the analysis of resistance against differential and linear cryptanalysis, it was found that the
arbitrary unknown and key-dependent substitution and permutation transformations is consider as
a good factor in enhancing the resistance of block cipher against the differential and linear
attacks, since the differential and linear attacks need known transformations. The specific
properties of substitution and permutation functions, specifically the structure that is entirely
dynamic and unknown to the cryptanalyst, aid and support the block cipher to be resistance
against attacks. For the attacker, differential and linear trail over multiple rounds is consider as a
vital requirement, and in the existence of key-dependent dynamic transformations output
differences rely on additional key used. In addition for any additional different key values, there
are unrelated differentials over multiple rounds and therefore diverse linear differential trails. As
result it is difficult for the attacker to utilize the current linear and differential techniques of
cryptanalysis.
Although all previous works on enhancing the security of AES block cipher against attacks, no
one has proposed or suggested a ShiftRows that is designed or created using DNA structure and
bio-inspired techniques.
This paper proposed a novel technique for gaining a powerful key-dependent ShiftRows based on
operations that have been inspired from really biological DNA structure and processes.
Subsequently, it tested the new ShiftRows using the correlation coefficient test, the NIST
randomness tests for the cryptosystem that used the DNA-based ShifRows and finally performed
a cryptanalysis for the proposed transformation.
2. DNA BACKGROUND
DNA (Deoxyribo Nucleic Acid) is a molecule that represents the genetic material for all living
organisms. It is the information carrier of all life forms, and considered as the genetic drawing of
living or existing creatures. DNA contains two such chains, twisted around each other to form a
double-stranded helix with the bases on the inside.
A single-strand of DNA consists of a chain of molecules known as bases, defined as four
3. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
81
characters {A, C, G, and T}[5,6]. One of the most basic attributes of the DNA strand series is that
it is oriented; consequently, CGTAGGA is distinct from AGGATGC.
The DNA strands subsist as pairs as (A) associated with (T) and (C) associated with (G) forming
units named base pairs, as shown in Figure 2. The reverse DNA strand represents the opposite of
the strand bases; for example, GCATAA becomes AATACG, while the complement of the
strands can be represented as A¯ T and C¯ G. Accordingly, the reverse complementary of
the strands can be represented in two actions: reverse the basis of the strands
Figure 2. DNA bases reverse complement technique
and the second complements the resulting bases, such that (A) becomes (T) and (C) becomes (G)
and vice versa. Therefore, GCATAA will become TTATGC [7]. The reverse complement of the
DNA strand bases is one of the main methods that characterize the biology DNA system. The
reverse complement method is composed of two stages. The first stage is the reverse which
means reverse the order of the DNA bases since the DNA strands of DNA sequences which hold
the bases are oriented such that they have two opposite sides known as 3’ end and 5’ end [8] .All
the processes that take place over DNA occurs from the 3' end to the 5' end, and verse versa,
accordingly, TTCA is distinct from ACTT. The second stage is the complement which is
comparable to the complement operation in binary code but within the letters rather than digits
Thus the reverse complement of AGCTTGAC is GTCAAGCT[9]. In this paper, the reverse
complement process will be used as inspiration for the new key-dependent ShiftRows
transformation.
3. THE PROPOSED METHOD
In this paper the proposed ShiftRows transformation will refer to as a key-dependent dynamic
transformation ( ).
The process is inspired by DNA-strands structures including its nature, orientation as
well as DNA-bases and reverse-complement process.
In this transformation the cipher key Kr at round r is used as key for applying the reverse-
complement over state bytes (byte level). This technique makes the byte transposition process
dynamic rather than static, depending on the Kr. Four specific bytes of Kr will be used to obtain
four values ranging between 0 and 3, in such a way that each single key value (N1, N4) is
obtained by one byte. According to key value the number of bytes that form the DNA-base will
be specified. Note that in this transformation the DNA-bases will be represented by a variable
number of bytes instead of two bits as previously. The key value (N1, N1) would specify the
number of bytes that form one DNA-base. The state STE is considered as four DNA-strands such
that each row forms one DNA-strand, but the number of DNA-bases that form each DNA-strand
differs depending on key value.
Every key (N1, N4) has four values, where each value represents the number of bytes for single
STE row (DNA-strand) that can be used to represent a single DNA base. The cases of key are
shown in Table 1,these values of the key will be used to specify the mechanism of byte level
4. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
82
Table 1: Transposition key values
reverse-complement of state rows, where a, b, c and, d are 4 bytes, representing a single row of
stat STE; note that a single row represents a single DNA-strand. Every DNA-base can be
represented by one, two or four bytes, according to the key values and after the representing is
done, the reverse-complement method is performed over the resulting DNA-bases. If every DNA-
base is formed by one byte (key value = 0) then the reverse complement will be achieved on the
state row in byte by byte level; however if one DNA-base is formed by two bytes (key value = 2)
then the reverse complement will be done on state row as every two bytes, Finally, if every DNA-
base is formed using four bytes (key value = 3) then the reverse-complement will be achieved on
the whole row as one part. There is only one case (key value =1) where there is no reverse but,
just complement for the state row. Note that each row has a unique key value as illustrated in
Figure 3
Figure 3. The state row transposition process depending on key
The whole method for the at round r using the key cipher Kr according to the process
described in Figure 3 is illustrated in Figure 4.
5. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
83
Figure 4. Key-dependent transposition inspired by DNA processes
4. TEST AND RESULT
4.1 Correlation coefficient
The correlation coefficient assumes values ranging between -1 and +1. According to [10] and
[11] the subsequent values are in an agreeable range for explicating the correlation coefficient as
declared in Table 2.Note that this paper considers the two variables of plaintext (p) and ciphertext
(c)
Table 2. Accepted range values for interpreting the correlation coefficient
The following equation describes the use of the correlation coefficients functions:
where: s is the total number of bits , , are the series of s measurements for p and c, p is bits
value of original bits or plaintext, c is bits value of change bits or ciphertext , E( c) is mathematic
expectation of c.
6. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
84
The variance of p can be represented within this equation:
Finally, the related coefficients can be described in this equation:
With a view to test the coefficient of block cipher, the experiment was separated into two
different types of testing which are:
Test on permutation transformation only.
Tests on all transformations of whole block cipher which used the proposed permutation
transformation.
4.1.1 Correlation coefficient on permutation transformation
To evaluate the diffusion property of the block cipher byte permutation, the experiment was
examined transformation in the AES block cipher. Figure 6 illustrates the laboratory
experiment process of correlation coefficient of the transformation in the AES block
cipher.
Figure 6. Laboratory experiment process of correlation coefficient function.
The analysis on the data from Table 3 is accomplished, in which the correlation value for the
plaintext before and after the function in the block cipher denoted as newT are recorded.
7. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
85
A scatter chart of the results is presented in Figure 7. It shows that there is no sequences from the
function in AES block recorded the correlation values between 0.7 and 1.0 which
indicates a weak positive (or negative) linear relationship. It also reported that 42 of 128
sequences from the function in AES block cipher recorded the correlation values between
0.3 and 0.7, which indicates that (32%) percentage of correlation has a moderate non-linear
relationship of the AES block cipher for transformation.
Table 3. Correlation test, r_xy of byte permutation function for sequence number 1- 128
8. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
86
Figure 7. Scatter chart of the correlation test results on function only
From the result analysis, it can deduce that this function has a good confusion performance
between the plaintext and the ciphertext. This infers that it has a good security.
4.1.2 Correlation coefficient on all transformations
The experiment examined all functions of the block cipher. The analyses of the data, in which
correlation value for round 1,2 and 3 for each sequence is recorded.
Scatter chart of the results is presented in Figure 8. It illustrates that the majority of correlation
values, at different rounds through the whole block cipher are near to 0, which indicates a strong
Figure 8.Scatter chart of the correlation test results on whole block cipher
positive (or negative) non-linear relationship. Only 0.007% is near to +1 or -1, in round 1,
representing a weak positive (or negative) non-linear relationship. From the results, it can be
inferred that the block cipher has an improved confusion performance.
9. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
87
4.2 NIST Suite Randomness test
The randomness test is one of the security analysis to measure the confusion and the diffusion
properties of the new encryption algorithm , as carried out in[12 – 14][15] and[16].
NIST Suite [17] is a statistical test suite for randomness by NIST used to assess the cryptography
algorithm. The suite test assesses whether the outputs of the algorithms under certain test
condition exhibits properties that would be expected randomly generated outputs.
In order to evaluate the randomness of ciphertext, an experiment that included a set of data as
random plaintext and random 16 byte key in the ECB mode was conducted. The 128 sequences of
1,059,584 bits were constructed and examined.
The proportion of sequences that passed a specific statistical test should lie above the proportion
value p, defined in Equation (4).
as:
where ∝ is the significant value, n is the number of tested sequences.
For this experiment, the proportion value is:
where n= 128, and ∝= 0.01.
The list of statistical tests applied throughout the experiments is illustrated in Table 4.
Table 4. Breakdown of 15 statistical tests applied during experimentation
10. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
88
The p-value readings for each round constructed is illustrated in Figure 9. This figure
demonstrates the randomness test for 15 statistical tests of block cipher that used the proposed
ShiftRows for the rounds 2 and 3, respectively. From this figure, at the end of the second and
third rounds, all of the 41 statistical tests fall over 96.3616%, which is evidence that the output
from the algorithm is completely random.
4.3 CRYPTANALYSIS
The new permutation transformation is dynamic and its changing at each round according to
round key-value this feature make the job more hard for the attackers since the analysis of
dynamic unit is more difficult than the static one. For the dynamic ShiftRows the attacker have
the possibility of which consider a high number, that increasing the resistance of the
algorithm against the attacks.
5. CONCLUSION
In this a new dynamic key-dependent permutation transformation was developed with chosen
byte from key and existing AES state. The new ShiftRows transformation is not fixed, but
changeable at each round according to the round key values. This permutation unit was tested
with the correlation coefficient and the 15 statistical randomness tests of NIST Test Suite.
Analyzing the results demonstrates that the characteristics of the new ShiftRows are more secure
and hard the job for attackers, on which concluded that it is potential to employ it for an
encryption. This will increases the stability of AES against linear and differential cryptanalysis.
An algorithm for designing this permutation transformation is proposed, as it is based on an
inspiration of biology DNA operations.
REFERENCES
[1] J. Daemen and V. Rijmen, "AES proposal: Rijndael," in First Advanced Encryption Standard (AES)
Conference, 1998.
[2] V. Rijmen and J. Daemen, "Advanced Encryption Standard," Proceedings of Federal Information
Processing Standards Publications, National Institute of Standards and Technology, pp. 19-22, 2001.
[3] L. Information Technology, Announcing the Advanced Encryption Standard (AES) [electronic
resource]. Gaithersburg, MD :: Computer Security Division, Information Technology Laboratory,
National Institute of Standards and Technology, 2001.
[4] G. Krishnamurthy and V. Ramaswamy, "Study of Effect of Removal of Shiftrows and Mixcolumns
Stages of AES and AES-KDS on their Encryption Quality and Hence Security."
[5] M. Zhang, et al., "A mathematical formulation of DNA computation," NanoBioscience, IEEE
Transactions on, vol. 5, pp. 32-40, 2006.
[6] M. Zhang, et al., "Interactive DNA sequence and structure design for DNA nanoapplications,"
NanoBioscience, IEEE Transactions on, vol. 3, pp. 286-292, 2004.
[7] E. R. Kandel, "The molecular biology of memory storage: a dialogue between genes and synapses,"
Science, vol. 294, pp. 1030-1038, 2001.
[8] G. I. Bell and D. C. Torney, "Repetitive DNA sequences: some considerations for simple sequence
repeats," Computers & chemistry, vol. 17, pp. 185-190, 1993.
[9] A. G. D'yachkov, et al., "Exordium for DNA codes," Journal of Combinatorial Optimization, vol. 7,
pp. 369-379, 2003.
[10] R. Taylor, "Interpretation of the correlation coefficient: a basic review," Journal of diagnostic medical
sonography, vol. 6, pp. 35-39, 1990.
[11] K. Wong, "Interpretation of correlation coefficients," Hong Kong Medical Journal, vol. 16, p. 237,
2010.
11. International Journal of Network Security & Its Applications (IJNSA) Vol.7, No.1, January 2015
89
[12] F. Sulak, et al., "Evaluation of randomness test results for short sequences," in Sequences and Their
Applications–SETA 2010, ed: Springer, 2010, pp. 309-319.
[13] Q. Zhou, et al., "True random number generator based on mouse movement and chaotic hash
function," information sciences, vol. 179, pp. 3442-3450, 2009.
[14] V. Patidar, et al., "A Pseudo Random Bit Generator Based on Chaotic Logistic Map and its Statistical
Testing," Informatica (03505596), vol. 33, 2009.
[15] J. Soto and L. Bassham, "Randomness testing of the advanced encryption standard finalist
candidates," DTIC Document2000.
[16] V. Katos, "A randomness test for block ciphers," Applied mathematics and computation, vol. 162, pp.
29-35, 2005.
[17] E. B. Smid, et al., "A Statistical Test Suite for Random and Pseudorandom Number Generators for
Cryptographic Applications."
Authors
Auday H.Al-Wattar obtained his B.Sc. degree in Computer Science from Mosul University
and his M.Sc. Degree from Technology University-Baghdad in 2005 .He presently pursing
his Ph.D. From Universiti Putra Malaysia, Malaysia under the guidance of Prof. Dr. Ramaln
bin Mahmod at Computer Science and Information Technology Faculty. He works as lecturer
at Mosul University (since 2005), at Computer Science and Mathematics Faculty - Computer Science
Department. His area of interest includes
Ramlan B Mahmod obtained his B.Sc. in computer Science, from Western Michigan,
University, U.S.A. in 1983, and M.Sc. degree in Computer science, from Central Michigan,
University, U.S.A. and Ph.D. degree in Artificial Intelligence from, Bradford University,
UK in 1994. His previous workings Experience/Position are as: System Analyst,
PETRONAS, 1979-1980. Lecturer, Mathematic Department, Faculty of Science, UPM,
1985-1994. Lecturer, Department of Multimedia, Faculty of Computer Science & Information
Technology, UPM, 1994 – 2002. Associate Professor, Department of Multimedia, Faculty of Computer
Science & Information Technology, UPM, 2002 – 2010. Deputy Dean, Faculty of Computer Science &
Information Technology, UPM, 1998 – Nov 2006. Dean, Faculty of Computer Science & Information
Technology, UPM, 2010-2013. Professor, Faculty of Computer Science & Information Technology, UPM,
2012 - now. His research interest includes Neural Network, Artificial Intelligence, Computer Security and
Image Processing.
Nur Izura binti Udzir obtained her B.Sc. in computer Science, from Universiti Pertanian
Malaysia, in 1995, and M.Sc. degree in Computer science, from Universiti Putra Malaysia,
in 1998, and Ph.D. degree in Computer Science from, University of York, UK in
2006.Associate Professor, Head Department of Computer Science, Faculty of Computer
Science & Information Technology, UPM. Her research interest includes Computer
security, secure operating systems, Access control, Distributed systems, Intrusion detection systems.
Zuriati Binti Ahmad Zukarnain obtained her B.Sc. in Physics,, from Universiti Putra
Malaysia, in 1997, and M.Sc. degree in Information Technology, from Universiti Putra
Malaysia, in 2000, and Ph.D. degree in Quantum Computation and Quantum Information
from, University of Bradford, UK, 2006,UK in 2006. Associate Professor, Department Of
Communication Technology and Networking, Faculty of Computer Science & Information
Technology, UPM. Her research interest includes information, computer and communication technology
(ICT), Quantum Information Systems and Distributed Systems, Quantum Computing, Computer Networks
and Distributed Computing