In this paper a session based symmetric key cryptographic algorithm has been proposed and it is termed as Matrix Based Bit Jumbling Technique (MBBJT). MBBJT consider the plain text (i.e. the input file) as a binary bit stream with finite number bits. This input bit stream is divided into manageable-sized blocks with different length. The bits of the each block fit diagonally upward starting from ( n , n ) cell in a right to left trajectory into a square matrix of suitable order n. Then the bits are taken from the square matrix columnwise from top to bottom to form the encrypted binary string and from this encrypted string cipher text is formed. Combination of the values of block length and the no. of blocks of a session generates the session key. For decryption the cipher text is considered as a stream of binary bits. After processing the session key information, this binary string is divided into blocks. The bits of the each block fit column-wise from top to bottom into a square matrix of order n. Now bits are taken diagonally upward starting from ( n , n ) cell in a right to left trajectory from the square matrix to form the decrypted binary string. Plain text is regenerated from this binary string. Comparison of MBBJT with existing and industrially accepted TDES and AES has been done.
A General Session Based Bit Level Block Encoding Technique Using Symmetric Ke...ijcseit
In this paper a session based symmetric key cryptographic algorithm has been proposed and it is termed as
Matrix Based Bit Permutation Technique (MBBPT). MBBPT consider the plain text (i.e. the input file) as a
binary bit stream with finite number bits. This input bit stream is divided into manageable-sized blocks with
different length. The bits of the each block fit diagonally upward starting from ( 1 , 1 ) cell in a left to right
trajectory into a square matrix of suitable order n. Then the bits are taken from the square matrix
diagonally upward starting from ( n , n ) cell in a right to left trajectory to form the encrypted binary string
and from this encrypted string cipher text is formed. Combination of the values of block length and the no.
of blocks of a session generates the session key. For decryption the cipher text is considered as a stream of
binary bits. After processing the session key information, this binary string is divided into blocks. The bits
of the each block fit diagonally upward starting from ( n , n ) cell in a right to left trajectory into a square
matrix of suitable order n. Then the bits are taken from the square matrix diagonally upward starting from
( 1 , 1 ) cell in a left to right trajectory to form the decrypted binary string . Plain text is regenerated from
this binary string. Comparison of MBBPT with existing and industrially accepted TDES and AES has been
done.
In this paper, a new method for key generation using Data Encryption Standard (DES) is proposed in order to make it more secure than DES algorithm, but at the same time faster than 3DES algorithm. Some parts of the DES are modified to improve its security and performance aspects. The proposed algorithm is named XS-DES (Extra Secure DES). We modify the process of key generation to improve its level of security, and present the proposed algorithm’s design structure in more detail. We increase the size of the key from 64 bits into 128 bits, and then split the key into two halves, left and right (Kl, Kr), and each one consists of 64 bits. XS-DES will be used to encrypt some important information inside the database, like passwords, exam scores, and other confidential details. In other words, to increase the security in the database and protect it from attackers, all critical information must be encrypted using a strong encryption algorithm and a more secure algorithm (XS-DES) is proposed here. A workable Online Examination System (OES) that applies XS-DES and the original DES algorithms is developed. It has gone through some preliminary testings and a comparison is performed between the results of these algorithms based on their strengths in handling database attackers.
The document proposes a method for authenticating compressed medical images using CDMA watermarking and EMRC6 encryption. The method works as follows:
1) The input image is compressed using JPEG2000. 2) The watermark is encrypted using the EMRC6 encryption algorithm. 3) The encrypted watermark is encoded using CDMA. 4) The encoded watermark is embedded into the compressed cover image using CDMA watermarking in the spatial domain. This provides authentication with high image quality and security against attacks.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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
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.
This document discusses enhancements to the prefix cipher model for format preserving encryption (FPE). It begins with background on FPE and its importance for preserving data formats and integrity during encryption. It then examines existing FPE techniques like prefix cipher, cycle walking, and Feistel networks. The author proposes a new PREFIX-II method that modifies the prefix cipher approach by selecting single digits from pseudo-random weights rather than storing full hexadecimal values, reducing time and memory costs. The method encrypts credit card numbers into ciphertext of the same length and format through repeated digit selection and arithmetic operations. Performance analysis suggests PREFIX-II encryption and decryption is faster than the original prefix cipher approach.
A General Session Based Bit Level Block Encoding Technique Using Symmetric Ke...ijcseit
In this paper a session based symmetric key cryptographic algorithm has been proposed and it is termed as
Matrix Based Bit Permutation Technique (MBBPT). MBBPT consider the plain text (i.e. the input file) as a
binary bit stream with finite number bits. This input bit stream is divided into manageable-sized blocks with
different length. The bits of the each block fit diagonally upward starting from ( 1 , 1 ) cell in a left to right
trajectory into a square matrix of suitable order n. Then the bits are taken from the square matrix
diagonally upward starting from ( n , n ) cell in a right to left trajectory to form the encrypted binary string
and from this encrypted string cipher text is formed. Combination of the values of block length and the no.
of blocks of a session generates the session key. For decryption the cipher text is considered as a stream of
binary bits. After processing the session key information, this binary string is divided into blocks. The bits
of the each block fit diagonally upward starting from ( n , n ) cell in a right to left trajectory into a square
matrix of suitable order n. Then the bits are taken from the square matrix diagonally upward starting from
( 1 , 1 ) cell in a left to right trajectory to form the decrypted binary string . Plain text is regenerated from
this binary string. Comparison of MBBPT with existing and industrially accepted TDES and AES has been
done.
In this paper, a new method for key generation using Data Encryption Standard (DES) is proposed in order to make it more secure than DES algorithm, but at the same time faster than 3DES algorithm. Some parts of the DES are modified to improve its security and performance aspects. The proposed algorithm is named XS-DES (Extra Secure DES). We modify the process of key generation to improve its level of security, and present the proposed algorithm’s design structure in more detail. We increase the size of the key from 64 bits into 128 bits, and then split the key into two halves, left and right (Kl, Kr), and each one consists of 64 bits. XS-DES will be used to encrypt some important information inside the database, like passwords, exam scores, and other confidential details. In other words, to increase the security in the database and protect it from attackers, all critical information must be encrypted using a strong encryption algorithm and a more secure algorithm (XS-DES) is proposed here. A workable Online Examination System (OES) that applies XS-DES and the original DES algorithms is developed. It has gone through some preliminary testings and a comparison is performed between the results of these algorithms based on their strengths in handling database attackers.
The document proposes a method for authenticating compressed medical images using CDMA watermarking and EMRC6 encryption. The method works as follows:
1) The input image is compressed using JPEG2000. 2) The watermark is encrypted using the EMRC6 encryption algorithm. 3) The encrypted watermark is encoded using CDMA. 4) The encoded watermark is embedded into the compressed cover image using CDMA watermarking in the spatial domain. This provides authentication with high image quality and security against attacks.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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
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.
This document discusses enhancements to the prefix cipher model for format preserving encryption (FPE). It begins with background on FPE and its importance for preserving data formats and integrity during encryption. It then examines existing FPE techniques like prefix cipher, cycle walking, and Feistel networks. The author proposes a new PREFIX-II method that modifies the prefix cipher approach by selecting single digits from pseudo-random weights rather than storing full hexadecimal values, reducing time and memory costs. The method encrypts credit card numbers into ciphertext of the same length and format through repeated digit selection and arithmetic operations. Performance analysis suggests PREFIX-II encryption and decryption is faster than the original prefix cipher approach.
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.
Image encryption using jumbling saltingMauryasuraj98
In this project we have implemented the modified JS algorithm and later compared it with other similar functioning algorithms such as AES, DES and Jumbling Salting Algorithm.
Also we have done this by using a throughput value that is considered as measure for comparing the effectiveness of these algorithms. Basically the throughput value indicates the number of Megabytes of image encrypted with respect to time taken to encrypt the image.
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.
CONSTRUCTING THE 2-ELEMENT AGDS PROTOCOL BASED ON THE DISCRETE LOGARITHM PROBLEMIJNSA Journal
It is considered a group signature scheme in frame of which different sets of signers sign electronic documents with hidden signatures and the head of the signing group generates a group signature of fixed size. A new mechanism for imbedding the information about signers into a group signature is proposed. The method provides possibilities for reducing the signature size and to construct collective signature protocols for signing groups. New group signature and collective signature protocols based on the computational difficulty of discrete logarithm are proposed.
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
PERFORMANCE ANALYSIS OF PARALLEL IMPLEMENTATION OF ADVANCED ENCRYPTION STANDA...ijistjournal
Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. Most cryptographic algorithms function more efficiently when implemented in hardware than in software running on single processor. However, systems that use hardware implementations have significant drawbacks: they are unable to respond to flaws discovered in the implemented algorithm or to changes in standards. As an alternative, it is possible to implement cryptographic algorithms in software running on multiple processors. However, most of the cryptographic algorithms like DES (Data Encryption Standard) or 3DES have some drawbacks when implemented in software: DES is no longer secure as computers get more powerful while 3DES is relatively sluggish in software. AES (Advanced Encryption Standard), which is rapidly being adopted worldwide, provides a better combination of performance and enhanced network security than DES or 3DES by being computationally more efficient than these earlier standards. Furthermore, by supporting large key sizes of 128, 192, and 256 bits, AES offers higher security against brute-force attacks.
In this paper, AES has been implemented with single processor. Then the result has been compared with parallel implementations of AES with 2 varying different parameters such as key size, number of rounds and extended key size, and show how parallel implementation of the AES offers better performance yet flexible enough for cryptographic algorithms.
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeIJERD Editor
- Data over the cloud is transferred or transmitted between servers and users. Privacy of that
data is very important as it belongs to personal information. If data get hacked by the hacker, can be
used to defame a person’s social data. Sometimes delay are held during data transmission. i.e. Mobile
communication, bandwidth is low. Hence compression algorithms are proposed for fast and efficient
transmission, encryption is used for security purposes and blurring is used by providing additional
layers of security. These algorithms are hybridized for having a robust and efficient security and
transmission over cloud storage system.
A combined approach using triple des and blowfish research areaeSAT Journals
Abstract Payment card fraud is causing billions of dollars in losses for the card payment industry. Besides direct losses, the brand name can be affected by loss of consumer confidence due to the fraud. As a result of these growing losses, financial institutions and card issuers are continually seeking new techniques and innovation in payment card fraud detection and prevention. Credit card fraud falls broadly into two categories: behavioral fraud and application fraud. Credit card transactions continue to grow in number, taking an ever-larger share of the US payment system and leading to a higher rate of stolen account numbers and subsequent losses by banks. Improved fraud detection thus has become essential to maintain the viability of the US payment system. Increasingly, the card not present scenario, such as shopping on the internet poses a greater threat as the merchant (the web site) is no longer protected with advantages of physical verification such as signature check, photo identification, etc. In fact, it is almost impossible to perform any of the ‘physical world’ checks necessary to detect who is at the other end of the transaction. This makes the internet extremely attractive to fraud perpetrators. According to a recent survey, the rate at which internet fraud occurs is 20 to25 times higher than ‘physical world’ fraud. However, recent technical developments are showing some promise to check fraud in the card not present scenario. This paper provides an overview of payment card fraud and begins with payment card statistics and the definition of payment card fraud. It also describes various methods used by identity thieves to obtain personal and financial information for the purpose of payment card fraud. In addition, relationship between payment card fraud detection is provided. Finally, some solutions for detecting payment card fraud are also given. Index Terms: Online Frauds, Fraudsters, card fraud, CNP, CVV, AVS
A NOVEL DATA ENCRYPTION TECHNIQUE BY GENETIC CROSSOVER OF ROBUST BIOMETRIC KE...IJNSA Journal
In Fingerprint based Biometric authentication image of the fingerprint can be scanned and can be used later on for the purpose of authentication. So this process does not provide very high security. This paper proposes another level of security by using the concept of combined key. The key is obtained by crossing over of the Session key generated from the password given by the legitimate user and the Biometric key generated from the fingerprint of the same user. The proposed approach trained the system by Artificial Neural Network in such a way that a small portion of the fingerprint is enough to generate the Biometric key which minimizes the chance of false rejection. So in this approach there is a significant improvement of the traditional authentication techniques.
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 hybrid method in watermarking using DCT and AESIJERD Editor
In this paper I'm trying to make a combination between the encryption by using one of the most
powerful algorithm called Advanced Encryption Standard (AES) to encrypt a secret message another word logo
and then embed it in the digital image in frequency domain by using the Discrete Cosine Transform (DCT) in
low frequency to increase the robustness and then applying some attacks to check it.
The document discusses cryptographic hash functions, including an overview of their usage, properties, structures, attacks, and the need for a new secure hash standard. It describes how hash functions work by condensing arbitrary messages into fixed-size message digests. The properties of preimage resistance, second preimage resistance, and collision resistance are explained. Common hashing algorithms like MD5, SHA-1, and SHA-2 are outlined along with vulnerabilities like birthday attacks. The document concludes by noting the need to replace standards like MD5 and SHA-1 due to successful cryptanalysis attacks.
This document proposes an efficient and secure cryptography technique using unimodular matrices. It aims to improve data security during transmission by encrypting messages. The proposed method encrypts data into a matrix form using ASCII values, then multiplies it by an encoding matrix generated from an Armstrong number. At the receiver end, the cipher text matrix is decrypted by multiplying it by the inverse of the encoding matrix. This overcomes limitations of previous techniques by allowing any length messages and not relying on Armstrong numbers containing zeros. The method ensures confidentiality, access control and non-repudiation through the use of encryption and decryption with the same secret key.
Ciphering algorithms play a main role in information security systems. Therefore in this paper we are
considering the important performance of these algorithms like CPU time consumption, memory usage and
battery usage. This research tries to demonstrate a fair comparison between the most common algorithms
and with a novel method called Secured Watermark System (SWS) in data encryption field according to
CPU time, packet size and power consumption. It provides a comparison the most known algorithms used
in encryption: AES (Rijndael), DES, Blowfish, and Secured Watermark System (SWS).
For comparing these algorithms with each other variations of data block sizes, and a variation of
encryption-decryption speeds where used in this research.
In addition a comparison with different platforms such as Windows 8, Windows XP and Linux has been
conducted. Finally the results of the experimentation demonstrate the performance and efficiency of the
compared encryption algorithms with different parameters.
Image encryption and decryption using aes algorithmIAEME Publication
This document summarizes an article that describes using the AES algorithm to encrypt and decrypt images. It begins with background on AES and its advantages over DES such as larger key sizes. It then describes modifications made to the AES key expansion to improve encryption quality and avalanche effect. The implementation takes an input key, generates expanded keys using a modified key expansion, then encrypts images by applying AES operations to blocks of 16 pixels using the expanded keys. Decryption reverses this process to recover the original image. Results show the encrypted image is secure and decrypts correctly when using the proper key.
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.
A novel secure combination technique of steganography and cryptographyZac Darcy
A new technique proposed with the combination of cryptography and steganography enhanced with new
secure feature for generating a new security system. Cryptography and Steganography are two popular
ways for secure data transmission in which the former distorts a message so it cannot be understood and
another hides a message so it cannot be seen. In cryptography, this system is used advanced encryption
standard (AES) algorithm to encrypt secret message and then these are separated keys; one of which is
used to hide in cover image. In steganography, a part of encrypted message as a key is used to hide in
discrete cosine transform (DCT) of an image which is highly secured. This kind of system is to be
introduced in applications such as transferring secret data that can be authentication of various fields.
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...IJNSA Journal
In this technical paper a session based symmetric key cryptographic technique, termed as SBSKCT, has been proposed. This proposed technique is very secure and suitable for encryption of large files of any type. SBSKCT considers the plain text as a string with finite no. of binary bits. This input binary string is broken down into blocks of various sizes (of 2k
order where k = 3, 4, 5, ….). The encrypted binary string
is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string cipher text is formed. Combination of values of block length, no. of blocks and no. of iterations generates the session based key for SBSKCT. For decryption the cipher text is considered as
binary string. Using the session key information, this binary string is broken down into blocks. The decrypted binary string is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string plain text is reformed. A comparison of SBSKCT with existing and industrially accepted TDES and AES has been done.
A Block Cipher Based Cryptosystem through Modified Forward Backward Overlappe...IOSR Journals
This document proposes a new block cipher cryptosystem called Modified Forward Backward Overlapped Modulo Arithmetic Technique (MFBOMAT). MFBOMAT divides a message into blocks of varying sizes from 2 to 256 bits. It then performs modular addition on overlapping pairs of blocks in a cascading manner from the most to least significant bits. For decryption, modular subtraction is used. The algorithm is implemented on sample 32-bit messages to demonstrate the encryption and decryption process. Analysis shows the encrypted text is well distributed over the character space providing security. MFBOMAT encryption time is comparable to other techniques like RSA and FBOMAT based on tests on sample files.
FPGA Implementation of an Area Optimized Architecture for 128 bit AES AlgorithmIJERA Editor
This paper aims at FPGA Implementation of an Area Optimized Architecture for 128 bit AES Algorithm. The
conventional designs use a separate module for 32 bit byte substitution and 128 bit byte substitution. The 32 bit
byte substitution is used in round key generation and the 128 bit byte substitution is used in the rounds. This
report presents a modified architecture of 128 bit byte substitution module using a single 32 bit byte substitution
module to reduce area.The AES encryption and decryption algorithm were designed using Verilog HDL. The
functionality of the modules were checked using ModelSim. The simulations were carried out in ModelSim and
Quartus II. The algorithm was implemented in FPGA and achieved a 2% reduction in the total logic element
utilization
Security Analysis of AES and Enhancing its Security by Modifying S-Box with a...IJCNCJournal
The document analyzes the security of the Advanced Encryption Standard (AES) algorithm and proposes a modification to enhance its security. It summarizes AES, including its key expansion process, rounds, and steps. It then evaluates AES-128 security based on time security against brute force attacks and avalanche effect criteria. The authors propose modifying AES by XORing an additional random byte with the s-box value to increase time security and strict avalanche criterion. Security measurements of the modified AES sometimes fluctuate due to the random additional key.
This document proposes a new encryption algorithm called Byte Rotation Encryption Algorithm (BREA). BREA is a symmetric key, block cipher that encrypts fixed-length blocks of 16 bytes using byte rotation and a randomly generated 16 byte key matrix. It employs a multithreading model to encrypt blocks in parallel, improving encryption speed. The algorithm assigns numbers 1-26 to letters, adds the plaintext and key matrices, then rotates rows and columns before replacing values with letters to generate the ciphertext. BREA is designed to be faster and require fewer resources than previous algorithms while still providing secure encryption.
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.
Image encryption using jumbling saltingMauryasuraj98
In this project we have implemented the modified JS algorithm and later compared it with other similar functioning algorithms such as AES, DES and Jumbling Salting Algorithm.
Also we have done this by using a throughput value that is considered as measure for comparing the effectiveness of these algorithms. Basically the throughput value indicates the number of Megabytes of image encrypted with respect to time taken to encrypt the image.
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.
CONSTRUCTING THE 2-ELEMENT AGDS PROTOCOL BASED ON THE DISCRETE LOGARITHM PROBLEMIJNSA Journal
It is considered a group signature scheme in frame of which different sets of signers sign electronic documents with hidden signatures and the head of the signing group generates a group signature of fixed size. A new mechanism for imbedding the information about signers into a group signature is proposed. The method provides possibilities for reducing the signature size and to construct collective signature protocols for signing groups. New group signature and collective signature protocols based on the computational difficulty of discrete logarithm are proposed.
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
PERFORMANCE ANALYSIS OF PARALLEL IMPLEMENTATION OF ADVANCED ENCRYPTION STANDA...ijistjournal
Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. Most cryptographic algorithms function more efficiently when implemented in hardware than in software running on single processor. However, systems that use hardware implementations have significant drawbacks: they are unable to respond to flaws discovered in the implemented algorithm or to changes in standards. As an alternative, it is possible to implement cryptographic algorithms in software running on multiple processors. However, most of the cryptographic algorithms like DES (Data Encryption Standard) or 3DES have some drawbacks when implemented in software: DES is no longer secure as computers get more powerful while 3DES is relatively sluggish in software. AES (Advanced Encryption Standard), which is rapidly being adopted worldwide, provides a better combination of performance and enhanced network security than DES or 3DES by being computationally more efficient than these earlier standards. Furthermore, by supporting large key sizes of 128, 192, and 256 bits, AES offers higher security against brute-force attacks.
In this paper, AES has been implemented with single processor. Then the result has been compared with parallel implementations of AES with 2 varying different parameters such as key size, number of rounds and extended key size, and show how parallel implementation of the AES offers better performance yet flexible enough for cryptographic algorithms.
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeIJERD Editor
- Data over the cloud is transferred or transmitted between servers and users. Privacy of that
data is very important as it belongs to personal information. If data get hacked by the hacker, can be
used to defame a person’s social data. Sometimes delay are held during data transmission. i.e. Mobile
communication, bandwidth is low. Hence compression algorithms are proposed for fast and efficient
transmission, encryption is used for security purposes and blurring is used by providing additional
layers of security. These algorithms are hybridized for having a robust and efficient security and
transmission over cloud storage system.
A combined approach using triple des and blowfish research areaeSAT Journals
Abstract Payment card fraud is causing billions of dollars in losses for the card payment industry. Besides direct losses, the brand name can be affected by loss of consumer confidence due to the fraud. As a result of these growing losses, financial institutions and card issuers are continually seeking new techniques and innovation in payment card fraud detection and prevention. Credit card fraud falls broadly into two categories: behavioral fraud and application fraud. Credit card transactions continue to grow in number, taking an ever-larger share of the US payment system and leading to a higher rate of stolen account numbers and subsequent losses by banks. Improved fraud detection thus has become essential to maintain the viability of the US payment system. Increasingly, the card not present scenario, such as shopping on the internet poses a greater threat as the merchant (the web site) is no longer protected with advantages of physical verification such as signature check, photo identification, etc. In fact, it is almost impossible to perform any of the ‘physical world’ checks necessary to detect who is at the other end of the transaction. This makes the internet extremely attractive to fraud perpetrators. According to a recent survey, the rate at which internet fraud occurs is 20 to25 times higher than ‘physical world’ fraud. However, recent technical developments are showing some promise to check fraud in the card not present scenario. This paper provides an overview of payment card fraud and begins with payment card statistics and the definition of payment card fraud. It also describes various methods used by identity thieves to obtain personal and financial information for the purpose of payment card fraud. In addition, relationship between payment card fraud detection is provided. Finally, some solutions for detecting payment card fraud are also given. Index Terms: Online Frauds, Fraudsters, card fraud, CNP, CVV, AVS
A NOVEL DATA ENCRYPTION TECHNIQUE BY GENETIC CROSSOVER OF ROBUST BIOMETRIC KE...IJNSA Journal
In Fingerprint based Biometric authentication image of the fingerprint can be scanned and can be used later on for the purpose of authentication. So this process does not provide very high security. This paper proposes another level of security by using the concept of combined key. The key is obtained by crossing over of the Session key generated from the password given by the legitimate user and the Biometric key generated from the fingerprint of the same user. The proposed approach trained the system by Artificial Neural Network in such a way that a small portion of the fingerprint is enough to generate the Biometric key which minimizes the chance of false rejection. So in this approach there is a significant improvement of the traditional authentication techniques.
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 hybrid method in watermarking using DCT and AESIJERD Editor
In this paper I'm trying to make a combination between the encryption by using one of the most
powerful algorithm called Advanced Encryption Standard (AES) to encrypt a secret message another word logo
and then embed it in the digital image in frequency domain by using the Discrete Cosine Transform (DCT) in
low frequency to increase the robustness and then applying some attacks to check it.
The document discusses cryptographic hash functions, including an overview of their usage, properties, structures, attacks, and the need for a new secure hash standard. It describes how hash functions work by condensing arbitrary messages into fixed-size message digests. The properties of preimage resistance, second preimage resistance, and collision resistance are explained. Common hashing algorithms like MD5, SHA-1, and SHA-2 are outlined along with vulnerabilities like birthday attacks. The document concludes by noting the need to replace standards like MD5 and SHA-1 due to successful cryptanalysis attacks.
This document proposes an efficient and secure cryptography technique using unimodular matrices. It aims to improve data security during transmission by encrypting messages. The proposed method encrypts data into a matrix form using ASCII values, then multiplies it by an encoding matrix generated from an Armstrong number. At the receiver end, the cipher text matrix is decrypted by multiplying it by the inverse of the encoding matrix. This overcomes limitations of previous techniques by allowing any length messages and not relying on Armstrong numbers containing zeros. The method ensures confidentiality, access control and non-repudiation through the use of encryption and decryption with the same secret key.
Ciphering algorithms play a main role in information security systems. Therefore in this paper we are
considering the important performance of these algorithms like CPU time consumption, memory usage and
battery usage. This research tries to demonstrate a fair comparison between the most common algorithms
and with a novel method called Secured Watermark System (SWS) in data encryption field according to
CPU time, packet size and power consumption. It provides a comparison the most known algorithms used
in encryption: AES (Rijndael), DES, Blowfish, and Secured Watermark System (SWS).
For comparing these algorithms with each other variations of data block sizes, and a variation of
encryption-decryption speeds where used in this research.
In addition a comparison with different platforms such as Windows 8, Windows XP and Linux has been
conducted. Finally the results of the experimentation demonstrate the performance and efficiency of the
compared encryption algorithms with different parameters.
Image encryption and decryption using aes algorithmIAEME Publication
This document summarizes an article that describes using the AES algorithm to encrypt and decrypt images. It begins with background on AES and its advantages over DES such as larger key sizes. It then describes modifications made to the AES key expansion to improve encryption quality and avalanche effect. The implementation takes an input key, generates expanded keys using a modified key expansion, then encrypts images by applying AES operations to blocks of 16 pixels using the expanded keys. Decryption reverses this process to recover the original image. Results show the encrypted image is secure and decrypts correctly when using the proper key.
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.
A novel secure combination technique of steganography and cryptographyZac Darcy
A new technique proposed with the combination of cryptography and steganography enhanced with new
secure feature for generating a new security system. Cryptography and Steganography are two popular
ways for secure data transmission in which the former distorts a message so it cannot be understood and
another hides a message so it cannot be seen. In cryptography, this system is used advanced encryption
standard (AES) algorithm to encrypt secret message and then these are separated keys; one of which is
used to hide in cover image. In steganography, a part of encrypted message as a key is used to hide in
discrete cosine transform (DCT) of an image which is highly secured. This kind of system is to be
introduced in applications such as transferring secret data that can be authentication of various fields.
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...IJNSA Journal
In this technical paper a session based symmetric key cryptographic technique, termed as SBSKCT, has been proposed. This proposed technique is very secure and suitable for encryption of large files of any type. SBSKCT considers the plain text as a string with finite no. of binary bits. This input binary string is broken down into blocks of various sizes (of 2k
order where k = 3, 4, 5, ….). The encrypted binary string
is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string cipher text is formed. Combination of values of block length, no. of blocks and no. of iterations generates the session based key for SBSKCT. For decryption the cipher text is considered as
binary string. Using the session key information, this binary string is broken down into blocks. The decrypted binary string is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string plain text is reformed. A comparison of SBSKCT with existing and industrially accepted TDES and AES has been done.
A Block Cipher Based Cryptosystem through Modified Forward Backward Overlappe...IOSR Journals
This document proposes a new block cipher cryptosystem called Modified Forward Backward Overlapped Modulo Arithmetic Technique (MFBOMAT). MFBOMAT divides a message into blocks of varying sizes from 2 to 256 bits. It then performs modular addition on overlapping pairs of blocks in a cascading manner from the most to least significant bits. For decryption, modular subtraction is used. The algorithm is implemented on sample 32-bit messages to demonstrate the encryption and decryption process. Analysis shows the encrypted text is well distributed over the character space providing security. MFBOMAT encryption time is comparable to other techniques like RSA and FBOMAT based on tests on sample files.
FPGA Implementation of an Area Optimized Architecture for 128 bit AES AlgorithmIJERA Editor
This paper aims at FPGA Implementation of an Area Optimized Architecture for 128 bit AES Algorithm. The
conventional designs use a separate module for 32 bit byte substitution and 128 bit byte substitution. The 32 bit
byte substitution is used in round key generation and the 128 bit byte substitution is used in the rounds. This
report presents a modified architecture of 128 bit byte substitution module using a single 32 bit byte substitution
module to reduce area.The AES encryption and decryption algorithm were designed using Verilog HDL. The
functionality of the modules were checked using ModelSim. The simulations were carried out in ModelSim and
Quartus II. The algorithm was implemented in FPGA and achieved a 2% reduction in the total logic element
utilization
Security Analysis of AES and Enhancing its Security by Modifying S-Box with a...IJCNCJournal
The document analyzes the security of the Advanced Encryption Standard (AES) algorithm and proposes a modification to enhance its security. It summarizes AES, including its key expansion process, rounds, and steps. It then evaluates AES-128 security based on time security against brute force attacks and avalanche effect criteria. The authors propose modifying AES by XORing an additional random byte with the s-box value to increase time security and strict avalanche criterion. Security measurements of the modified AES sometimes fluctuate due to the random additional key.
This document proposes a new encryption algorithm called Byte Rotation Encryption Algorithm (BREA). BREA is a symmetric key, block cipher that encrypts fixed-length blocks of 16 bytes using byte rotation and a randomly generated 16 byte key matrix. It employs a multithreading model to encrypt blocks in parallel, improving encryption speed. The algorithm assigns numbers 1-26 to letters, adds the plaintext and key matrices, then rotates rows and columns before replacing values with letters to generate the ciphertext. BREA is designed to be faster and require fewer resources than previous algorithms while still providing secure encryption.
An odd even block cipher based cryptosystem through modulo arithmatic techniq...eSAT Journals
Abstract In this paper, a new Cryptosystem based on block cipher has been proposed where the encryption is done through Odd Even Modulo Arithmetic Technique (OEMAT). The original message is considered as a stream of bits, which is then divided into a number of blocks, each containing n bits, where n is any one of 2, 4, 8, 16, 32, 64, 128, 256. The first and the penultimate blocks are then added where the modulus of addition is 2n. The result replaces the penultimate block (say (N-1th) block), first block remaining unchanged. In the next attempt the second and the ultimate blocks (say Nth block) are added and the result replaces the Nth block. This process continues until all the blocks are executed. The modulo addition has been implemented in a very simple manner where the carry out of the MSB is discarded to get the result. The technique is applied in a cascaded manner by varying the block size from 2 to 256. The whole technique has been implemented by using a modulo subtraction technique for decryption. Keywords: MFBOMAT, FBOMAT, Symmetric block cipher, Cryptosystem
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 fangled symmetric block cipher using zig-zag scan patternseSAT Journals
Abstract In today’s world of Information Technology, information storage and distribution is very important. To secure the data in the network, one need to protect the data using cipher algorithms. This paper presents a novel symmetric block cipher which ciphers data using zig-zag scan patterns. The input data is divided into manageable size of blocks. Each block of data is taken as an input and produces the corresponding cipher text. The data is arranged in a corresponding matrix of manageable size using the zig-zag scan pattern. Then again it is divided into number of 2x2 sub matrices. Cipher text can be retrieved from each 2x2 sub matrix by reading column wise. The Cipher is tested with time complexity, frequency analysis, and with homogeneity testing. Keywords: Symmetric Ciphers, block Ciphers, Cryptography, Zig-Zag Scan Patterns, DES
Abstract
There is great research going on in the field of data security nowadays. Protecting information from disclosure and breach is of high importance to users personally and to organizations and businesses around the world, as most of information currently are sensitive electronic information transferred over the internet and stored in cloud based system. In this paper, we propose a method to increase the security of messages transferred on the internet, or information stored in the cloud. Our proposed method mainly relies on the Triple Data Encryption Standard (TDES) algorithm. TDES is intact the Data Encryption Standard repeated three times in succession to encrypt data. TDES is considered highly secure as there is no applicable method to break the code itself without knowing the key. We propose to encrypt the key using Cipher Feedback Block algorithm, before using TDES to encrypt data. Such that even when the key is disclosed, the key itself cannot decipher the ciphered text without enciphering the key with CFB. This introduces a new dimension of security to the TDES algorithm.
The method introduced in this paper increases the security of the TDES algorithm using CFB algorithm by increasing the key security, such that it is actually not possible to decipher the text without prior knowledge and agreement of key and algorithms used.
Keywords: Data Encryption Standard, Triple Data Encryption Algorithm, Cipher Feedback Block.
This document describes the design and implementation of a hybrid cryptosystem using the AES and SHA-2 algorithms. The system integrates AES, a symmetric encryption algorithm, with SHA-2, a cryptographic hash function, to improve data security. AES encrypts data using a 128-bit key generated by hashing the input message with SHA-2. The combined system was synthesized using Xilinx ISE software and implemented on a Virtex-5 FPGA, utilizing under 2% of slice registers and 5% of slice LUTs. This provides higher security than AES alone through increased algorithm complexity.
RANDOMIZATION-BASED BLOCK CIPHER WITH KEY-MAPPED S-BOX SELECTIONijcisjournal
This document describes a new block cipher algorithm that uses randomization-based expansion and a substitution-permutation network with key-mapped S-boxes. The algorithm takes plaintext blocks of 240 bits and expands them to 256 bits using XOR with a randomly generated 16-bit string. It then performs 64 rounds of substitution and permutation on the expanded text. S-boxes are selected in each round based on subkey values, and CBC mode is identified as suitable for the algorithm. Analysis shows about 128 bits change between plaintext and ciphertext on average, providing resistance to correlation attacks.
Randomization Based Block Cipher with Key Mapped S-Box SelectionFull Text ijcisjournal
This paper proposes a new system of Substitution-Permutation network along with Randomization
Expansion of 240 bits of input data. System uses 16 S-Boxes which are selected randomly based on the subkey
values throughout 64 rounds of substitution steps. 64 sub-keys are generated during the SubstitutionPermutation
process. The middletext is transposed based on decimal value of the sub-key generated during
the each round. A CBC mode is the best associated with this system.
Hardware implementation of aes encryption and decryption for low area & power...eSAT Publishing House
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
This document contains definitions and explanations of various cryptographic concepts and techniques:
- It defines traffic analysis attacks, rail fence transposition, block ciphers vs stream ciphers, cryptanalysis vs brute force attacks, unconditionally secure vs computationally secure ciphers, the Caesar cipher, monoalphabetic ciphers, Playfair ciphers, one-time pads, transposition ciphers, steganography, and Feistel ciphers.
- It also explains concepts like diffusion vs confusion, the purpose of S-boxes in DES, the avalanche effect, monoalphabetic vs polyalphabetic ciphers, and criteria for evaluating AES candidates.
The document describes the implementation of the Advanced Encryption Standard (AES) algorithm in Matlab. It includes:
1) An introduction to AES that describes its motivation, definitions, requirements and overall processes.
2) A high-level design section explaining the AES algorithm, its overall structure consisting of key expansion, encryption and decryption processes using operations like SubBytes, ShiftRows, MixColumns and AddRoundKey.
3) A detailed design section describing the individual operations for both encryption and decryption, including pseudo-code. It also provides illustrations of the operations.
4) Sections on key expansion and results from implementing the AES algorithm in Matlab.
The document discusses stream ciphers and block ciphers. It explains that stream ciphers encrypt data bit-by-bit or byte-by-byte, requiring a randomly generated keystream, while block ciphers encrypt fixed-length blocks, allowing for broader applications. It then focuses on the Feistel cipher structure for block ciphers, proposed by Feistel to approximate an ideal block cipher for large block sizes. The Feistel structure uses a product cipher approach involving substitutions and permutations to provide diffusion and confusion and resist statistical cryptanalysis.
Design of area optimized aes encryption core using pipelining technologyIAEME Publication
This document summarizes a research paper that proposes a new pipelined design for the AES-128 encryption algorithm to optimize chip area. The design divides the 128-bit plaintext, key, and ciphertext into four 32-bit units and processes them in parallel through 10 pipeline stages, one for each round of encryption. Simulation results show the new design significantly reduces chip pins and area compared to the original iterative design while maintaining encryption speed.
Efficient Fpe Algorithm For Encrypting Credit Card NumbersIOSR Journals
This document proposes an efficient format-preserving encryption (FPE) algorithm for encrypting credit card numbers. The algorithm uses AES-128 encryption and adds two additional steps to retain the plaintext format of 16 decimal digits. Specifically, it divides the 128-bit ciphertext into blocks, performs an XOR operation between blocks, and then converts the resulting hexadecimal values to decimal digits. This allows encryption without changing the database structure or queries. The proposed algorithm is faster and requires no additional storage compared to existing FPE techniques like prefix encryption, cycle walking, or Feistel networks. It provides an efficient way to encrypt sensitive numeric fields like credit cards while preserving functionality.
The importance of cryptography knuckle down to the security in electronic data transmissions has gained an essential relevance during past years. Cryptography security mechanisms uses some algorithms to muddle the data into unreadable text with a key which can only be decoded/decrypted by one who has that associated key for the locked data. Cryptography techniques are of two types: Symmetric & Asymmetric. In this paper we’ve used symmetric cryptography method-Advance Encryption Standard algorithm with 200 bit block size as well as 200 bit key size. We’ve used 5*5 matrix to implement same 128 bit conventional AES algorithm for 200 bit block size. After implementing the algorithm, the proposed work is compared with 128,192 & 256 bits AES techniques in context with Encryption and Decryption Time & Throughput at both Encryption and Decryption ends.
International Journal of Computational Engineering Research(IJCER) ijceronline
nternational Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Similar to A Universal Bit Level Block Encoding Technique Using Session Based Symmetric Key Cryptography to Enhance the Information Security (20)
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
Leveraging Generative AI to Drive Nonprofit InnovationTechSoup
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
How to Fix the Import Error in the Odoo 17Celine George
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptxEduSkills OECD
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
Chapter wise All Notes of First year Basic Civil Engineering.pptxDenish Jangid
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
How to Setup Warehouse & Location in Odoo 17 InventoryCeline George
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
How to Create a More Engaging and Human Online Learning Experience
A Universal Bit Level Block Encoding Technique Using Session Based Symmetric Key Cryptography to Enhance the Information Security
1. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
DOI : 10.5121/ijait.2012.2203 29
A Universal Bit Level Block Encoding Technique
Using Session Based Symmetric Key Cryptography
to Enhance the Information Security
Manas Paul1
and Jyotsna Kumar Mandal2
1
Dept. of Comp. Application, JIS College of Engineering, Kalyani, West Bengal, India
manaspaul@rediffmail.com
2
Dept. of C.S.E., Kalyani University, Kalyani, West Bengal, India
jkmandal@rediffmail.com
ABSTRACT
In this paper a session based symmetric key cryptographic algorithm has been proposed and it is termed as
Matrix Based Bit Jumbling Technique (MBBJT). MBBJT consider the plain text (i.e. the input file) as a
binary bit stream with finite number bits. This input bit stream is divided into manageable-sized blocks with
different length. The bits of the each block fit diagonally upward starting from ( n , n ) cell in a right to left
trajectory into a square matrix of suitable order n. Then the bits are taken from the square matrix column-
wise from top to bottom to form the encrypted binary string and from this encrypted string cipher text is
formed. Combination of the values of block length and the no. of blocks of a session generates the session
key. For decryption the cipher text is considered as a stream of binary bits. After processing the session key
information, this binary string is divided into blocks. The bits of the each block fit column-wise from top to
bottom into a square matrix of order n. Now bits are taken diagonally upward starting from ( n , n ) cell in
a right to left trajectory from the square matrix to form the decrypted binary string. Plain text is
regenerated from this binary string. Comparison of MBBJT with existing and industrially accepted TDES
and AES has been done.
KEYWORDS
Matrix Based Bit Jumbling Technique (MBBJT), Cryptography, Symmetric Key, Session Based Key, TDES,
AES.
1. INTRODUCTION
Day by day our communication becomes faster and simpler for internet. Every computer is
connected virtually to each other through internet. Securing electronic data is gradually becoming
important with the increasing dependency on the data interchange by the internet. Hence network
security is the most focused topic among the researchers [1, 2, 3, 4]. Various cryptographic
algorithms are available but each of them has their own merits and demerits. As a result
continuous research works are going on in this field of cryptography to enhance the network
security.
2. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
30
Based on symmetric key cryptography a new technique has been proposed where the plain text is
considered as a stream of binary bits. Bit positions are jumbled up to generate the cipher text. A
session key is generated using plain text information. The plain text can be regenerated from the
cipher text using the session key information.
Section 2 of this paper contains the block diagram of the proposed scheme. Section 3 deals with
the algorithms of encryption, decryption and key generation. Section 4 explains the proposed
technique with an example. Section 5 shows the results and analysis on different files with
different sizes and the comparison of the proposed MBBJT with TDES [5], AES [6]. Conclusions
are drawn in the section 6.
2. THE SCHEME
The MBBJT algorithm consists of three major components:
• Key Generation
• Encryption Mechanism
• Decryption Mechanism
Key Generation:
Encryption Mechanism:
Decryption Mechanism:
3. PROPOSED ALGORITHM
3.1. Encryption Algorithm:
Step 1. The plain text i.e. the input file is considered as a binary bit stream of finite no. of bits.
Step 2. This binary stream breaks into manageable-sized blocks with different lengths like 4 / 16 /
64 / 144 / 256 / 400 / ……….. [ (4n)2
for n = 1/2, 1, 2, 3, 4, 5, ……. ] as follows:
First n1 no. of bits is considered as x1 no. of blocks with block length y1 where n1 = x1 * y1. Next
n2 no. of bits is considered as x2 no. of blocks with block length y2 where n2 = x2 * y2 and so on.
Finally nm no. of bits is considered as xm no. of blocks with block length ym (= 4) where nm = xm *
ym . So no padding is required.
Cipher
Text
Key (K)
Plain
Text
Plain
Text
Key
Generator
Key (K)
Plain
Text
Key (K)
Cipher
Text
3. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
31
Step 3. Square matrix of order √y is generated for each block of length y. The binary bits of the
block from MSB to LSB fit diagonally upward starting from ( √y , √y ) cell in a right to left
trajectory into this square matrix.
Step 4. From the square matrix bits are taken column-wise from top to bottom to generate the
encrypted block of length y.
Step 5. The cipher text is formed after converting the encrypted binary string into characters.
3.2. Decryption Algorithm:
Step 1. The encrypted file i.e. the cipher text is considered as a stream of binary bits.
Step 2. After processing the session key information, this binary string breaks into manageable-
sized blocks.
Step 3. Square matrix of order √y is generated for each block of length y. The binary bits of the
block from MSB to LSB fit column-wise into the square matrix.
Step 4. The decrypted binary string is generated after taking the bits diagonally upward starting
from ( √y , √y ) cell in a right to left trajectory from the square matrix.
Step 5. The plain text is reformed after converting the decrypted binary string into characters.
3.3. Generation of Session Key:
During encryption a session key is generated for one time use in a session of transmission to
ensure much more security to MBBJT. This technique divides the input binary bit stream
dynamically into 16 portions, each portion is divided again into x no. of blocks with block length
y bits. The final (i.e. 16th
) portion is divided into x16 no. of block with block length 4 bits (i.e. y16
= 4). So no padding is required. Total length of the input binary string is
x1 * y1 + x2 * y2 + …….. + x16 * y16.
The values of x and y are generated dynamically. The session key contains the sixteen set of
values of x and y respectively.
4. EXAMPLE
To illustrate the MBBJT, let us consider a two letter’s word “Go”. The ASCII values of “G” and
“o” are 71 (01000111) and 111 (01101111) respectively. Corresponding binary bit representation
of that word is “0100011101101111”. Consider a block with length 16 bits as
0 1 0 0 0 1 1 1 0 1 1 0 1 1 1 1
Now these bits from MSB to LSB fit diagonally upward starting from ( 4 , 4 ) cell in a right to left
trajectory into this square matrix of order 4 as follows:
1 1 1 1
1 0 0 1
1 1 0 0
1 0 1 0
The encrypted binary string is formed after taking the bits column-wise from top to bottom from
above the square matrix as follows:
1 1 1 1 1 0 1 0 1 0 0 1 1 1 0 0
4. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
32
The equivalent decimal no. of two 8 bit binary numbers 11111010 and 10011100 are 250 and 156
respectively. 250 and 156 are the ASCII values of the characters ú (Latin small letter u with
acute) and œ (Latin small ligature oe) respectively. So the word Go is encrypted as úœ.
For decryption, exactly reverse steps of the above are followed.
5. RESULTS AND ANALYSIS
In this section the comparative study between Triple-DES (168bits), AES (128bits) and MBBJT
has done on 20 files of 8 different types with file sizes varying from 330 bytes to 62657918 bytes
(59.7 MB). Analysis includes comparison of encryption time, decryption time, Character
frequencies, Chi-square values, Avalanche and Strict Avalanche effects, Bit Independence. All
implementation has been done using JAVA.
5.1. ANALYSIS OF ENCRYPTION & DECRYPTION TIME
Table I & Table II shows the encryption time and decryption time for Triple-DES (168bits), AES
(128bits) and proposed MBBJT against the different files. Proposed MBBJT takes very less time
to encrypt/decrypt than Triple-DES and little bit more time than AES. Fig. 1(a) and Fig. 1(b)
show the graphical representation of encryption time and decryption time against file size in
logarithmic scale.
TABLE I
File size v/s encryption time(for Triple-DES, AES and MBBJT algorithms)
Sl.
No.
Source File Size
(in bytes)
File
type
Encryption Time (in seconds)
TDES AES MBBJT
1 330 Dll 0.001 0.001 0.003
2 528 Txt 0.001 0.001 0.005
3 96317 Txt 0.034 0.004 0.021
4 233071 Rar 0.082 0.011 0.054
5 354304 Exe 0.123 0.017 0.078
6 536387 Zip 0.186 0.023 0.131
7 657408 Doc 0.220 0.031 0.181
8 682496 Dll 0.248 0.031 0.198
9 860713 Pdf 0.289 0.038 0.215
10 988216 Exe 0.331 0.042 0.254
11 1395473 Txt 0.476 0.059 0.273
12 4472320 Doc 1.663 0.192 0.369
13 7820026 Avi 2.626 0.334 0.648
14 9227808 Zip 3.096 0.397 0.676
15 11580416 Dll 4.393 0.544 0.786
16 17486968 Exe 5.906 0.743 1.799
17 20951837 Rar 7.334 0.937 1.597
18 32683952 Pdf 10.971 1.350 1.992
19 44814336 Exe 15.091 1.914 2.934
20 62657918 Avi 21.133 2.689 5.288
5. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
33
TABL II
File size v/s decryption time (for Triple-DES, AES and MBBJT algorithms)
Sl.
No.
Source File Size
(in bytes)
File type
Decryption Time (in seconds)
TDES AES MBBJT
1 330 Dll 0.001 0.001 0.003
2 528 Txt 0.001 0.001 0.006
3 96317 Txt 0.035 0.008 0.024
4 233071 Rar 0.087 0.017 0.062
5 354304 Exe 0.128 0.025 0.089
6 536387 Zip 0.202 0.038 0.146
7 657408 Doc 0.235 0.045 0.198
8 682496 Dll 0.266 0.046 0.226
9 860713 Pdf 0.307 0.060 0.238
10 988216 Exe 0.356 0.070 0.277
11 1395473 Txt 0.530 0.098 0.298
12 4472320 Doc 1.663 0.349 0.407
13 7820026 Avi 2.832 0.557 0.712
14 9227808 Zip 3.377 0.656 0.535
15 11580416 Dll 4.652 0.868 0.866
16 17486968 Exe 6.289 1.220 1.974
17 20951837 Rar 8.052 1.431 1.768
18 32683952 Pdf 11.811 2.274 2.192
19 44814336 Exe 16.253 3.108 3.249
20 62657918 Avi 22.882 4.927 5.857
Fig. 1(a). Encryption Time (sec) vs. File Size (bytes) in logarithmic scale
6. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
34
Fig. 1(b). Decryption Time (sec) vs. File Size (bytes) in logarithmic scale
5.2. ANALYSIS OF CHARACTER FREQUENCIES
Analysis of Character frequencies for text file has been performed for T-DES, AES and proposed
MBBJT. Fig.2(a) shows the distribution of characters in the plain text. Fig.2(b), 2(c), 2(d) show
the characters distribution in cipher text for T-DES, AES and proposed MBBJT. All three
algorithms show a distributed spectrum of characters. From the above observation it may be
conclude that the proposed MBBJT may obtain very good security.
Fig. 2(a). Distribution of characters in source file
Fig. 2(b): Distribution of characters in TDES
7. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
35
Fig. 2(c). Distribution of characters in AES
Fig. 2(d). Distribution of characters in MBBJT
5.3. TESTS FOR NON-HOMOGENEITY
The test for goodness of fit (Pearson χ2
) has been performed between the source files and the
encrypted files. The large Chi-Square values (compared with tabulated values) may confirm the
high degree of non-homogeneity between the source files and the encrypted files. Table III shows
the Chi-Square values for Triple-DES (168bits), AES (128bits) and proposed MBBJT against the
different files.
From Table III it may conclude that the Chi-Square values of MBBJT are at par with &
sometimes better than that of T-DES and AES. Fig. 3 graphically represents the Chi-Square
values on logarithmic scale for T-DES, AES & MBBJT.
8. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
36
Table III
Chi-Square values for Triple-DES, AES and MBBJT algorithms
Sl.
No.
Source File
Size (bytes)
File
type
Chi-Square Values
TDES AES MBBJT
1 330 dll 922 959 874
2 528 txt 1889 1897 1938
3 96317 txt 23492528 23865067 20949798
4 233071 rar 997 915 963
5 354304 exe 353169 228027 214087
6 536387 zip 3279 3510 3308
7 657408 doc 90750 88706 87099
8 682496 dll 29296 28440 26536
9 860713 pdf 59797 60661 57051
10 988216 exe 240186 245090 256043
11 1395473 txt 5833237390 5545862604 5686269895
12 4472320 doc 102678 102581 99695
13 7820026 avi 1869638 1326136 1144840
14 9227808 zip 37593 37424 36682
15 11580416 dll 28811486 17081530 16699315
16 17486968 exe 8689664 8463203 8137730
17 20951837 rar 25615 24785 26267
18 32683952 pdf 13896909 13893011 15054022
19 44814336 exe 97756312 81405043 77350891
20 62657918 avi 3570872 3571648 3854424
Fig.3 Chi-Square values for TDES, AES & MBBJT in logarithmic scale.
9. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
37
5.4. STUDIES ON AVALANCHE EFFECTS, STRICT AVALANCHE EFFECTS AND BIT
INDEPENDENCE CRITERION
Avalanche & Strict Avalanche effects and Bit Independence criterion has been measured by
statistical analysis of data. The bit changes among encrypted bytes for a single bit change in the
original message sequence for the entire or a relative large number of bytes. The Standard
Deviation from the expected values is calculated. The ratio of calculated standard deviation with
expected value has been subtracted from 1.0 to get the Avalanche and Strict Avalanche effect on
a 0.0 – 1.0 scale. The value closer to 1.0 indicates the better Avalanche & Strict Avalanche effects
and the better Bit Independence criterion. Table IV, Table V & Table VI show the Avalanche
effects, the Strict Avalanche effects & the Bit Independence criterion respectively. Fig.4(a),
Fig.4(b) & Fig4(c) show the above graphically. In Fig.4(a) & Fig.4(b), the y-axis which represent
the Avalanche effects & the Strict Avalanche effects respectively has been scaled from 0.97 – 1.0
for better visual interpretation.
Table IV
Avalanche effects for T-DES, AES and MBBJT algorithms
Sl.
No.
Source File Size
(in bytes)
File type
Avalanche achieved
TDES AES MBBJT
1 330 dll 0.99591 0.98904 0.98558
2 528 txt 0.99773 0.99852 0.98588
3 96317 txt 0.99996 0.99997 0.99643
4 233071 rar 0.99994 0.99997 0.99789
5 354304 exe 0.99996 0.99999 0.99774
6 536387 zip 0.99996 0.99994 0.99846
7 657408 doc 0.99996 0.99999 0.99795
8 682496 dll 0.99998 1.00000 0.99872
9 860713 pdf 0.99996 0.99997 0.99848
10 988216 exe 1.00000 0.99998 0.99873
11 1395473 txt 1.00000 1.00000 0.99896
12 4472320 doc 0.99999 0.99997 0.99824
13 7820026 avi 1.00000 0.99999 0.99863
14 9227808 zip 1.00000 1.00000 1.00000
15 11580416 dll 1.00000 0.99999 0.99898
16 17486968 exe 1.00000 0.99999 0.99964
17 20951837 rar 1.00000 1.00000 0.99967
18 32683952 pdf 0.99999 1.00000 0.99978
19 44814336 exe 0.99997 0.99997 0.99962
20 62657918 avi 0.99999 0.99999 0.99989
11. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
39
Fig.4(a) Comparison of Avalanche effect between T-DES, AES and MBBJT
Fig4(b) Comparison of Strict Avalanche effect between TDES, AES and MBBJT
Fig.4(c) Comparison of Bit Independence criterion between TDES, AES and MBBJT
6. CONCLUSION
MBBJT, the proposed technique in this paper is simple, easy to understand and easy to
implement. The key information varies from session to session for any particular file which may
enhance the security features. Results and Analysis section indicates that the MBBJT is
comparable with industry accepted standards T-DES and AES. The performance of MBBJT is
significantly better than T-DES algorithm. For large files, MBBJT is at par with AES algorithm.
Therefore the proposed technique is applicable to ensure high security in message transmission of
any form and is suitable for any sort of file transfer.
12. International Journal of Advanced Information Technology (IJAIT) Vol. 2, No.2, April 2012
40
REFERENCES
[1] J.K. Mandal, P.K. Jha, Encryption through Cascaded Arithmetic Operation on Pair of Bits and Key
Rotation (CAOPBKR), National Conference of Recent Trends in Intelligent Computing (RTIC-06),
Kalyani Government Engineering College, Kalyani, Nadia, India, 17-19 November 2006.
[2] M.Paul, J.K.Mandal, “A Permutative Cipher Technique (PCT) to Enhance the Security of Network
Based Transmission”, in Proceedings of 2nd National Conference on Computing for Nation
Development, Bharati Vidyapeeth’s Institute of Computer Applications and Management, New Delhi,
pp. 197-202,08th -09th February 2008
[3] S. Som, D. Mitra, J. Halder, Session Key Based Manipulated Iteration Encryption Technique
(SKBMIET), International Conference on Advanced Computer Theory and Engineering (ICACTE
2008), Phuket, Thailand, 20-22 December 2008.
[4] S. Som, K. Bhattacharyya, R. Roy Guha, J. K. Mandal, Block Wise Bits Manipulations Technique
(BBMT), International Conference on Advanced Computing, Tiruchirappalli, India, 6-8 August 2009.
[5] “Triple Data Encryption Standard” FIPS PUB 46-3 Federal Information Processing Standards
Publication, Reaffirmed, 1999 October 25 U.S. DEPARTMENT OF COMMERCE/National Institute
of Standards and Technology.
[6] “Advanced Encryption Standard”, Federal Information Processing Standards Publication 197,
November 26, 2001
Authors
Mr. Manas Paul received his Master degree in Physics from Calcutta University in
1998 and Master degree in Computer Application with distinction in 2003 from
Visveswariah Technological University. Currently he is pursuing his PhD in
Technology from Kalyani University. He is the Head and Assistant Professor in the
Department of Computer Application, JISCE, West Bengal, India. His field of interest
includes Cryptography and Network Security, Operation Research and Optimization
Techniques, Distributed Data Base Management System, Computer Graphics.
Dr. JYOTSNA KUMAR MANDAL received his M.Tech. and PhD degree from
Calcutta University. He is currently Professor of Computer Science & Engineering &
Dean, Faculty of Engineering, Technology & Management, University of Kalyani,
Nadia, West Bengal India. He is attached with several AICTE projects. He has 25
years Teaching & Research Experiences. His field of interest includes Coding
Theory, Data and Network Security, Remote Sensing & GIS based Applications, Data
Compression error corrections, Watermarking, Steganography and Document
Authentication, Image Processing, Visual Cryptography.