scholarly journals Lossless and Reversible Data Hiding using Public Key Cryptography

2020 ◽  
Vol 32 ◽  
pp. 02002
Author(s):  
Pooja Shetye ◽  
Srushti Varekar ◽  
Manali Zajam ◽  
Monika Pawar ◽  
Sujata Kadam
Keyword(s):  
Data Hiding ◽  
Internet Access ◽  
Public Key Cryptography ◽  
Secret Message ◽  
Major Drawback ◽  
Plain Text ◽  
Private Key ◽  
Aes Algorithm ◽  
Cipher Text ◽  
Encryption And Decryption

In today’s world, the internet is a platform, where large amount of data can be obtained and transferred. Different technologies and internet access are used to transfer the data which can be accessed by authorized and unauthorized users.The major drawback of these technologies are that any unauthorized person can access it.Hence encryption and decryption is perform on Message/Data .In encryption the plain text/image is converted into cipher text/image.The technique of data hiding is used to hide the data that has to be transferred from the source to the destination.The process involves insertion of secret message in the cover image which is encrypted with the help of AES algorithm. This algorithm generates public/private key. All this process can be performed in lossless and reversible manner.

scholarly journals Modified Advanced Encryption Standard Algorithm for Information Security

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1484 ◽  
Author(s):  
Oluwakemi Christiana Abikoye ◽  
Ahmad Dokoro Haruna ◽  
Abdullahi Abubakar ◽  
Noah Oluwatobi Akande ◽  
Emmanuel Oluwatobi Asani
Keyword(s):  
Execution Time ◽  
Advanced Encryption Standard ◽  
Avalanche Effect ◽  
Plain Text ◽  
Aes Algorithm ◽  
Cipher Text ◽  
Encryption And Decryption ◽  
To Come ◽  
Cryptographic Techniques ◽  
Modified Aes

The wide acceptability of Advanced Encryption Standard (AES) as the most efficient of all of the symmetric cryptographic techniques has further opened it up to more attacks. Efforts that were aimed at securing information while using AES is still being undermined by the activities of attackers This has further necessitated the need for researchers to come up with ways of enhancing the strength of AES. This article presents an enhanced AES algorithm that was achieved by modifying its SubBytes and ShiftRows transformations. The SubBytes transformation is modified to be round key dependent, while the ShiftRows transformation is randomized. The rationale behind the modification is to make the two transformations round key dependent, so that a single bit change in the key will produce a significant change in the cipher text. The conventional and modified AES algorithms are both implemented and evaluated in terms avalanche effect and execution time. The modified AES algorithm achieved an avalanche effect of 57.81% as compared to 50.78 recorded with the conventional AES. However, with 16, 32, 64, and 128 plain text bytes, the modified AES recorded an execution time of 0.18, 0.31, 0.46, and 0.59 ms, respectively. This is slightly higher than the results obtained with the conventional AES. Though a slightly higher execution time in milliseconds was recorded with the modified AES, the improved encryption and decryption strength via the avalanche effects measured is a desirable feat.

scholarly journals Encryption and Decryption of data using Elliptical Curve Cryptography

2019 ◽  
Vol 8 (9) ◽  
pp. 1141-1144
Keyword(s):  
Performance Metrics ◽  
Personal Information ◽  
Public Key Cryptography ◽  
Original Data ◽  
Public Key ◽  
Key Generation ◽  
Plain Text ◽  
Private Key ◽  
Encryption And Decryption ◽  
Pixel Value

Aadhaar database is the world's largest biometric database system. The security of Aadhaar database plays a major role. In order to secure such huge database, an encryption and decryption algorithm has been proposed in this paper. Elliptic Curve Cryptography (ECC) is a public key cryptography which is used to provide high security to those databases. The Aadhaar database contains individual personal information as well as their biometric identities. ECC is widely used for providing security to all kinds of data. ECC has smaller key size, fast computation, high throughput compared to other cryptographic algorithms. The data’s present in database are converted into their corresponding Pixel or ASCII values. After that the encryption process is done with the help of public key, private key, generation points and plain text. After the encryption process, the encrypted coordinates can be mapped with the generated points and from that corresponding ASCII value for text, pixel value for image can be retrieved. Then, the alphabet which is corresponding to ASCII will be displayed so that the cipher text can be viewed. This encrypted data is stored in the database. In order to retrieve the original data decryption process using ECC is carried out. In decryption process, receiver’s private key and cipher coordinates which is retrieved from encryption process are used. Therefore, the personal details of an individual can be retrieved with the presence of that particular person who only knows that private key. So, the hackers will not be able to retrieve the database of any individual just by knowing their Aadhaar ID. The proposed work is implemented in the MATLAB software. The Performance metrics like PSNR, Similarity, Correlation Coefficient, NPCR and UACI has been done for analysis.

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

scholarly journals Picpass Algorithm for Solution of Key Exchange Problem in Symmetric and Asymmetric Key Cryptography

2021 ◽  
pp. 305-308
Author(s):  
Anchal Goyal ◽  
Deepinder Kaur
Keyword(s):  
Public Key Cryptography ◽  
Key Exchange ◽  
Secret Key ◽  
Dictionary Attack ◽  
Plain Text ◽  
Cipher Text ◽  
Compact Size ◽  
Private And Public ◽  
Symmetric Key ◽  
Dictionary Attacks

In this dissertation a PicPass algorithm is proposed for the solution of Key Exchange problem using Symmetric and Asymmetric key cryptography. Diffie and Hellman proposed an algorithm for key exchange. But this algorithm suffers from Man-in middle attack. So to overcome this problem Seo proposed another algorithm that uses text password for the agreement between two parties. But again the password suffers from offline dictionary attack. In this, a PicPass Protocol i.e. picture is used as a password to make an agreement between two parties. The protocol contains two function i.e. picture function as well as distortion function is used to make picture in a compact size and then it is sent to receiver. Firstly the sender encrypts the Plain Text using Secret Picture and creates the Cipher Text using Symmetric key cryptography.Then the Secret Picture will be encrypted by covered picture resulting into Encrypted Picture.Now the Cipher Text and Encrypted Picture will be placed into digital envolpe and then the envelope will be send to the receiver. The receiver will receive the digital envelope, open it and then decrypt the Encrypted Picture using his Key Picture. This will result the receiver to get the Secret Picture. Now the receiver will open the Cipher Text using the Secret Picture and get the Plain Text. In between if any person wants to predict the Encrypted Picture then he cannot guess as the picture will only be decrypted using the Secret Key which will be only with the receiver. So in this dissertation, a picture is used as a password to authenticate key exchange is that gives practical solution against offline dictionary attacks only by using both private and public key cryptography.

Blockchain Based Bidding System

2021 ◽  
Vol 9 (VIII) ◽  
pp. 51-53
Author(s):  
Mr. C. K Srinivas
Keyword(s):  
Third Party ◽  
Start Time ◽  
Plain Text ◽  
The Public ◽  
Aes Algorithm ◽  
Cipher Text ◽  
Blockchain Technology ◽  
Smart Contract ◽  
Sealed Bid ◽  
Final Output

The E-auction, one of the most common e-commerce events, allows bidders to bid directly on the Internet. As with the sealed deal, additional transaction costs are needed with intermediaries, as the third party plays an essential role between buyers and sellers in helping to negotiate both during the auction. In fact, it never confirms that a third party is trustworthy. To solve the problems, we propose the low transaction cost blockchain technology which is used to build the public bid and sealed bid smart contract. The smart contract consists of the Auctioneer address, the start time for the auction, the deadline, the current winner's address, and the current highest price. The project demonstrates the bidding framework with blockchain technology. This bidding application prepared by using Advanced Encryption Standard(AES) Algorithm. This algorithm contains AES cipher specifiers the number of repetitions of transformation rounds, that converts the input called the plain text, then into the final output called cipher text.

scholarly journals ADVANCED FILE BASED SECURITY MECHANISM IN CLOUD COMPUTING: A REVIEW

2015 ◽  
Vol 14 (6) ◽  
pp. 5834-5839
Author(s):  
Nisha Nisha ◽  
Naseeb Singh
Keyword(s):  
Cloud Computing ◽  
Data Security ◽  
Data Centers ◽  
Design Principle ◽  
Internet Access ◽  
Allocation Of Resources ◽  
Private Key ◽  
Aes Algorithm ◽  
Software And Hardware ◽  
The Given

Cloud computing is a broad solution that delivers IT as a service. Cloud computing uses the internet and the central remote servers to support different data and applications. It is an internet based technology. It permits the users to approach their personal files at any computer with internet access. The cloud computing flexibility is a function of the allocation of resources on authoritys request. It represents all the complexities of the network which may include everything from cables, routers, servers, data centers and all such other devices. Cloud based systems saves data off multiple organizations on shared hardware systems. In this paper the attempt to secure data from unauthorized access. The Method of data security is AES algorithm for providing data security by encrypting the given data based on the AES. It is based on a design principle known as a substitution-permutation network, and is fast in both Software and Hardware. The algorithms used in AES are so simple that they can be easily implemented using heap processors and a minimum amount of memory and this data then can only be decrypted by authorized person by using his private key.

scholarly journals Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography

2012 ◽  
pp. 111-117
Author(s):  
Sambhu Prasad Panda ◽  
Madhusmita Sahu ◽  
Manas Kumar Swain
Keyword(s):  
Cellular Automata ◽  
Block Cipher ◽  
Substitution Box ◽  
Plain Text ◽  
Cipher Text ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
A Cell ◽  
Updating Rule ◽  
Fundamental Objective

Cellular Automaton is an idealized parallel processing machine which is an array (1-D, 2-D) of numbers or symbols called cell values together with an updating rule. A cell value is updated based on this updating rule, which involves the cell value as well as other cell values in a particular neighborhood. A fundamental objective of cryptography is to enable two people to communicate over an insecure channel (a public channel such as internet) in such a way that any other person is unable to recover their message (called the plaintext) from what is sent in its place over the channel (the cipher text). The transformation of the plaintext into the cipher text is called encryption, or enciphering. The transformation of the cipher text into the plaintext is called decryption, or deciphering. In this paper we present a new encryption and decryption algorithm based on the linear (periodic boundary-PB) and nonlinear Cellular Automata rules. First we apply PB CA rules to plain text and key. The result of both plain text and key is XORed. Then the result of XOR operation is fed to substitution box( S-box) and again PB CA rules are applied for exchange and shift operations. At the end Complement operation is applied for encryption of plain text. The decryption process is carried out just similar to encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 numbers of rounds in order to avoid the dependency between the plain text and cipher text.

scholarly journals Encryption and Decryption algorithm using two dimensional cellular automata rules in Cryptography

2011 ◽  
pp. 18-23
Author(s):  
Sambhu Prasad Panda ◽  
Madhusmita Sahu ◽  
Umesh Prasad Rout ◽  
Surendra Kumar Nanda
Keyword(s):  
Cellular Automata ◽  
Periodic Boundary ◽  
Block Cipher ◽  
Two Dimensional ◽  
Substitution Box ◽  
Plain Text ◽  
Cipher Text ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
Non Linear

In this paper we present a new encryption and decryption algorithm for block cipher based on the linear (periodic boundary-PB) and nonlinear cellular automata rules. First we apply non linear CA rules (complements) to both plain text and key. Then PB CA rule is applied to the above results separately followed by the XOR operation of above results. After that the result of XOR operation is fed to substitution box(S-box) and again PB CA rules are applied followed by SBox. The decryption process is carried out just similar to that of encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 number of rounds in order to avoid the dependency between the plain text and cipher text so that the our proposed algorithm is more secure than that of AES and DES algorithms.

scholarly journals An Enhanced Cryptographic Algorithm Using Bi-Modal Biometrics

2019 ◽  
Vol 8 (11) ◽  
pp. 2575-2582
Keyword(s):  
Advanced Encryption Standard ◽  
Generation Process ◽  
Key Generation ◽  
Plain Text ◽  
Cipher Text ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Biometric Feature ◽  
Novel Algorithm

A novel cryptographic algorithm, namely Significant Secure Biometric Key (SSBK) algorithm is proposed.The novel algorithm is compared with the existing cryptographic algorithms like Advanced Encryption Standard (AES), key exchange algorithm like Diffie-Helman and also with Symmetric Random Biometric Key (SRBK) algorithm, and finally we prove the proposed algorithm is superior than existing algorithm based on few parameters. A sample plain text is taken and converted to cipher text and the key from the biometric feature is used for encryption and decryption. In the key generation process, the bi-modal biometrics, namely Ear and Lip features are taken. The concatenated key values obtained from ear and lip can be of minimum 8 bits to the maximum of 1024 bits based on the type of algorithm used.

scholarly journals Access control and Encryption of sensitive data using i-Se4GE Algorithm

2017 ◽  
Vol 10 (1) ◽  
pp. 24-32
Author(s):  
Mamta Padole ◽  
Pratik Kanani
Keyword(s):  
Data Hiding ◽  
Data Encryption ◽  
Secret Message ◽  
Random Numbers ◽  
Encryption Scheme ◽  
Message Content ◽  
Sensitive Data ◽  
Public Keys ◽  
Encryption And Decryption ◽  
Computational Resources

Encryption, itself doesn’t prevent interception, but denies the message content to the interceptor. For technical reasons, an encryption scheme usually uses a pseudo-random encryption key generated by an algorithm. It is impossible to decrypt the message without possessing the key, but, for a well-designed encryption scheme, large computational resources and skills are required to decrypt it. An authorized recipient can easily decrypt the message with the key provided by the originator to recipients, but not to unauthorized interceptors. Data hiding is the skill of hiding messages in such a ways the only the sender and the receiver of the message knows that the message has been hidden. In the context of secured information transmission and reception, efficient techniques for data encryption and decryption are very much essential. In this paper, a message transfer application is developed which mainly focusses on secret message transfer between two parties. Used scheme not only focusses on text but also the encryption of images and videos. A unique algorithm i-Se4GE is used for the transfer of keys required for the encryption and decryption of messages. This algorithm makes use of a set of random numbers, timestamp of the two users, a set of public keys and dynamic keys. The algorithm uses a two-step authentication request-reply process which provides it a double layer security.

Sign in / Sign up

Export Citation Format

Share Document