Abstract Cryptography is one of the prime techniques of secured symbolic data transmission over any communication channel. Security is the most challenging and essential aspects in today’s internet and network applications. Thus, design of a secure encryption algorithm is very necessary which can protect the unauthorized attacks. An encryption algorithm is computationally secure if it cannot be intruded with the standard resources. The algorithm proposed here is graph based. Its efficiency surpasses the standard DES algorithm in general. Graphs can be used for designing block ciphers, stream ciphers or public-key ciphers. The algorithm is graph automorphism based partial symmetric key algorithm and it is not fully depended on secret key and produces different cipher text by applying same key on the same plain text. Keywords: DES, Graph Automorphism, Hamiltonian Cycle, Encryption, Decryption
Block cipher encryption for text to-image algorithmIAEME Publication
This document describes a proposed Block-Cipher Text-to-Image (B-TTIE) encryption algorithm. It begins with an abstract discussing encrypting data during client-server communication to protect from hackers. It then provides background on encryption/decryption techniques like private key cryptography. The document proposes dividing text into blocks, encrypting each block into a separate PNG image using an individual key, improving on a previous Text-to-Image encryption algorithm. It discusses related work in text/character encryption and distinguishes the B-TTIE approach.
Abstract
In the infancy of Cryptography Mono-alphabetic Substitution Ciphers were considered good enough to baffle any potential attackers but with the advancements in technology & the upsurge of computing power those methods have become trivial. Even the very complex methods of encryption are vulnerable to the brute force attacks of contemporary computers and with Quantum computing on the horizon even the current state of the art cryptosystems are at risk. Lots of research is being done and every possible field is being explored in order to create that elusive unbreakable cipher. Among other subjects, Geometry is also being applied and various ciphers based on the properties of different geometrical figures have been developed. This paper ventures to investigate the recent research applying the concept of geometry to boost the caliber of pre-existing cryptosystems enhance the understanding of the subject.
Keywords: Cryptography, Geometry, Encryption, Decryption, ECC, Circle, Chakra, Ellipse, Hyperbola, HCCS
Simulated Analysis and Enhancement of Blowfish Algorithmiosrjce
This paper represents or analyzes the security of system based on Blowfish. Blowfish mainly focuses
on the encrypt and decrypt techniques and algorithms apply for cryptanalysis. It describe the algorithms for
encryption as well as decryption algorithms and also give the sufficient description of key generation, key
expansion, function and working principle of Blowfish cipher with proper explanations. Taking the current era,
Most of the famous systems which offer security for a network or web or to a data are vulnerability to attacks and
they are broken at some point of time by effective cryptanalysis methods, irrespective of its complex algorithmic
design. In the general, today’s cryptography world is bounded to an interpretive of following any one or multi
encryption scheme and that too for a single iteration on a single file only. This is evident in the maximum of the
encryption-decryption cases. It also describes the comparisons between older blowfish and enhances blowfish. It
also shows enhance Blowfish algorithm for encryption and decryption of data. It is also give the proper simulated
analysis of encryption and decryption time for different file formats using a windows application. It describe
feature of application and its process and efficiency as well as calculation of time and throughput.
This document summarizes public key cryptography and asymmetric encryption algorithms. It discusses how public key cryptography uses two different but mathematically related keys, a public key for encryption and a private key for decryption. The public key can be shared openly, while the private key is kept secret by the recipient. It also describes how asymmetric algorithms are slower than symmetric algorithms but allow anyone to encrypt messages for a recipient using their public key, with only the recipient able to decrypt it with their private key. Examples of asymmetric algorithms discussed include RSA.
IRJET-Triple Layered Security on Android Based SMS TransactionIRJET Journal
The document proposes a triple layer encryption technique for SMS on Android that securely encrypts messages. The technique applies bit manipulation, hill cipher encryption, and AES encryption sequentially to the SMS. At each stage of encryption, the output is converted to a new format before the next technique is applied. For decryption, the process is reversed, applying AES decryption first before hill cipher decryption and bit manipulation to recover the original SMS message. The technique aims to provide robust security for SMS transactions by encrypting data multiple times with different algorithms.
Comparative Study of Cryptography Algorithms and Its’ ApplicationsMahmudJion
In modern world, security is the most valuable term in the field of communication system. Security comes
along with many technologies and methods, where one of the most secure technologies is Cryptography
where ordinary plain text is converted into cipher text for transferring data to the valid user. Cryptography
algorithms can be divided into two types based on the number of keys such as Symmetric and Asymmetric
where Symmetric algorithm works with one single key and Asymmetric algorithm works with two different
keys. However, selecting the appropriate algorithms for specific application has been always a challenging
task because of the latency, key size, and security issues. Cryptographic algorithms face different type of
attacks like brute force attack, man in the middle attack, cycle attacks etc., which are still remained as
threads. This paper presents the performance analysis, based on different performance metrics and threads,
of various techniques of cryptographic algorithms and identifies the suitable algorithms for different types
of applications.
A new hybrid text encryption approach over mobile ad hoc network IJECEIAES
This document summarizes a research paper that proposes a new hybrid text encryption approach combining elliptic curve cryptography and the Hill cipher algorithm for use on mobile ad hoc networks. The approach aims to address security weaknesses in the Hill cipher by converting it from a symmetric to an asymmetric technique. It generates public and private keys using elliptic curve cryptography so the secret key does not need to be shared over unsecured channels. The approach also allows direct encryption and decryption of characters from the full 128-character ASCII table using their numeric values, avoiding the need for a character mapping table. The advantages are seen as improved security, efficiency and faster computation compared to other techniques.
New modification on feistel DES algorithm based on multi-level keys IJECEIAES
The data encryption standard (DES) is one of the most common symmetric encryption algorithms, but it experiences many problems. For example, it uses only one function (XOR) in the encryption process, and the combination of data is finite because it occurs only twice and operates on bits. This paper presents a new modification of the DES to overcome these problems. This could be done through adding a new level of security by increasing the key space (using three keys) during the 16 rounds of the standard encryption algorithm and by replacing the predefined XOR operation with a new # operation. Our proposed algorithm uses three keys instead of one. The first key is the input key used for encrypting and decrypting operations. The second key is used for determining the number of bits, while the third key is used for determining the table numbers, which are from 0 to 255. Having evaluated the complexity of our proposed algorithm, the results show that it is the most complex compared with the well-known DES and other modified algorithms. Consequently, in our proposed algorithm, the attacker try a number of attempts 2 1173 at minimum to decrypt the message. This means that the proposed DES algorithm will increase the security level of the well-known DES.
Block cipher encryption for text to-image algorithmIAEME Publication
This document describes a proposed Block-Cipher Text-to-Image (B-TTIE) encryption algorithm. It begins with an abstract discussing encrypting data during client-server communication to protect from hackers. It then provides background on encryption/decryption techniques like private key cryptography. The document proposes dividing text into blocks, encrypting each block into a separate PNG image using an individual key, improving on a previous Text-to-Image encryption algorithm. It discusses related work in text/character encryption and distinguishes the B-TTIE approach.
Abstract
In the infancy of Cryptography Mono-alphabetic Substitution Ciphers were considered good enough to baffle any potential attackers but with the advancements in technology & the upsurge of computing power those methods have become trivial. Even the very complex methods of encryption are vulnerable to the brute force attacks of contemporary computers and with Quantum computing on the horizon even the current state of the art cryptosystems are at risk. Lots of research is being done and every possible field is being explored in order to create that elusive unbreakable cipher. Among other subjects, Geometry is also being applied and various ciphers based on the properties of different geometrical figures have been developed. This paper ventures to investigate the recent research applying the concept of geometry to boost the caliber of pre-existing cryptosystems enhance the understanding of the subject.
Keywords: Cryptography, Geometry, Encryption, Decryption, ECC, Circle, Chakra, Ellipse, Hyperbola, HCCS
Simulated Analysis and Enhancement of Blowfish Algorithmiosrjce
This paper represents or analyzes the security of system based on Blowfish. Blowfish mainly focuses
on the encrypt and decrypt techniques and algorithms apply for cryptanalysis. It describe the algorithms for
encryption as well as decryption algorithms and also give the sufficient description of key generation, key
expansion, function and working principle of Blowfish cipher with proper explanations. Taking the current era,
Most of the famous systems which offer security for a network or web or to a data are vulnerability to attacks and
they are broken at some point of time by effective cryptanalysis methods, irrespective of its complex algorithmic
design. In the general, today’s cryptography world is bounded to an interpretive of following any one or multi
encryption scheme and that too for a single iteration on a single file only. This is evident in the maximum of the
encryption-decryption cases. It also describes the comparisons between older blowfish and enhances blowfish. It
also shows enhance Blowfish algorithm for encryption and decryption of data. It is also give the proper simulated
analysis of encryption and decryption time for different file formats using a windows application. It describe
feature of application and its process and efficiency as well as calculation of time and throughput.
This document summarizes public key cryptography and asymmetric encryption algorithms. It discusses how public key cryptography uses two different but mathematically related keys, a public key for encryption and a private key for decryption. The public key can be shared openly, while the private key is kept secret by the recipient. It also describes how asymmetric algorithms are slower than symmetric algorithms but allow anyone to encrypt messages for a recipient using their public key, with only the recipient able to decrypt it with their private key. Examples of asymmetric algorithms discussed include RSA.
IRJET-Triple Layered Security on Android Based SMS TransactionIRJET Journal
The document proposes a triple layer encryption technique for SMS on Android that securely encrypts messages. The technique applies bit manipulation, hill cipher encryption, and AES encryption sequentially to the SMS. At each stage of encryption, the output is converted to a new format before the next technique is applied. For decryption, the process is reversed, applying AES decryption first before hill cipher decryption and bit manipulation to recover the original SMS message. The technique aims to provide robust security for SMS transactions by encrypting data multiple times with different algorithms.
Comparative Study of Cryptography Algorithms and Its’ ApplicationsMahmudJion
In modern world, security is the most valuable term in the field of communication system. Security comes
along with many technologies and methods, where one of the most secure technologies is Cryptography
where ordinary plain text is converted into cipher text for transferring data to the valid user. Cryptography
algorithms can be divided into two types based on the number of keys such as Symmetric and Asymmetric
where Symmetric algorithm works with one single key and Asymmetric algorithm works with two different
keys. However, selecting the appropriate algorithms for specific application has been always a challenging
task because of the latency, key size, and security issues. Cryptographic algorithms face different type of
attacks like brute force attack, man in the middle attack, cycle attacks etc., which are still remained as
threads. This paper presents the performance analysis, based on different performance metrics and threads,
of various techniques of cryptographic algorithms and identifies the suitable algorithms for different types
of applications.
A new hybrid text encryption approach over mobile ad hoc network IJECEIAES
This document summarizes a research paper that proposes a new hybrid text encryption approach combining elliptic curve cryptography and the Hill cipher algorithm for use on mobile ad hoc networks. The approach aims to address security weaknesses in the Hill cipher by converting it from a symmetric to an asymmetric technique. It generates public and private keys using elliptic curve cryptography so the secret key does not need to be shared over unsecured channels. The approach also allows direct encryption and decryption of characters from the full 128-character ASCII table using their numeric values, avoiding the need for a character mapping table. The advantages are seen as improved security, efficiency and faster computation compared to other techniques.
New modification on feistel DES algorithm based on multi-level keys IJECEIAES
The data encryption standard (DES) is one of the most common symmetric encryption algorithms, but it experiences many problems. For example, it uses only one function (XOR) in the encryption process, and the combination of data is finite because it occurs only twice and operates on bits. This paper presents a new modification of the DES to overcome these problems. This could be done through adding a new level of security by increasing the key space (using three keys) during the 16 rounds of the standard encryption algorithm and by replacing the predefined XOR operation with a new # operation. Our proposed algorithm uses three keys instead of one. The first key is the input key used for encrypting and decrypting operations. The second key is used for determining the number of bits, while the third key is used for determining the table numbers, which are from 0 to 255. Having evaluated the complexity of our proposed algorithm, the results show that it is the most complex compared with the well-known DES and other modified algorithms. Consequently, in our proposed algorithm, the attacker try a number of attempts 2 1173 at minimum to decrypt the message. This means that the proposed DES algorithm will increase the security level of the well-known DES.
Multiple Encryption using ECC and Its Time Complexity AnalysisIJCERT
Rapid growth of information technology in present era, secure communication, strong data encryption technique and trusted third party are considered to be major topics of study. Robust encryption algorithm development to secure sensitive data is of great significance among researchers at present. The conventional methods of encryption used as of today may not sufficient and therefore new ideas for the purpose are to be design, analyze and need to be fit into the existing system of security to provide protection of our data from unauthorized access. An effective encryption/ decryption algorithm design to enhance data security is a challenging task while computation, complexity, robustness etc. are concerned. The multiple encryption technique is a process of applying encryption over a single encryption process in a number of iteration. Elliptic Curve Cryptography (ECC) is well known and well accepted cryptographic algorithm and used in many application as of today. In this paper, we discuss multiple encryptions and analyze the computation overhead in the process and study the feasibility of practical application. In the process we use ECC as a multiple-ECC algorithm and try to analyze degree of security, encryption/decryption computation time and complexity of the algorithm. Performance measure of the algorithm is evaluated by analyzing encryption time as well as decryption time in single ECC as well as multiple-ECC are compared with the help of various examples.
Secure E-voting System by Utilizing Homomorphic Properties of the Encryption ...TELKOMNIKA JOURNAL
The use of cryptography in the e-voting system to secure data is a must to ensure the authenticity
of the data. In contrast to common encryption algorithms, homomorphic encryption algorithms had unique
properties that can perform mathematical operations against ciphertext. This paper proposed the use of
the Paillier and Okamoto-Uchiyama algorithms as two homomorphic encryption algorithms that have the
additional properties so that it can calculate the results of voting data that has been encrypted without
having to be decrypted first. The main purpose is to avoid manipulation and data falsification during vote
tallying process by comparing the advantages and disadvantages of each algorithm.
Features of genetic algorithm for plain text encryption IJECEIAES
The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed processing.
Comparative Analysis of Cryptographic Algorithms and Advanced Cryptographic A...editor1knowledgecuddle
Today is the era of Internet and networks applications. So,Information security is a challenging issue in today’s technological world. There is a demand for a stronger encryption which is very hard to crack. The role of Cryptography is most important in the field of network security. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures
communication. In this study is made for the cryptography algorithms, particularly algorithms- AES, DES, RSA, Blowfishare compared and performance is evaluated. Also some enhanced algorithms are described and compared with the enhanced algorithms.
Keywords - AES, DES, BLOWFISH, Decryption, Encryption, Security
Design and Implementation of New Encryption algorithm to Enhance Performance...IOSR Journals
This document summarizes a research paper that proposes a new encryption algorithm to improve performance parameters. The algorithm is divided into two phases. Phase 1 involves reversing, swapping, circularly shifting bits of the plaintext and XORing with the key. Phase 2 divides the output into blocks, then recombines the left bits of each block. The paper analyzes avalanche effect and execution time of the proposed algorithm compared to existing algorithms to evaluate its performance. The results show better performance than existing algorithms.
ASCII Value Based Encryption System (AVB)IJERA Editor
Encryption and decryption are considered to be the guard for data in this technological world. To provide some
kind of security, this paper proposes a new algorithm called AVB algorithm which is used to enhance the
security of the data. This algorithm mainly focuses on ASCII value of data. ASCII value of the character is
encrypted using normal mathematical calculation for number of time on a particular character and converted to
numerical value. Then the cipher text is decrypted to get the original plain text. This algorithm is efficient in two
ways it difficult for the intruders to predict the data as each character follows different form of encryption based
on the key. And also it is simple, fast, and cost efficient while compared to ASCII value based text encryption
system by Udepal Singh and Upasna Garg
The document proposes a coding method as an alternative to encryption for providing security. It builds a coding table based on ASCII that assigns codes to common words, characters, and symbols in a way that eliminates frequency analysis. The method encodes text by looking up words and characters in the table and adding an encoded word count at the end for verification. This coding approach aims to provide security while saving time and effort compared to encryption methods.
Security in Manets using Cryptography AlgorithmsIRJET Journal
This document discusses security in mobile ad hoc networks (MANETs) using cryptography algorithms. It proposes a novel approach for effective key management and prevention of malicious nodes in MANETs. The approach incorporates security to the routing protocol using traditional SHA algorithm along with symmetric (AES) and asymmetric (RSA) key encryption methods. It analyzes the performance of the proposed algorithms by comparing the time taken to transfer data, communication overheads, and battery consumption. The results show that using AES with SHA provides better performance than using RSA with SHA, as RSA consumption more time and battery due to its large prime number calculations and operations.
IRJET - Hash Functions and its Security for SnagsIRJET Journal
This document provides an overview of cryptographic hash functions, including their structure, properties, and selections in previous research projects. It discusses the Merkle-Damgard and sponge constructions commonly used to design hash functions. The document also summarizes the hash functions evaluated and selected in the NESSIE and CRYPTREC projects, such as Whirlpool, SHA-256, and SHA-512 in NESSIE and MD5, RIPEMD-160, and SHA-1 in CRYPTREC.
Cryptosystem Based on Modified Vigenere Cipher using Encryption Techniqueijtsrd
In this new era of technology securing information in internet has become a crucial task. To secure such information, encryption plays an important role in information security. In this paper Vigenere cipher is considered which is to be most efficient and simplest one. Due to its repeating nature, it is vulnerable to attacks like Kasiski, known plain text etc., to find the length of encryption key. To overcome this, this research present a modified algorithm encryption technique is done by using Vigenere cipher to improve better security against cryptanalysis. Vittal Kumar Mittal | Manish Mukhija "Cryptosystem Based on Modified Vigenere Cipher using Encryption Technique" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27878.pdfPaper URL: https://www.ijtsrd.com/computer-science/other/27878/cryptosystem-based-on-modified-vigenere-cipher-using-encryption-technique/vittal-kumar-mittal
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.
Performance Evaluation of Message Security Using Fractal Sieve with MMDijsptm
In this paper we measure the performance of proposed approach, message security using Fractal Sieve with Modified Message Digest with respect to response time and time complexity. In this method the authentication of the message is protected by the hash function MMD. The response time of the algorithm is implemented in java is calculated with user load and the different sizes of the data files. The results are compared with the performance measurements of Priya Dhawan and Aamer Nadeem and found to be efficient.
An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3
Abstract: Information is an important commodity in the world of Electronic communication. To achieve a secure communication between communicating parties, the protection of authenticity and integrity of information is necessary. Cryptographic hash functions play a central role in cryptology. A cryptographic hash function takes an input of arbitrary large size and returns a small fixed size hash value. It satisfies three major cryptographic properties: preimage resistance, second preimage resistance and collision resistance. Due to its cryptographic properties hash function has become an important cryptographic tool which is used to protect information authenticity and integrity. This thesis presents a review of cryptographic hash functions. The thesis includes various applications of hash functions. It gives special emphasis on dedicated hash functions MD5.
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD. So the purpose of this thesis is combination of some function to reinforce these functions and also increasing hash code of message digest of length up to 160 that makes stronger algorithm against collision and brute force attacks.
Highly secure scalable compression of encrypted imageseSAT Journals
Abstract A highly secure scalable compression method for stream cipher encrypted images is described in this journal. The input image first undergoes encryption and then shuffling. This shuffling in the image pixels enhances the security. For shuffling, Henon map is used. There are two layers for the scalable compression namely base layer and enhancement layer. Base layer bits are produced by coding a series of non-overlapping patches of uniformly down sampled version of encrypted image. In the enhancement layer pixels are selected by random permutation and then coded. From all the available pixel samples an iterative multi scale technique is used to reconstruct the image and finally performs decryption. The proposed method has high security. Key Words: Encryption, Decryption, Shuffling, Scalable compression
A Novel Structure with Dynamic Operation Mode for Symmetric-Key Block CiphersIJNSA Journal
Modern Internet protocols support several modes of operation in encryption tasks for data confidentiality
to keep up with varied environments and provide the various choices, such as multi-mode IPSec support.
To begin with we will provide a brief background on the modes of operation for symmetric-key block
ciphers. Different block cipher modes of operation have distinct characteristics. For example, the cipher
block chaining (CBC) mode is suitable for operating environments that require self-synchronizing
capabilities, and the output feedback (OFB) mode requires encryption modules only. When using
symmetric-key block cipher algorithms such as the Advanced Encryption Standard (AES), users
performing information encryption often encounter difficulties selecting a suitable mode of operation.
This paper describes a structure for analyzing the block operation mode combination. This unified
operation structure (UOS) combines existing common and popular block modes of operation. UOS does
multi-mode of operation with most existing popular symmetric-key block ciphers and do not only consist
of encryption mode such as electronic codebook (ECB) mode, cipher block chaining (CBC) mode, cipher
feedback (CFB) mode and output feedback (OFB) mode, that provides confidentiality but also message
authentication mode such as the cipher block chaining message authentication code (CBC-MAC) in
cryptography. In Cloud Computing, information exchange frequently via the Internet and on-demand.
This research provides an overview and information useful for approaching low-resource hardware
implementation, which is proper to ubiquitous computing devices such as a sensor mote or an RFID tag.
The use of the method is discussed and an example is given. This provides a common solution for multimode and this is very suitable for ubiquitous computing with several resources and environments. This
study indicates a more effectively organized structure for symmetric-key block ciphers to improve their
application scenarios. We can get that it is flexible in modern communication applications.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A New Method for Encrypting Digital Data Using Symmetric Key in Information E...Editor IJCATR
with the arrival of the information age and much more important information systems and communication in human
everyday life, necessity immunization information and communication strategy were also raised. The easiest way to meet this
necessity is conventional encryption algorithms. Encryption is a right tool for data protection in an unsecure channel. To this end, from
two-method symmetric key encryption and public-key cryptography are used. In this paper we examine text cryptography, one of the
most important topics in cryptography. A unique attribute of this kind of encryption has been of interest to many researchers in this
field. This paper, considering the symmetric encryption algorithm, provides a text encryption algorithm using a 128-bit key. The
proposed algorithm uses a 128-bit key, the text data using the XOR operator to convert the encrypted information. Therefore, the aim
of this method is to provide a convenient method for symmetrically encrypting data not to be easily decoded, and finally, the results of
the tests show that the proposed method is better in terms of security and speed of execution
With increasing technology development in field of communication and Electronic devices, there is a need for better security service for information transfer in Medical Sectors, Banking, Financial and in other IoT applications etc. Fight against security attacks is of prime importance. Through Cryptographic techniques we can provide Authenticity as well as Confidentiality for the user data. In this paper, hardware implementation has been described for a real-time application of speech data encryption and decryption using AES algorithm along with the speech recognition using cross correlation technique. Verilog programming environment is used for AES cryptography whereas MATLAB is used for Speech recognition. ASIC design on AES core is implemented using Cadence tools. Number of gates, area and power used by AES core design has been drastically reduced by specifying wide range of constraints during front end designing. In Backend designing, layout of AES design, which is the physical geometric representation is also developed.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Comparative study of private and public key cryptography algorithms a surveyeSAT Publishing House
The document provides a comparison of private key cryptography (such as DES) and public key cryptography (such as RSA). It discusses the basic concepts and processes of cryptography including encryption, decryption, keys, cryptanalysis etc. It then describes the DES and RSA algorithms in detail and compares them based on factors like message length, speed, security, vulnerabilities etc. The document concludes that private key algorithms are faster but public key algorithms provide higher security and additional services like non-repudiation.
Survey: Elliptic Curve Cryptography using Scalar Multiplication AlgorithmsAM Publications
This document summarizes an article from the International Journal of Innovative Research in Advanced Engineering that discusses elliptic curve cryptography and scalar multiplication algorithms. It begins with an introduction to elliptic curve cryptography and some of its applications. It then provides mathematical background on elliptic curves and discusses elliptic curve digital signature algorithm, elliptic curve Diffie-Hellman, and elliptic curve integrated encryption scheme. The document focuses on various algorithms for elliptic curve scalar multiplication, including non-adjacent form representation, and compares their features to determine the most efficient algorithm.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Multiple Encryption using ECC and Its Time Complexity AnalysisIJCERT
Rapid growth of information technology in present era, secure communication, strong data encryption technique and trusted third party are considered to be major topics of study. Robust encryption algorithm development to secure sensitive data is of great significance among researchers at present. The conventional methods of encryption used as of today may not sufficient and therefore new ideas for the purpose are to be design, analyze and need to be fit into the existing system of security to provide protection of our data from unauthorized access. An effective encryption/ decryption algorithm design to enhance data security is a challenging task while computation, complexity, robustness etc. are concerned. The multiple encryption technique is a process of applying encryption over a single encryption process in a number of iteration. Elliptic Curve Cryptography (ECC) is well known and well accepted cryptographic algorithm and used in many application as of today. In this paper, we discuss multiple encryptions and analyze the computation overhead in the process and study the feasibility of practical application. In the process we use ECC as a multiple-ECC algorithm and try to analyze degree of security, encryption/decryption computation time and complexity of the algorithm. Performance measure of the algorithm is evaluated by analyzing encryption time as well as decryption time in single ECC as well as multiple-ECC are compared with the help of various examples.
Secure E-voting System by Utilizing Homomorphic Properties of the Encryption ...TELKOMNIKA JOURNAL
The use of cryptography in the e-voting system to secure data is a must to ensure the authenticity
of the data. In contrast to common encryption algorithms, homomorphic encryption algorithms had unique
properties that can perform mathematical operations against ciphertext. This paper proposed the use of
the Paillier and Okamoto-Uchiyama algorithms as two homomorphic encryption algorithms that have the
additional properties so that it can calculate the results of voting data that has been encrypted without
having to be decrypted first. The main purpose is to avoid manipulation and data falsification during vote
tallying process by comparing the advantages and disadvantages of each algorithm.
Features of genetic algorithm for plain text encryption IJECEIAES
The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed processing.
Comparative Analysis of Cryptographic Algorithms and Advanced Cryptographic A...editor1knowledgecuddle
Today is the era of Internet and networks applications. So,Information security is a challenging issue in today’s technological world. There is a demand for a stronger encryption which is very hard to crack. The role of Cryptography is most important in the field of network security. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures
communication. In this study is made for the cryptography algorithms, particularly algorithms- AES, DES, RSA, Blowfishare compared and performance is evaluated. Also some enhanced algorithms are described and compared with the enhanced algorithms.
Keywords - AES, DES, BLOWFISH, Decryption, Encryption, Security
Design and Implementation of New Encryption algorithm to Enhance Performance...IOSR Journals
This document summarizes a research paper that proposes a new encryption algorithm to improve performance parameters. The algorithm is divided into two phases. Phase 1 involves reversing, swapping, circularly shifting bits of the plaintext and XORing with the key. Phase 2 divides the output into blocks, then recombines the left bits of each block. The paper analyzes avalanche effect and execution time of the proposed algorithm compared to existing algorithms to evaluate its performance. The results show better performance than existing algorithms.
ASCII Value Based Encryption System (AVB)IJERA Editor
Encryption and decryption are considered to be the guard for data in this technological world. To provide some
kind of security, this paper proposes a new algorithm called AVB algorithm which is used to enhance the
security of the data. This algorithm mainly focuses on ASCII value of data. ASCII value of the character is
encrypted using normal mathematical calculation for number of time on a particular character and converted to
numerical value. Then the cipher text is decrypted to get the original plain text. This algorithm is efficient in two
ways it difficult for the intruders to predict the data as each character follows different form of encryption based
on the key. And also it is simple, fast, and cost efficient while compared to ASCII value based text encryption
system by Udepal Singh and Upasna Garg
The document proposes a coding method as an alternative to encryption for providing security. It builds a coding table based on ASCII that assigns codes to common words, characters, and symbols in a way that eliminates frequency analysis. The method encodes text by looking up words and characters in the table and adding an encoded word count at the end for verification. This coding approach aims to provide security while saving time and effort compared to encryption methods.
Security in Manets using Cryptography AlgorithmsIRJET Journal
This document discusses security in mobile ad hoc networks (MANETs) using cryptography algorithms. It proposes a novel approach for effective key management and prevention of malicious nodes in MANETs. The approach incorporates security to the routing protocol using traditional SHA algorithm along with symmetric (AES) and asymmetric (RSA) key encryption methods. It analyzes the performance of the proposed algorithms by comparing the time taken to transfer data, communication overheads, and battery consumption. The results show that using AES with SHA provides better performance than using RSA with SHA, as RSA consumption more time and battery due to its large prime number calculations and operations.
IRJET - Hash Functions and its Security for SnagsIRJET Journal
This document provides an overview of cryptographic hash functions, including their structure, properties, and selections in previous research projects. It discusses the Merkle-Damgard and sponge constructions commonly used to design hash functions. The document also summarizes the hash functions evaluated and selected in the NESSIE and CRYPTREC projects, such as Whirlpool, SHA-256, and SHA-512 in NESSIE and MD5, RIPEMD-160, and SHA-1 in CRYPTREC.
Cryptosystem Based on Modified Vigenere Cipher using Encryption Techniqueijtsrd
In this new era of technology securing information in internet has become a crucial task. To secure such information, encryption plays an important role in information security. In this paper Vigenere cipher is considered which is to be most efficient and simplest one. Due to its repeating nature, it is vulnerable to attacks like Kasiski, known plain text etc., to find the length of encryption key. To overcome this, this research present a modified algorithm encryption technique is done by using Vigenere cipher to improve better security against cryptanalysis. Vittal Kumar Mittal | Manish Mukhija "Cryptosystem Based on Modified Vigenere Cipher using Encryption Technique" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27878.pdfPaper URL: https://www.ijtsrd.com/computer-science/other/27878/cryptosystem-based-on-modified-vigenere-cipher-using-encryption-technique/vittal-kumar-mittal
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.
Performance Evaluation of Message Security Using Fractal Sieve with MMDijsptm
In this paper we measure the performance of proposed approach, message security using Fractal Sieve with Modified Message Digest with respect to response time and time complexity. In this method the authentication of the message is protected by the hash function MMD. The response time of the algorithm is implemented in java is calculated with user load and the different sizes of the data files. The results are compared with the performance measurements of Priya Dhawan and Aamer Nadeem and found to be efficient.
An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3
Abstract: Information is an important commodity in the world of Electronic communication. To achieve a secure communication between communicating parties, the protection of authenticity and integrity of information is necessary. Cryptographic hash functions play a central role in cryptology. A cryptographic hash function takes an input of arbitrary large size and returns a small fixed size hash value. It satisfies three major cryptographic properties: preimage resistance, second preimage resistance and collision resistance. Due to its cryptographic properties hash function has become an important cryptographic tool which is used to protect information authenticity and integrity. This thesis presents a review of cryptographic hash functions. The thesis includes various applications of hash functions. It gives special emphasis on dedicated hash functions MD5.
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD. So the purpose of this thesis is combination of some function to reinforce these functions and also increasing hash code of message digest of length up to 160 that makes stronger algorithm against collision and brute force attacks.
Highly secure scalable compression of encrypted imageseSAT Journals
Abstract A highly secure scalable compression method for stream cipher encrypted images is described in this journal. The input image first undergoes encryption and then shuffling. This shuffling in the image pixels enhances the security. For shuffling, Henon map is used. There are two layers for the scalable compression namely base layer and enhancement layer. Base layer bits are produced by coding a series of non-overlapping patches of uniformly down sampled version of encrypted image. In the enhancement layer pixels are selected by random permutation and then coded. From all the available pixel samples an iterative multi scale technique is used to reconstruct the image and finally performs decryption. The proposed method has high security. Key Words: Encryption, Decryption, Shuffling, Scalable compression
A Novel Structure with Dynamic Operation Mode for Symmetric-Key Block CiphersIJNSA Journal
Modern Internet protocols support several modes of operation in encryption tasks for data confidentiality
to keep up with varied environments and provide the various choices, such as multi-mode IPSec support.
To begin with we will provide a brief background on the modes of operation for symmetric-key block
ciphers. Different block cipher modes of operation have distinct characteristics. For example, the cipher
block chaining (CBC) mode is suitable for operating environments that require self-synchronizing
capabilities, and the output feedback (OFB) mode requires encryption modules only. When using
symmetric-key block cipher algorithms such as the Advanced Encryption Standard (AES), users
performing information encryption often encounter difficulties selecting a suitable mode of operation.
This paper describes a structure for analyzing the block operation mode combination. This unified
operation structure (UOS) combines existing common and popular block modes of operation. UOS does
multi-mode of operation with most existing popular symmetric-key block ciphers and do not only consist
of encryption mode such as electronic codebook (ECB) mode, cipher block chaining (CBC) mode, cipher
feedback (CFB) mode and output feedback (OFB) mode, that provides confidentiality but also message
authentication mode such as the cipher block chaining message authentication code (CBC-MAC) in
cryptography. In Cloud Computing, information exchange frequently via the Internet and on-demand.
This research provides an overview and information useful for approaching low-resource hardware
implementation, which is proper to ubiquitous computing devices such as a sensor mote or an RFID tag.
The use of the method is discussed and an example is given. This provides a common solution for multimode and this is very suitable for ubiquitous computing with several resources and environments. This
study indicates a more effectively organized structure for symmetric-key block ciphers to improve their
application scenarios. We can get that it is flexible in modern communication applications.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A New Method for Encrypting Digital Data Using Symmetric Key in Information E...Editor IJCATR
with the arrival of the information age and much more important information systems and communication in human
everyday life, necessity immunization information and communication strategy were also raised. The easiest way to meet this
necessity is conventional encryption algorithms. Encryption is a right tool for data protection in an unsecure channel. To this end, from
two-method symmetric key encryption and public-key cryptography are used. In this paper we examine text cryptography, one of the
most important topics in cryptography. A unique attribute of this kind of encryption has been of interest to many researchers in this
field. This paper, considering the symmetric encryption algorithm, provides a text encryption algorithm using a 128-bit key. The
proposed algorithm uses a 128-bit key, the text data using the XOR operator to convert the encrypted information. Therefore, the aim
of this method is to provide a convenient method for symmetrically encrypting data not to be easily decoded, and finally, the results of
the tests show that the proposed method is better in terms of security and speed of execution
With increasing technology development in field of communication and Electronic devices, there is a need for better security service for information transfer in Medical Sectors, Banking, Financial and in other IoT applications etc. Fight against security attacks is of prime importance. Through Cryptographic techniques we can provide Authenticity as well as Confidentiality for the user data. In this paper, hardware implementation has been described for a real-time application of speech data encryption and decryption using AES algorithm along with the speech recognition using cross correlation technique. Verilog programming environment is used for AES cryptography whereas MATLAB is used for Speech recognition. ASIC design on AES core is implemented using Cadence tools. Number of gates, area and power used by AES core design has been drastically reduced by specifying wide range of constraints during front end designing. In Backend designing, layout of AES design, which is the physical geometric representation is also developed.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Comparative study of private and public key cryptography algorithms a surveyeSAT Publishing House
The document provides a comparison of private key cryptography (such as DES) and public key cryptography (such as RSA). It discusses the basic concepts and processes of cryptography including encryption, decryption, keys, cryptanalysis etc. It then describes the DES and RSA algorithms in detail and compares them based on factors like message length, speed, security, vulnerabilities etc. The document concludes that private key algorithms are faster but public key algorithms provide higher security and additional services like non-repudiation.
Survey: Elliptic Curve Cryptography using Scalar Multiplication AlgorithmsAM Publications
This document summarizes an article from the International Journal of Innovative Research in Advanced Engineering that discusses elliptic curve cryptography and scalar multiplication algorithms. It begins with an introduction to elliptic curve cryptography and some of its applications. It then provides mathematical background on elliptic curves and discusses elliptic curve digital signature algorithm, elliptic curve Diffie-Hellman, and elliptic curve integrated encryption scheme. The document focuses on various algorithms for elliptic curve scalar multiplication, including non-adjacent form representation, and compares their features to determine the most efficient algorithm.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
SYMMETRIC-KEY BASED PRIVACYPRESERVING SCHEME FOR MINING SUPPORT COUNTSacijjournal
In this paper we study the problem of mining support counts using symmetric-key crypto which is more
efficient than previous work. Consider a scenario that each user has an option (like or unlike) of the
specified product, and a third party wants to obtain the popularity of this product. We design a much more
efficient privacy-preserving scheme for users to prevent the loss of the personal interests. Unlike most
previous works, we do not use any exponential or modular algorithms, but we provide a symmetric-key
based method which can also protect the information. Specifically, our protocol uses a third party that
generates a number of matrixes as each user’s key. Then user uses these key to encrypt their data which is
more efficient to obtain the support counts of a given pattern.
Symmetric-Key Based Privacy-Preserving Scheme For Mining Support Countsacijjournal
In this paper we study the problem of mining support counts using symmetric-key crypto which is more
efficient than previous work. Consider a scenario that each user has an option (like or unlike) of the
specified product, and a third party wants to obtain the popularity of this product. We design a much more
efficient privacy-preserving scheme for users to prevent the loss of the personal interests. Unlike most
previous works, we do not use any exponential or modular algorithms, but we provide a symmetric-key
based method which can also protect the information. Specifically, our protocol uses a third party that
generates a number of matrixes as each user’s key. Then user uses these key to encrypt their data which is
more efficient to obtain the support counts of a given pattern.
Processing Over Encrypted Query Data In Internet of Things (IoTs) : CryptDBs,...rahulmonikasharma
This document discusses techniques for processing queries over encrypted data in Internet of Things (IoT) systems. It describes CryptDB and MONOMI, which are database systems that can execute SQL queries over encrypted data. CryptDB uses a database proxy to encrypt/decrypt data and rewrite queries to execute on encrypted data. MONOMI builds on CryptDB and introduces a split client/server approach to query execution to improve efficiency of analytical queries over encrypted data. The document also outlines various encryption schemes that can be used for encrypted query processing, including deterministic encryption, order-preserving encryption, homomorphic encryption, and others.
In many of today’s computer application needs, faster operation is essential to the efficient implementation
of information security algorithm. RC4 has been used as the data encryption algorithm for many
applications and protocols including the Wi-Fi, Skype, and Bit Torrent to name a few. Several efficient
approaches to the implementation of RC4 have been proposed and we review some of those. More recently
some parallel approaches to faster implementation of RC4 have been presented and we include those in our
survey of efficient approaches to RC4. This paper presents an analysis of available hardware/software
parallel implementations of RC4 symmetric key-based algorithm and some security approaches which
make it more secure.
IRJET-Survey of Highly Secured Methods for Image Transmission using Image Seg...IRJET Journal
This document summarizes a research paper that proposes a new method for securely transmitting images using image segmentation, permutation, and multi-encryption techniques. It begins with an abstract that outlines encrypting images to protect confidential data from unauthorized access. It then provides background on encryption and discusses how traditional text encryption is not suitable for large image files. The proposed method segments an image, permutes the pixels using random numbers, and repeats the encryption multiple times for security. It claims this approach provides strong encryption with minimal data loss or computational costs compared to other methods.
A Comparative Study of RSA and ECC and Implementation of ECC on Embedded SystemsAM Publications
A large share of embedded applications are wireless, which makes the communication channel especially vulnerable. The research in the field of ECC is mostly focused on its implementation on application specific systems, which have restricted resources like storage, processing speed and domain specific CPU architecture. The focus of this research is on the implementation of ECC in an embedded iOS application to compare the performance measures obtained in the wireless environment or embedded systems by using elliptic curve cryptography (ECC), with a traditional cryptosystem like RSA.
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.
IRJET- Cancelable Biometric based Key Generation for Symmetric Cryptography: ...IRJET Journal
This document summarizes various methods for generating cryptographic keys from biometric traits. It discusses generating keys from fingerprints, iris images, and faces. For fingerprints, minutiae points are extracted from images and used to generate binary strings as keys. For iris images, Scale-Invariant Feature Transform is used to extract features, which are then encrypted using a bio-chaotic algorithm and quantum cryptography to generate keys. Face biometrics employs an entropy-based extraction and Reed-Solomon error correction to generate deterministic bit sequences as keys of suitable length for AES encryption. The document concludes that incorporating biometrics with cryptography provides stronger security by linking keys to users' biometric traits, eliminating the need to store or remember keys separately.
A Survey on Generation and Evolution of Various Cryptographic TechniquesIRJET Journal
This document summarizes previous research that has surveyed and compared various symmetric key cryptographic techniques. Several studies analyzed the performance of algorithms like DES, 3DES, AES, Blowfish, RC4 in terms of encryption/decryption time, memory usage, power consumption, throughput, and security against attacks. Most found that Blowfish had among the best performance overall, being fast and requiring few resources while maintaining strong security. AES generally required more processing power and time than alternatives like DES or RC4. The performance of algorithms could also vary based on file/data type, size, and the computing platform or operating system used.
This document describes the implementation of Caesar cipher encryption and decryption programs in Java, C++, and Python. It discusses the key steps in the encryption and decryption methods. The encryption method reads plaintext from an input file, encrypts each character using a Caesar cipher shift defined by a user-input key, and writes the ciphertext to an output file. The decryption method performs the reverse process, reading ciphertext and writing decrypted plaintext. Helper methods are used to encrypt/decrypt single characters. Flow charts illustrate the code logic and relationships between methods.
Email Encryption using Tri-Cryptosystem Based on AndroidIRJET Journal
The document proposes a tri-cryptosystem for securing email on Android devices using a combination of symmetric, asymmetric, and hash cryptography. Specifically, it uses the PingPong-128 symmetric stream cipher to encrypt messages, RSA for key exchange, and MD5 hashing to verify message integrity. This approach aims to address the weaknesses of single cryptosystem approaches by leveraging the speed of symmetric encryption and security of asymmetric techniques. The tri-cryptosystem encrypts a randomly generated symmetric key with the recipient's public RSA key. This encrypted key and the symmetric encrypted message are then sent to the recipient who can decrypt the key and message to obtain the plaintext.
Secure communication for mobile Adhoc network using (LPIT) Lagrange polynomia...AM Publications
Mobile adhoc network is collection of autonomous nodes that are frequently moving without the centralized
control. Mobile adhoc networks are multi hop wireless networks without fixed infrastructure. Node frequently change
topology, due to this type of behavior transformation of information from one node to another node is more
complicated task. Decentralized nature of mobile adhoc network is more vulnerable to attack like denial of service
(DOS) which consumes more bandwidth and resources. Security is major concern in adhoc network, so in this paper,
we propose a new algorithm based on Lagrange polynomial and Laplace transform and inverse Laplace transform to
enhance secure communication for MANET. This proposed algorithm provides security for transmission of
information among node.
IRJET- Cryptography Encryption and Decryption File Protection based on Mo...IRJET Journal
This document discusses encryption and decryption techniques using Bluetooth proximity on mobile devices. It begins with an abstract that outlines using an encryption algorithm to convert meaningful file information into unintelligible data that cannot be read without decrypting. The encryption key would be the Bluetooth MAC address of a registered device.
The introduction explains using AES encryption to encode files into unreadable data, with the Bluetooth MAC address as the decryption key. It also discusses how encryption provides data security for wireless communication.
The document then reviews cryptography purposes like authentication and confidentiality. It examines symmetric key cryptography using the same key for encryption and decryption, and public key cryptography using different keys. It also defines plain text, cipher text, and encryption/
This document discusses the effect of encryption delay on TCP traffic over data networks. It presents results from simulations of four scenarios: 1) no encryption, 2) low encryption delay of 0.02ms, 3) medium encryption delay of 0.04ms, and 4) high encryption delay of 0.05ms. The results show that TCP delay, segment delay, end-to-end delay, and connection delay all increase as the encryption delay increases. Therefore, encryption delays can negatively impact network performance and congestion if not properly balanced with encryption algorithm complexity. Faster encryption algorithms should be used when network performance is prioritized over security.
The effect of Encryption algorithms Delay on TCP Traffic over data networksIOSR Journals
This document discusses the effect of encryption delay on TCP traffic over data networks. It presents results from simulations of four scenarios: 1) no encryption, 2) low encryption delay of 0.02ms, 3) medium encryption delay of 0.04ms, and 4) high encryption delay of 0.05ms. The results show that TCP delay, segment delay, end-to-end delay, and connection delay all increase as the encryption delay increases. Therefore, encryption delays can negatively impact network performance and congestion if not properly balanced with encryption algorithm complexity. Faster encryption algorithms should be used when network performance is prioritized over security.
New Technique Using Multiple Symmetric keys for Multilevel EncryptionIJERA Editor
In a world of accelerating communications, cryptography has become an essential component of the modern
means of communication systems. The emergence of the webas a reliable medium for commerce and
communication has made cryptography an essential component. Many algorithms or ciphers are in use
nowadays. The quality of the cipher is judged byits ability to prevent an unrelated party fromknowingthe
original content of the encrypted message. The proposed “Multilevel Encryption Model” is a cryptosystem that
adopts the basic principles of cryptography. It uses five symmetric keys (multiple)
in floating point numbers, plaintext, substitution techniques and key combinations with unintelligible
sequence to produce the ciphertext. The decryption process is also designed to reproduce the plaintext
Similar to Gmdes a graph based modified data encryption standard algorithm with enhanced security (20)
Mechanical properties of hybrid fiber reinforced concrete for pavementseSAT Journals
Abstract
The effect of addition of mono fibers and hybrid fibers on the mechanical properties of concrete mixture is studied in the present
investigation. Steel fibers of 1% and polypropylene fibers 0.036% were added individually to the concrete mixture as mono fibers and
then they were added together to form a hybrid fiber reinforced concrete. Mechanical properties such as compressive, split tensile and
flexural strength were determined. The results show that hybrid fibers improve the compressive strength marginally as compared to
mono fibers. Whereas, hybridization improves split tensile strength and flexural strength noticeably.
Keywords:-Hybridization, mono fibers, steel fiber, polypropylene fiber, Improvement in mechanical properties.
Material management in construction – a case studyeSAT Journals
Abstract
The objective of the present study is to understand about all the problems occurring in the company because of improper application
of material management. In construction project operation, often there is a project cost variance in terms of the material, equipments,
manpower, subcontractor, overhead cost, and general condition. Material is the main component in construction projects. Therefore,
if the material management is not properly managed it will create a project cost variance. Project cost can be controlled by taking
corrective actions towards the cost variance. Therefore a methodology is used to diagnose and evaluate the procurement process
involved in material management and launch a continuous improvement was developed and applied. A thorough study was carried
out along with study of cases, surveys and interviews to professionals involved in this area. As a result, a methodology for diagnosis
and improvement was proposed and tested in selected projects. The results obtained show that the main problem of procurement is
related to schedule delays and lack of specified quality for the project. To prevent this situation it is often necessary to dedicate
important resources like money, personnel, time, etc. To monitor and control the process. A great potential for improvement was
detected if state of the art technologies such as, electronic mail, electronic data interchange (EDI), and analysis were applied to the
procurement process. These helped to eliminate the root causes for many types of problems that were detected.
Managing drought short term strategies in semi arid regions a case studyeSAT Journals
Abstract
Drought management needs multidisciplinary action. Interdisciplinary efforts among the experts in various fields of the droughts
prone areas are helpful to achieve tangible and permanent solution for this recurring problem. The Gulbarga district having the total
area around 16, 240 sq.km, and accounts 8.45 per cent of the Karnataka state area. The district has been situated with latitude 17º 19'
60" North and longitude of 76 º 49' 60" east. The district is situated entirely on the Deccan plateau positioned at a height of 300 to
750 m above MSL. Sub-tropical, semi-arid type is one among the drought prone districts of Karnataka State. The drought
management is very important for a district like Gulbarga. In this paper various short term strategies are discussed to mitigate the
drought condition in the district.
Keywords: Drought, South-West monsoon, Semi-Arid, Rainfall, Strategies etc.
Life cycle cost analysis of overlay for an urban road in bangaloreeSAT Journals
Abstract
Pavements are subjected to severe condition of stresses and weathering effects from the day they are constructed and opened to traffic
mainly due to its fatigue behavior and environmental effects. Therefore, pavement rehabilitation is one of the most important
components of entire road systems. This paper highlights the design of concrete pavement with added mono fibers like polypropylene,
steel and hybrid fibres for a widened portion of existing concrete pavement and various overlay alternatives for an existing
bituminous pavement in an urban road in Bangalore. Along with this, Life cycle cost analyses at these sections are done by Net
Present Value (NPV) method to identify the most feasible option. The results show that though the initial cost of construction of
concrete overlay is high, over a period of time it prove to be better than the bituminous overlay considering the whole life cycle cost.
The economic analysis also indicates that, out of the three fibre options, hybrid reinforced concrete would be economical without
compromising the performance of the pavement.
Keywords: - Fatigue, Life cycle cost analysis, Net Present Value method, Overlay, Rehabilitation
Laboratory studies of dense bituminous mixes ii with reclaimed asphalt materialseSAT Journals
Abstract
The issue of growing demand on our nation’s roadways over that past couple of decades, decreasing budgetary funds, and the need to
provide a safe, efficient, and cost effective roadway system has led to a dramatic increase in the need to rehabilitate our existing
pavements and the issue of building sustainable road infrastructure in India. With these emergency of the mentioned needs and this
are today’s burning issue and has become the purpose of the study.
In the present study, the samples of existing bituminous layer materials were collected from NH-48(Devahalli to Hassan) site.The
mixtures were designed by Marshall Method as per Asphalt institute (MS-II) at 20% and 30% Reclaimed Asphalt Pavement (RAP).
RAP material was blended with virgin aggregate such that all specimens tested for the, Dense Bituminous Macadam-II (DBM-II)
gradation as per Ministry of Roads, Transport, and Highways (MoRT&H) and cost analysis were carried out to know the economics.
Laboratory results and analysis showed the use of recycled materials showed significant variability in Marshall Stability, and the
variability increased with the increase in RAP content. The saving can be realized from utilization of recycled materials as per the
methodology, the reduction in the total cost is 19%, 30%, comparing with the virgin mixes.
Keywords: Reclaimed Asphalt Pavement, Marshall Stability, MS-II, Dense Bituminous Macadam-II
Laboratory investigation of expansive soil stabilized with natural inorganic ...eSAT Journals
This document summarizes a study on stabilizing expansive black cotton soil with the natural inorganic stabilizer RBI-81. Laboratory tests were conducted to evaluate the effect of RBI-81 on the soil's engineering properties. The tests showed that with 2% RBI-81 and 28 days of curing, the unconfined compressive strength increased by around 250% and the CBR value improved by approximately 400% compared to the untreated soil. Overall, the study found that RBI-81 effectively improved the strength properties of the black cotton soil and its suitability as a soil stabilizer was supported.
Influence of reinforcement on the behavior of hollow concrete block masonry p...eSAT Journals
Abstract
Reinforced masonry was developed to exploit the strength potential of masonry and to solve its lack of tensile strength. Experimental
and analytical studies have been carried out to investigate the effect of reinforcement on the behavior of hollow concrete block
masonry prisms under compression and to predict ultimate failure compressive strength. In the numerical program, three dimensional
non-linear finite elements (FE) model based on the micro-modeling approach is developed for both unreinforced and reinforced
masonry prisms using ANSYS (14.5). The proposed FE model uses multi-linear stress-strain relationships to model the non-linear
behavior of hollow concrete block, mortar, and grout. Willam-Warnke’s five parameter failure theory has been adopted to model the
failure of masonry materials. The comparison of the numerical and experimental results indicates that the FE models can successfully
capture the highly nonlinear behavior of the physical specimens and accurately predict their strength and failure mechanisms.
Keywords: Structural masonry, Hollow concrete block prism, grout, Compression failure, Finite element method,
Numerical modeling.
Influence of compaction energy on soil stabilized with chemical stabilizereSAT Journals
This document summarizes a study on the influence of compaction energy on soil stabilized with a chemical stabilizer. Laboratory tests were conducted on locally available loamy soil treated with a patented polymer liquid stabilizer and compacted at four different energy levels. The study found that increasing the compaction effort increased the density of both untreated and treated soil, but the rate of increase was lower for stabilized soil. Treating the soil with the stabilizer improved its unconfined compressive strength and resilient modulus, and reduced accumulated plastic strain, with these properties further improved by higher compaction efforts. The stabilized soil exhibited strength and performance benefits compared to the untreated soil.
Geographical information system (gis) for water resources managementeSAT Journals
This document describes a hydrological framework developed in the form of a Hydrologic Information System (HIS) to meet the information needs of various government departments related to water management in a state. The HIS consists of a hydrological database coupled with tools for collecting and analyzing spatial and non-spatial water resources data. It also incorporates a hydrological model to indirectly assess water balance components over space and time. A web-based GIS portal was created to allow users to access and visualize the hydrological data, as well as outputs from the SWAT hydrological model. The framework is intended to facilitate integrated water resources planning and management across different administrative levels.
Forest type mapping of bidar forest division, karnataka using geoinformatics ...eSAT Journals
Abstract
The study demonstrate the potentiality of satellite remote sensing technique for the generation of baseline information on forest types
including tree plantation details in Bidar forest division, Karnataka covering an area of 5814.60Sq.Kms. The Total Area of Bidar
forest division is 5814Sq.Kms analysis of the satellite data in the study area reveals that about 84% of the total area is Covered by
crop land, 1.778% of the area is covered by dry deciduous forest, 1.38 % of mixed plantation, which is very threatening to the
environmental stability of the forest, future plantation site has been mapped. With the use of latest Geo-informatics technology proper
and exact condition of the trees can be observed and necessary precautions can be taken for future plantation works in an appropriate
manner
Keywords:-RS, GIS, GPS, Forest Type, Tree Plantation
Factors influencing compressive strength of geopolymer concreteeSAT Journals
Abstract
To study effects of several factors on the properties of fly ash based geopolymer concrete on the compressive strength and also the
cost comparison with the normal concrete. The test variables were molarities of sodium hydroxide(NaOH) 8M,14M and 16M, ratio of
NaOH to sodium silicate (Na2SiO3) 1, 1.5, 2 and 2.5, alkaline liquid to fly ash ratio 0.35 and 0.40 and replacement of water in
Na2SiO3 solution by 10%, 20% and 30% were used in the present study. The test results indicated that the highest compressive
strength 54 MPa was observed for 16M of NaOH, ratio of NaOH to Na2SiO3 2.5 and alkaline liquid to fly ash ratio of 0.35. Lowest
compressive strength of 27 MPa was observed for 8M of NaOH, ratio of NaOH to Na2SiO3 is 1 and alkaline liquid to fly ash ratio of
0.40. Alkaline liquid to fly ash ratio of 0.35, water replacement of 10% and 30% for 8 and 16 molarity of NaOH and has resulted in
compressive strength of 36 MPa and 20 MPa respectively. Superplasticiser dosage of 2 % by weight of fly ash has given higher
strength in all cases.
Keywords: compressive strength, alkaline liquid, fly ash
Experimental investigation on circular hollow steel columns in filled with li...eSAT Journals
Abstract
Composite Circular hollow Steel tubes with and without GFRP infill for three different grades of Light weight concrete are tested for
ultimate load capacity and axial shortening , under Cyclic loading. Steel tubes are compared for different lengths, cross sections and
thickness. Specimens were tested separately after adopting Taguchi’s L9 (Latin Squares) Orthogonal array in order to save the initial
experimental cost on number of specimens and experimental duration. Analysis was carried out using ANN (Artificial Neural
Network) technique with the assistance of Mini Tab- a statistical soft tool. Comparison for predicted, experimental & ANN output is
obtained from linear regression plots. From this research study, it can be concluded that *Cross sectional area of steel tube has most
significant effect on ultimate load carrying capacity, *as length of steel tube increased- load carrying capacity decreased & *ANN
modeling predicted acceptable results. Thus ANN tool can be utilized for predicting ultimate load carrying capacity for composite
columns.
Keywords: Light weight concrete, GFRP, Artificial Neural Network, Linear Regression, Back propagation, orthogonal
Array, Latin Squares
Experimental behavior of circular hsscfrc filled steel tubular columns under ...eSAT Journals
This document summarizes an experimental study that tested circular concrete-filled steel tube columns with varying parameters. 45 specimens were tested with different fiber percentages (0-2%), tube diameter-to-wall-thickness ratios (D/t from 15-25), and length-to-diameter (L/d) ratios (from 2.97-7.04). The results found that columns filled with fiber-reinforced concrete exhibited higher stiffness, equal ductility, and enhanced energy absorption compared to those filled with plain concrete. The load carrying capacity increased with fiber content up to 1.5% but not at 2.0%. The analytical predictions of failure load closely matched the experimental values.
Evaluation of punching shear in flat slabseSAT Journals
Abstract
Flat-slab construction has been widely used in construction today because of many advantages that it offers. The basic philosophy in
the design of flat slab is to consider only gravity forces; this method ignores the effect of punching shear due to unbalanced moments
at the slab column junction which is critical. An attempt has been made to generate generalized design sheets which accounts both
punching shear due to gravity loads and unbalanced moments for cases (a) interior column; (b) edge column (bending perpendicular
to shorter edge); (c) edge column (bending parallel to shorter edge); (d) corner column. These design sheets are prepared as per
codal provisions of IS 456-2000. These design sheets will be helpful in calculating the shear reinforcement to be provided at the
critical section which is ignored in many design offices. Apart from its usefulness in evaluating punching shear and the necessary
shear reinforcement, the design sheets developed will enable the designer to fix the depth of flat slab during the initial phase of the
design.
Keywords: Flat slabs, punching shear, unbalanced moment.
Evaluation of performance of intake tower dam for recent earthquake in indiaeSAT Journals
Abstract
Intake towers are typically tall, hollow, reinforced concrete structures and form entrance to reservoir outlet works. A parametric
study on dynamic behavior of circular cylindrical towers can be carried out to study the effect of depth of submergence, wall thickness
and slenderness ratio, and also effect on tower considering dynamic analysis for time history function of different soil condition and
by Goyal and Chopra accounting interaction effects of added hydrodynamic mass of surrounding and inside water in intake tower of
dam
Key words: Hydrodynamic mass, Depth of submergence, Reservoir, Time history analysis,
Evaluation of operational efficiency of urban road network using travel time ...eSAT Journals
This document evaluates the operational efficiency of an urban road network in Tiruchirappalli, India using travel time reliability measures. Traffic volume and travel times were collected using video data from 8-10 AM on various roads. Average travel times, 95th percentile travel times, and buffer time indexes were calculated to assess reliability. Non-motorized vehicles were found to most impact reliability on one road. A relationship between buffer time index and traffic volume was developed. Finally, a travel time model was created and validated based on length, speed, and volume.
Estimation of surface runoff in nallur amanikere watershed using scs cn methodeSAT Journals
Abstract
The development of watershed aims at productive utilization of all the available natural resources in the entire area extending from
ridge line to stream outlet. The per capita availability of land for cultivation has been decreasing over the years. Therefore, water and
the related land resources must be developed, utilized and managed in an integrated and comprehensive manner. Remote sensing and
GIS techniques are being increasingly used for planning, management and development of natural resources. The study area, Nallur
Amanikere watershed geographically lies between 110 38’ and 110 52’ N latitude and 760 30’ and 760 50’ E longitude with an area of
415.68 Sq. km. The thematic layers such as land use/land cover and soil maps were derived from remotely sensed data and overlayed
through ArcGIS software to assign the curve number on polygon wise. The daily rainfall data of six rain gauge stations in and around
the watershed (2001-2011) was used to estimate the daily runoff from the watershed using Soil Conservation Service - Curve Number
(SCS-CN) method. The runoff estimated from the SCS-CN model was then used to know the variation of runoff potential with different
land use/land cover and with different soil conditions.
Keywords: Watershed, Nallur watershed, Surface runoff, Rainfall-Runoff, SCS-CN, Remote Sensing, GIS.
Estimation of morphometric parameters and runoff using rs & gis techniqueseSAT Journals
This document summarizes a study that used remote sensing and GIS techniques to estimate morphometric parameters and runoff for the Yagachi catchment area in India over a 10-year period. Morphometric analysis was conducted to understand the hydrological response at the micro-watershed level. Daily runoff was estimated using the SCS curve number model. The results showed a positive correlation between rainfall and runoff. Land use/land cover changes between 2001-2010 were found to impact estimated runoff amounts. Remote sensing approaches provided an effective means to model runoff for this large, ungauged area.
Effect of variation of plastic hinge length on the results of non linear anal...eSAT Journals
Abstract The nonlinear Static procedure also well known as pushover analysis is method where in monotonically increasing loads are applied to the structure till the structure is unable to resist any further load. It is a popular tool for seismic performance evaluation of existing and new structures. In literature lot of research has been carried out on conventional pushover analysis and after knowing deficiency efforts have been made to improve it. But actual test results to verify the analytically obtained pushover results are rarely available. It has been found that some amount of variation is always expected to exist in seismic demand prediction of pushover analysis. Initial study is carried out by considering user defined hinge properties and default hinge length. Attempt is being made to assess the variation of pushover analysis results by considering user defined hinge properties and various hinge length formulations available in literature and results compared with experimentally obtained results based on test carried out on a G+2 storied RCC framed structure. For the present study two geometric models viz bare frame and rigid frame model is considered and it is found that the results of pushover analysis are very sensitive to geometric model and hinge length adopted. Keywords: Pushover analysis, Base shear, Displacement, hinge length, moment curvature analysis
Effect of use of recycled materials on indirect tensile strength of asphalt c...eSAT Journals
Abstract
Depletion of natural resources and aggregate quarries for the road construction is a serious problem to procure materials. Hence
recycling or reuse of material is beneficial. On emphasizing development in sustainable construction in the present era, recycling of
asphalt pavements is one of the effective and proven rehabilitation processes. For the laboratory investigations reclaimed asphalt
pavement (RAP) from NH-4 and crumb rubber modified binder (CRMB-55) was used. Foundry waste was used as a replacement to
conventional filler. Laboratory tests were conducted on asphalt concrete mixes with 30, 40, 50, and 60 percent replacement with RAP.
These test results were compared with conventional mixes and asphalt concrete mixes with complete binder extracted RAP
aggregates. Mix design was carried out by Marshall Method. The Marshall Tests indicated highest stability values for asphalt
concrete (AC) mixes with 60% RAP. The optimum binder content (OBC) decreased with increased in RAP in AC mixes. The Indirect
Tensile Strength (ITS) for AC mixes with RAP also was found to be higher when compared to conventional AC mixes at 300C.
Keywords: Reclaimed asphalt pavement, Foundry waste, Recycling, Marshall Stability, Indirect tensile strength.
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Sinan KOZAK
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Applications of artificial Intelligence in Mechanical Engineering.pdfAtif Razi
Historically, mechanical engineering has relied heavily on human expertise and empirical methods to solve complex problems. With the introduction of computer-aided design (CAD) and finite element analysis (FEA), the field took its first steps towards digitization. These tools allowed engineers to simulate and analyze mechanical systems with greater accuracy and efficiency. However, the sheer volume of data generated by modern engineering systems and the increasing complexity of these systems have necessitated more advanced analytical tools, paving the way for AI.
AI offers the capability to process vast amounts of data, identify patterns, and make predictions with a level of speed and accuracy unattainable by traditional methods. This has profound implications for mechanical engineering, enabling more efficient design processes, predictive maintenance strategies, and optimized manufacturing operations. AI-driven tools can learn from historical data, adapt to new information, and continuously improve their performance, making them invaluable in tackling the multifaceted challenges of modern mechanical engineering.
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.
AI for Legal Research with applications, toolsmahaffeycheryld
AI applications in legal research include rapid document analysis, case law review, and statute interpretation. AI-powered tools can sift through vast legal databases to find relevant precedents and citations, enhancing research accuracy and speed. They assist in legal writing by drafting and proofreading documents. Predictive analytics help foresee case outcomes based on historical data, aiding in strategic decision-making. AI also automates routine tasks like contract review and due diligence, freeing up lawyers to focus on complex legal issues. These applications make legal research more efficient, cost-effective, and accessible.
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.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELijaia
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Comparative analysis between traditional aquaponics and reconstructed aquapon...bijceesjournal
The aquaponic system of planting is a method that does not require soil usage. It is a method that only needs water, fish, lava rocks (a substitute for soil), and plants. Aquaponic systems are sustainable and environmentally friendly. Its use not only helps to plant in small spaces but also helps reduce artificial chemical use and minimizes excess water use, as aquaponics consumes 90% less water than soil-based gardening. The study applied a descriptive and experimental design to assess and compare conventional and reconstructed aquaponic methods for reproducing tomatoes. The researchers created an observation checklist to determine the significant factors of the study. The study aims to determine the significant difference between traditional aquaponics and reconstructed aquaponics systems propagating tomatoes in terms of height, weight, girth, and number of fruits. The reconstructed aquaponics system’s higher growth yield results in a much more nourished crop than the traditional aquaponics system. It is superior in its number of fruits, height, weight, and girth measurement. Moreover, the reconstructed aquaponics system is proven to eliminate all the hindrances present in the traditional aquaponics system, which are overcrowding of fish, algae growth, pest problems, contaminated water, and dead fish.
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.
Build the Next Generation of Apps with the Einstein 1 Platform.
Rejoignez Philippe Ozil pour une session de workshops qui vous guidera à travers les détails de la plateforme Einstein 1, l'importance des données pour la création d'applications d'intelligence artificielle et les différents outils et technologies que Salesforce propose pour vous apporter tous les bénéfices de l'IA.
AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...
Gmdes a graph based modified data encryption standard algorithm with enhanced security
1. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 03 | Mar-2014, Available @ http://www.ijret.org 653
GMDES: A GRAPH BASED MODIFIED DATA ENCRYPTION STANDARD
ALGORITHM WITH ENHANCED SECURITY
Debajit Sensarma1
, Samar Sen Sarma2
1
Department of Computer Science & Engineering, University of Calcutta, Kolkata, West Bengal, India
2
Department of Computer Science & Engineering, University of Calcutta, Kolkata, West Bengal, India
Abstract
Cryptography is one of the prime techniques of secured symbolic data transmission over any communication channel. Security is the
most challenging and essential aspects in today’s internet and network applications. Thus, design of a secure encryption algorithm is
very necessary which can protect the unauthorized attacks. An encryption algorithm is computationally secure if it cannot be intruded
with the standard resources. The algorithm proposed here is graph based. Its efficiency surpasses the standard DES algorithm in
general. Graphs can be used for designing block ciphers, stream ciphers or public-key ciphers. The algorithm is graph automorphism
based partial symmetric key algorithm and it is not fully depended on secret key and produces different cipher text by applying same
key on the same plain text.
Keywords: DES, Graph Automorphism, Hamiltonian Cycle, Encryption, Decryption
-----------------------------------------------------------------------***-----------------------------------------------------------------------
1. INTRODUCTION
Cryptography is a science which studies the techniques for
secure communication in the presence of intruders or
unauthenticated access. It is about constructing and analyzing
protocols that overcome the influence of intruders.
Cryptography converts the original message in a non-readable
format and sends the message over an insecure channel. The
original message is called plain text. Disguising the plain text
to hide its original contents is called encryption. The non-
readable format of the plain text after encryption is called
cipher text. The process of reverting the cipher text to its
corresponding plain text is called decryption process. For both
encryption and decryption process key is used. It is used with
plain text at the time of encryption and with the cipher text at
the time of decryption.
Cryptography provides number of security goals to ensure the
privacy of the data. The goals of the cryptography are-
Confidentiality, Integrity, Availability, Authenticity, Non
Repudiation, Access control [2]. In cryptography the
encryption algorithms can be classified into two broad
categories- Symmetric key and asymmetric key encryption. In
Symmetric key cryptography the key used for encryption and
decryption is same. Thus, the key must be distributed through
the secure channel before transmission started. These types of
algorithms are highly depended on the nature of the key. DES,
Triple DES, AES, RC4, RC6, BLOWFISH etc are the
example of symmetric key algorithms. In asymmetric key
cryptography two different keys are used for encryption and
decryption, they are private and public key. The public key is
available to all in the network. The sender who wants to
transmit message, encrypts the message with receiver‟s public
key and only the authorized receiver can decrypt the message
with its private key. RSA is the example of asymmetric key
cryptography. According to [15] symmetric key algorithm is
faster than asymmetric key algorithm and also memory
requirement of the former is lesser than the later.
In this paper a graph based modified DES algorithm is
proposed. It is depended on the Hamiltonian cycle and the
automorphism [3, 4] property of the 4-cube graph. Here, an
arbitrary Hamiltonian cycle of a 4-cube graph is used as a
secret key and sixteen different Hamiltonian cycles of the non
Automorphic graphs of the given 4-cube graph is used as the
sub keys for sixteen rounds like classical DES. It is a partial
symmetric key algorithm based on the block cipher. The main
advantage of the proposed algorithm is, like other symmetric
key algorithms it is not fully depended on the secret key,
rather it also depended on the sub keys, which are remain
encrypted with the private key of the sender and stored in a
secure mapping table. When a receiver wants to decrypt the
message, it will send request to the sender. The sender uses
Zero Knowledge Protocol [6] to verify the receiver. If the
receiver is authorized, then sender will decrypt the sub keys of
the secret mapping table with the sender‟s private key. Then
only that particular receiver can decrypts the cipher text.
Another advantage is that, this algorithm produces different
cipher texts for a single key and single pain text, which also
decreases the probability of various malicious attacks.
The paper is organized as follows- In section 2 some
preliminaries are given, Section 3 explain a brief review of
related literature, Section 4 illustrates the proposed algorithm,
in section 5 a short example is given, section 6 gives some
2. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 03 | Mar-2014, Available @ http://www.ijret.org 654
experimental results, section 7 explain the strength of the
proposed method, Security analysis of proposed method is
given in section 8, Concluding remarks and future works are
given in Section 9.
2. PRELIMINARIES
2.1 Data Encryption Standard (DES)
DES [5] is the most widely used encryption algorithm. It was
published by the National Bureau of Standards, now the
National Institute of Standards and Technology (NIST), in
January 1977 as an algorithm to be used for unclassified data
(information not concerned with national security) [16].
According to the specification of FIPS publication 46-3, it is a
block cipher operating on 64-bit data blocks. The encryption
process depends on 56 bit secret key and sixteen round of
Feistel iteration surrounded by two permutation layers, initial
bit permutation (IP) at the input and its inverse (IP-1) at the
output. The Graphical representation of the encryption process
in depicted in fig. 1. The decryption process is same as
encryption except the application sub keys used in the Feistel
iteration is reversed [1].
The 16-round Feistel cipher is the core of DES. Here at first
64-bit block plain text is divided into two 32-bit words, LPT
and RPT. In each iteration, the second word RPT is fed into a
function „f‟ and the result is XORed with the left word LPT.
Then the both words are swapped and the algorithm continues.
The function „f‟ of DES algorithm has following steps:
2.1.1 Key Transformation
64 bit key is the input of the algorithm. Every eighth bit
position of the key is ignored to produce 56 bit key. This key
is first subjected to a permutation by permuted choice one and
the resultant 56 bit key divided into two 28 bit words. They
are circularly left shifted according to the number of left shift
in the particular round. The resulting shift value serve as the
input to permuted choice two to produce 48-bit output.
2.1.2 Expansion Permutation
In this phase the 32 bit RPT is expanded to 48 bit and the bits
are permuted as well, hence the expansion permutation.
2.1.3 S-box Substitution
It is a process that accepts 48 bit input from the XOR
operation involving the compressed key and expanded RPT
and produces a 32 bit output using the substitution technique.
2.1.4 P-box Permutation
The output 32 bit of S-box is permuted using P-box.The
modified RPT is XORed with the LPT and the result is fed to
the next RPT register. The unmodified RPT is fed to the next
LPT register and the same process repeated 15 times. At the
end of the 16 rounds the final permutation is performed and
the cipher text is produced.
Fig- 1: DES Algorithm
Fig- 2: Calculation of function „f ‟
2.2 Hamiltonian Cycle
A Hamiltonian cycle, also called Hamiltonian circuit, is a
graph cycle (i.e. closed loop) through a graph that visits each
vertex exactly once. According to [18], n-cube is Hamiltonian.
In the proposed algorithm 4-cube graph is considered and the
number of directed Hamiltonian cycle with a marked starting
node of 4-cube graph is 43008 [17]. Fig. 3.shows a
Hamiltonian cycle of the 4-cube graph.
3. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 03 | Mar-2014, Available @ http://www.ijret.org 655
Fig- 3: Hamiltonian cycle of 4-cube graph
2.3 Graph Automorphism
An automorphism [3, 4, 7, 14] of a graph is a form of
symmetry in which graph mapped onto itself while preserving
adjacency. Formally, automorphism of a graph G (V, E) is the
permutation of the vertex set V, such that vertices u, v V
forms an edge iff ( (u), (v)) also forms an edge. The
automorphism of the graph is isomorphism from the graph to
itself. Set of all automorphisms of a graph forms a group
under composition. There are various algorithms for
computation of automorphism group of a graph namely Nauty
[8], Saucy [9, 10], Bliss [11], Conauto 2.0 [13 ], Traces [12 ]
etc.
According to [14] the order of automorphism group of n-cube
is n! 2n. Proposed algorithm is based on 4-cube graph and the
fig. 4 shows the Hamiltonian cycle of the automorphic and
non-automorphic graph of the given 4-cube graph. To increase
strength of the sub keys, Hamiltonian cycle of non
Automorphic graph of given 4-cube graph is used.
(a)
(b)
Fig-4: (a) Hamiltonian cycle of the non-automorphic graph of
the graph in fig. 3. (b) Hamiltonian cycle of automorphic
graph of the graph in fig. 3.
2.4 Zero Knowledge Protocol (ZKP)
It is an authentication protocol where user‟s private key is
never revealed to the authority. In most traditional
authentication scheme the users who wish to gain access to
resources reveal their secret to the authority to prove their
identity. The drawback of this scheme is that, the authority
may be a malicious third party who will gain access to the
user‟s private key. Furthermore, even if the authority is
trustworthy, revealing a private key is susceptible to
eavesdropping, compromising system. The ZKP on other hand
effectively removes this problem. Detail description of the
ZKP can be found in [6]. The general flow of ZKP is
described below.
1) The prover (P) sends the verifier a value that is computed
based on his private key.
2) The verifier flips a coin, and asks the prover to answer one
of two questions based on the result of the coin flip. Generally
the questions are either to answer a question about the value
that was sent in step 1, or to answer a question about the secret
key.
3) The prover sends the verifier the answer to his question.
4) The verifier checks that the answer is correct.
Fig-5: Zero Knowledge Protocol (ZKP)
3. BRIEF REVIEW OF RELATED LITERATURE
Over the past few decades DES algorithm has been gone
through many enhancements and served as the basis for many
other encryption algorithms. At first, Triple DES (3DES or
TDES) has been proposed [20]. TDES uses 48 rounds and
three 56 bit keys to encrypt data. This algorithm gives three
level security to data and high resistant from differential
cryptanalysis attacks. But as TDES has to gone through DES
algorithm three times, the encryption and decryption time is
larger than standard DES algorithm. Next, Advanced
4. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 03 | Mar-2014, Available @ http://www.ijret.org 656
Encryption Standard (AES) [21, 22] comes which another
encryption standard. It encrypts data blocks of 128 bits using
the keys of 128, 192, 256 bits. Although AES has the tighter
security compare to DES or TDES, it also has longest
encryption time and load, since all variable needed to process
encryption. Next, BLOWFISH [23] designed by Bruce
Schneier. Blowfish is a 64 bit block cipher with variable
length key from 32 bit to 448 bits. The strength of the
Blowfish lies in the fact that, in its full round form
cryptanalysis techniques have no effect on it. However,
anything which is less than four rounds is prone to brute-force
attack [24]. Ammar et al. [25] proposed Random Data
Encryption Algorithm (RDEA) by extending DES where
pseudo randomized cipher key is generated for encryption and
embedded with the cipher text. As the length of the cipher text
increases and the memory capacity hampered, the overall
efficiency of the algorithm also affected poorly.
4. PROPOSED ALGORITHM
4.1 Encryption Process
The proposed algorithm is a modified version of DES which
uses graph Hamiltonian cycle and the graph automorphism
concept for generating keys. The whole process is similar to
DES except the key transformation process. The modified key
transformation process is depicted below:
4.1.1 Key Transformation
Here, the input is an arbitrary Hamiltonian cycle of the 4-cube
graph in 64 bit binary format. This is used as the secret key.
Here the parity bits are not used because, the sequence is a
Gray code and it can support error detection and correction
like geometric approach for error detection and correction
[26]. In this algorithm a secure mapping table is used which is
encrypted with the sender‟s private key and sender can update
it dynamically when needed. The secure mapping table consist
of mappings between the given 4-cube graph and its non-
automorphic graphs. Altogether 16 arbitrary mappings are
stored in the secure mapping table for producing sub keys of
16 rounds. The key transformation algorithm for 1st round is
given below:
Algorithm: Key transformation.
Begin
Step 1: 64 bit secret key is permuted using the 1st
entry of the
secure mapping table.
Step 2: Every eighth bit position of the sub key is discarded to
produce 56 bit sub key.
Step 3: 56 bit sub key is permuted using the permuted choice
two table used in the standard DES algorithm [1,2] and the sub
key for round 1 is produced.
End
This procedure is continued for remaining 15 rounds. The
overall encryption process is given with a graphical
representation in fig.6.
4.2 Decryption Process
The receiver who wants to decrypt the cipher text with the
secret key has to follow the algorithm given below:
Algorithm: Decryption.
Begin
Step 1: Receiver who wants decrypt the cipher text will send a
request to the sender for decryption of the encrypted secure
mapping table.
Step 2: Sender will start Zero Knowledge Protocol (ZKP) to
verify if the receiver is authenticated or not.
Step 3: If the receiver is authenticated then sender will decrypt
the secure mapping table for that particular receiver.
Step 4: Receiver will decrypt the cipher text by following the
same procedure as encryption except the application of keys in
reverse order.
Step 5: After successful completion of the decryption, receiver
will send a completion message to the sender and the sender
will update with secure mapping table and decrypt it with its
private key.
End
5. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 03 | Mar-2014, Available @ http://www.ijret.org 657
Fig- 6: Proposed Encryption Algorithm
5. EXAMPLE
Suppose,
Plain text: 02468aceeca86420
Input Key: 13267fbaec89d540 (Hamiltonian cycle of fig. 3.
in Hexadecimal format)
Table- 1 Secure Mapping Table (Encrypted with Sender‟s
Private Key)
Round Mapping
1 1<->5, 2<->3, 7<->e, 9<->d
2 3<->e, 0<->c, a<->b
3 4<->8, 7<->b, 1<->9
4 0<->6, 1<->7, 3<->b
5 2<->4, 9<->a, e<->f, 0<->1
6 2<->3, 1<->a, c<->d
7 2<->7, 9<->c, 0<->5, a<->d
8 7<->9, e<->f, 0<->1
9 2<->c, 4<->a, 5<->f, 0<->e
10 2<->6, 0<->4, 8<->a, 9<->f
11 1<->4, 3<->b, 7<->a, e<->f
12 1<->f, 4<->5, 8<->9, 0<->b
13 1<->2, 3<->a, 5<->c, 8<->d
14 5<->9, 6<->d, 1<->c
15 3<->a, 7<->e, 5<->6, 4<->b
16 4<->c, 3<->8, a<->d, 2<->b
Table- 2. 16 sub keys
Round Key
1 f1b5b7a3a0a5
2 d575b6259825
3 d9bd963238aa
4 17359527b9a6
5 d024b66338b7
6 fa343623b886
7 f0359ea7e006
8 91b496a2b8b7
9 d0017e4d1d2c
10 d015b0a738b6
11 d5b41f2338e7
12 cb11b323bbe6
13 fe24363b9286
14 5936b7aac806
15 45bd36633ced
16 9e118985d39b
Table- 3. Prposed Algorithm Execution (output of 16 rounds)
Round Keyi LPTi RPTi
IP 5a005a00 3cf03c0f
1 f1b5b7a3a0a5 3cf03c0f 330fe276
2 d575b6259825 330fe276 700a5a48
3 d9bd963238aa 700a5a48 a679b868
4 17359527b9a6 a679b868 619719c0
5 d024b66338b7 619719c0 723cff23
6 fa343623b886 723cff23 a8c6567f
7 f0359ea7e006 a8c6567f 27fb11ba
8 91b496a2b8b7 27fb11ba f394ff9f
9 d0017e4d1d2c f394ff9f 0442ee5c
10 d015b0a738b6 0442ee5c 2038a68d
11 d5b41f2338e7 2038a68d 87fdb9b1
12 cb11b323bbe6 87fdb9b1 5c304b39
13 fe24363b9286 5c304b39 1ad827b4
14 5936b7aac806 1ad827b4 9b8bbe39
15 45bd36633ced 9b8bbe39 b9864f8e
16 9e118985d39b b9864f8e 5a5a59ca
IP-1
4cb715ef e840ae53
Cipher text: 4cb715ef e840ae53
6. RESULTS
The Hardware used to carry out this experiment is Pentium IV
computer and 1 GB, DDR2 RAM. The program is written in
„C‟ programming language and „Borland C++‟ compiler is
used for compilation and execution purpose. Chart-1 shows
the comparison of time required for encryption between
standard DES algorithm and the proposed algorithm
(GMDES) and Chart-2 shows the decryption time required for
the standard DES and the proposed algorithm (GMDES).
Decryption time for GMDES is calculated excluding the time
required for verification of the receiver by ZKP.
6. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 03 | Mar-2014, Available @ http://www.ijret.org 658
Chart-1: Time (in seconds) required for encryption of text
files
Chart-2: Time (in seconds) required for decryption of text
files
7. STRENGTH OF THE PROPOSED
ALGORITHM
7.1 Key Space
The main drawback of standard DES algorithm is that, it can
be easily prone to brute-force attack, because of its relatively
short key length. In DES there are only 256
possible key
combinations which are quite easy to crack. The algorithm
proposed here tries to overcome this drawback using the
partial symmetric key concept. The advantage is that, the
algorithm is not fully depended on the secret key. If the
intruder does not know the secret key, the time needed for
brute-force attack (if the computation is done in 2.4 GHz
processor) = Number of Hamiltonian cycles in 4-cube graph *
(All possible permutations of vertices of 4-cube graph –
Number of Automorphic graph of given 4-cube graph) number of
rounds
/ (2.4*109
*3600*365*24) =43008* (16!-(4!.24
))16
/
(2.4*109
*3600*365*24) = 5.8005 X 10217
/
(2.4*109
*3600*365*24) =7.66 X 10200
years (Theoretically).
It is much larger than standard DES which is (256
/
(2.4*109
*3600*365*24) = 0.952 years (approx)).
Now, if the intruder knows the secret key then the time
required for brute-force attack= (16!-(4! 24
))16
/
(2.4*109
*3600*365*24)= 1.77 X 10196
(Theoretically).
Chart-3: Comparison of key space of standard DES and
Proposed method
7.2 Avalanche Effect (Delta)
A change in one bit of the plain text or one bit of the key
should produce change in many bits of the cipher text. This
effect is known as Avalanche effect. In the example of section
5, if the first bit of the plain text is changed the plain text
becomes 12468aceeca86420.The Chart-4 shows the
Avalanche effects of both the standard DES and proposed
algorithm which shows that Avalanche effect of DES is 50%
where in the case of proposed algorithm it is 55%.
Chart-4: Avalanche effect of standard DES and Proposed
method
8. SECURITY ANALYSIS WITH GMDES
Security is a very important aspect of any encryption
algorithm. A short discussion about the security issues of the
propose algorithm, GMDES from the cryptographic point
of view are given below.
7. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 03 | Mar-2014, Available @ http://www.ijret.org 659
8.1 Replay Attack
In this attack, an intruder tries to replay the earlier
communication and authenticate itself to the sender who is the
verifier. But, as Zero Knowledge Protocol is used in this
proposed system, the verifier will be sending different
challenge values for each communication, replaying earlier
communication will not authenticate the receiver.
8.2 Chosen Cipher Text Attack
According to this attack model Attacker tries to deduce secret
keys by studying various cipher texts and corresponding plain
texts. This kind of attack has more chances of success if
encryption key size is limited. But in the proposed method,
different cipher text is produced for the same key and same
plain text and the key space of this algorithm is very large, so
deduction of encryption key will not practically possible.
8.3 Cipher Text only Attack
It is an attack model for cryptanalysis where the Attacker is
assumed to have an access only to a set of cipher texts. The
attack is successful if corresponding plain text can be deduced
or the key is found. But for the proposed scheme, key space is
very large and the algorithm is not fully depended on secret
key but also on the protected sub-keys. So possibility of this
type of attack is much less.
8.4 Chosen Plain Text Attack
In this attack model Attacker chooses an arbitrary plain text to
be encrypted and obtain the corresponding cipher text. By
comparing this two the Attacker can find his own key. But the
proposed method is a partial symmetric key algorithm and is
not fully depended on the secret key; rather it also depended
on the sub-keys which are protected by sender‟s private key.
So, it is not possible for an Attacker to know the sender‟s
private key and due to large key space the possibility of this
type of attack is very less.
8.5 Brute Force Attack
This type of attack consists of systematically checking all
possible keys until the correct one is found. In the worst case,
this would involve traversing the entire search space. As the
key space of this proposed algorithm is very large, so
possibility of this type of attack is practically impossible.
8.6 Man-in-the-middle Attack
In this attack the cryptanalyst places him in the
communication channel between sender and receiver who
wish to exchange their data for secure communication and he
makes independent connections with the victims by
exchanging key with them and relays messages between them,
making them believe that they are talking directly to each
other over a private connection, when in fact the entire
conversation is controlled by the cryptanalyst. So, the
cryptanalyst knows the secret key. This type of attack can be
defeated by the proposed method as it uses the secure key
exchange protocol [27] and Zero Knowledge Protocol for
authentication of the receiver.
9. CONCLUSIONS
Security is a very complex topic. In this paper a graph based
modified DES (GMDES) algorithm is proposed which is more
secure than the classical DES algorithm. The proposed
algorithm is not fully depended on secret key and for the same
plain text it produces different cipher text using the same
secret key which reduces the probability of various attacks.
Besides this, unauthorized user cannot be able to decrypt the
message in a feasible amount of time despite of knowing the
secret key. The future depends on detailed simulation and
comparison with other encryption algorithm, as well as
complete statistical survey and analysis with respect to other
attacks. Furthermore, this proposed technique can be
implemented in embedded systems, smart card security, cloud
computer security etc.
ACKNOWLEDGEMENTS
The authors would like to thank University Of Calcutta, West
Bengal, India, Department of Science & Technology (DST),
New Delhi, for financial support and the reviewers for their
constructive and helpful comments and specially the
Computer without which no work was possible.
REFERENCES
[1] Stallings, William. Cryptography and Network
Security: Principles and Practice. Prentice Hall, 2011.
[2] Kahate, Atul. Cryptography & Network Security. Tata
McGraw-Hill Education, 2011.
[3] Biggs, Norman. Finite groups of automorphisms:
course given at the University of Southampton,
October-December 1969. Vol. 6. CUP Archive, 1971.
[4] Biggs, Norman. Algebraic graph theory. Cambridge
University Press, 1993.
[5] National Institute of Standards, U.S. Department of
Commerce. FIPS 47: Data Encryption Standard, 1977.
[6] Hamilton, Wendy L. First Time Authentication for
Airborne Networks (FAAN). DISTRIBUTED
INFINITY LARKSPUR CO, 2010.
[7] Cameron, Peter J., and Queen Mary. Automorphisms of
graphs. Topics in algebraic graph theory, 102 (2004):
137-155.
[8] McKay, Brendan D. Practical graph isomorphism.
Congressus Numerantium, 30:45–87, 1981.
[9] Darga, Paul T., Liffiton, Mark H., Sakallah, Karem A.
and Markov. Igor L., Exploiting structure in symmetry
detection for cnf. DAC, pages 530–534. ACM, 2004.
[10] Katebi,H., Sakallah, Karem A. and Markov., Igor L.,
Symmetry and satisfiability: An update.SAT, of
8. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 03 | Mar-2014, Available @ http://www.ijret.org 660
Lecture Notes in Computer Science, 6175:113–127.
Springer, 2010.
[11] Junttila., Tommi and Kaski. Petteri, Conflict
propagation and component recursion for canon-ical
labeling. Theory and Practice of Algorithms in
(Computer) Systems, Lecture Notes in Computer
Science, 6595:151–162. Springer Berlin / Heidelberg,
2011.
[12] Piperno., Adolfo, Search space contraction in canonical
labeling of graphs (preliminary ver-sion).CoRR,
abs/0804.4881, 2008.
[13] López-Presa, José Luis, Antonio Fernández Anta, and
Luis Núñez Chiroque. "Conauto-2.0: Fast Isomorphism
Testing and Automorphism Group Computation."
arXiv preprint arXiv:1108.1060 (2011).
[14] Knuth, D. "The Art of Computer Programming.
Volume 4A: Combinatorial Algorithm, Part 1." (2011):
202-208.
[15] Agrawal., Monika, Mishra., Pradeep, A Comparative
Survey on Symmetric Key Encryption Techniques,
International Journal on Computer Science &
Engineering; May2012, Vol. 4 Issue 5, p877.
[16] Shah Kruti, R., and Gambhava. Bhavika, New
Approach of Data Encryption Standard Algorithm.,
strings. Vol. 1. 2011.
[17] Sloane, Neil JA. The on-line encyclopedia of integer
sequences. (2010).
[18] Ferland, Kevin. Discrete mathematics: an introduction
to proofs and combinatorics. CengageBrain. com,
2008.
[19] Harary, Frank, John P. Hayes, and Horng-Jyh Wu. A
survey of the theory of hypercube graphs. , Computers
& Mathematics with Applications 15.4 (1988): 277-
289.
[20] American National Standard for Financial Institution
Message Authentication (wholesale), ANSI x9.9-1986
(revised), American Bankers Association, X9
Secretariat, American Bankers Association, 1986.
[21] National Institute of Standards, U.S. Department of
Commerce. FIPS 197: Advanced Encryption
Standard, 2001.
[22] Alanazi, H., Zaidan, B., Zaidan, A., Jalab, H., Shabbir,
M. and Al-Nabhani, Y., New comparative study
between DES, 3DESand AES within nine factors,
Journal of Computing, Vol. 2, Issue 3, pp. 152-
157,March 2010.
[23] Schneier, B., Description of a new variable-length key,
64-bit block cipher (blowfish), Fast Software
Encryption, Cambridge Security Workshop, pp. 191-
204,Springer-VerlagLondon, UK, 1994.
[24] Sison, Ariel M., Bartolome T. Tanguilig III, Bobby D.
Gerardo, and Yung-Cheol Byun. Implementation of
Improved DES Algorithm in Securing Smart Card
Data. In Computer Applications for Software
Engineering, Disaster Recovery, and Business
Continuity, pp. 252-263. Springer Berlin Heidelberg,
2012.
[25] Ammar, A., El Sherbini, A. , Ashour, I. , Shiple, M.,
Random data encryption algorithm (RDEA), Radio
Science Conference, 2005. NRSC 2005. Proceedings of
the Twenty-Second National, 15-17 March 2005.
[26] Hamming, Richard W. Coding and information theory.
Prentice-Hall, Inc., 1986.
[27] Sensarma, D., Banerjee, S., & Basuli, K.. A New
Scheme for Key Exchange. International Journal of
Modern Engineering Research (IJMER), 2(3), 2012.
BIOGRAPHIES
Debajit Sensarma is presently pursuing his
PhD degree from the department of Computer
Science and Engineering, University of
Calcutta, Kolkata, India with DST INSPIRE
Fellowship. He has published several papers in
International journals and conferences.
Dr. Samar Sen Sarma is the founder
member and senior professor of the
Department of Computer Science and
Engineering at the University of Calcutta
(the first multidisciplinary modern university
in South Asia and the oldest institution to
have the “University” status), Kolkata, India. He has published
several papers in International journals and conferences.