scholarly journals Modified Blowfish algorithm analysis using derivation cases

2021 ◽  
Vol 10 (4) ◽  
pp. 2192-2200
Author(s):  
Theda Flare Ginoy Quilala ◽  
Rogel L. Quilala
Keyword(s):  
Generation Time ◽  
Algorithm Analysis ◽  
Original Structure ◽  
Key Generation ◽  
File Size ◽  
Avalanche Effect ◽  
Input Size ◽  
Encryption And Decryption ◽  
Shift Rotation ◽  
The Difference

This study analyzed and enhanced the modified Blowfish algorithm (MBA) encryption. The modification retained the original structure, process and the use of two S-boxes in the MBA but presented two derivation processes in the f-function which was originally placed to prevent symmetry. The derivation case’s performance was analyzed using avalanche effect and time efficiency. After comparing the first and second derivation process presented in the MBA, the second derivation further improved the avalanche effect by 5.47%, thus improving security. The performance also showed that the second modification is faster by 39.48% in encryption time, and 38.34% faster in decryption time. The first derivation case in the modified Blowfish was slower in time because of the difference in the placement of the shift rotation. The key generation time was found to be independent of the input size while the encryption and decryption time was found to be directly proportional to file size. With this, the second modification is considered to be better.

scholarly journals Provide a New Encryption Algorithm for Medical Images and Evaluate the Proposed Algorithm

2019 ◽  
Vol 8 (1) ◽  
pp. 2
Author(s):  
Mehdi Lotfi ◽  
Hossein Kheiri ◽  
Azizeh Jabbari
Keyword(s):  
Differential Equations ◽  
Chaotic Systems ◽  
Medical Information ◽  
Medical Images ◽  
Encryption Algorithm ◽  
Key Generation ◽  
Time Period ◽  
Key Space ◽  
Encryption And Decryption ◽  
Very High

Introduction:  In this paper, an encryption algorithm for the security of medical images is presented, which has extraordinary security. Given that the confidentiality of patient data is one of the priorities of medical informatics, the algorithm can be used to store and send medical image.Material and Methods:  In this paper, the solutions of chaotic differential equations are used to generate encryption keys. This method is more than other methods used in encoding medical images, resistant to statistics attacks, low encryption and decryption time and very high key space. In the proposed algorithm, unlike other methods that use random key generation, this method uses the production of solutions of the chaotic differential equations in a given time period for generating a key. All simulations and coding are done in MATLAB software.Results:   Chaotic Differential Equations have two very important features that make it possible to encode medical images. One is the unpredictability of the system's behavior and the other is a severe sensitivity to the initial condition.Conclusion: These two features make the method resistant to possible attacks to decode the concept of synchronization chaotic systems. Using the results of the method, medical information can be made safer than existing ones.

scholarly journals RSA algorithm using key generator ESRKGS to encrypt chat messages with TCP/IP protocol

2020 ◽  
Vol 8 (2) ◽  
pp. 113-120
Author(s):  
Aminudin Aminudin ◽  
Gadhing Putra Aditya ◽  
Sofyan Arifianto
Keyword(s):  
Prime Number ◽  
Instant Messaging ◽  
Prime Numbers ◽  
Public Key ◽  
Key Generation ◽  
Security Testing ◽  
Rsa Algorithm ◽  
Computer Resource ◽  
Encryption And Decryption ◽  
Private And Public

This study aims to analyze the performance and security of the RSA algorithm in combination with the key generation method of enhanced and secured RSA key generation scheme (ESRKGS). ESRKGS is an improvement of the RSA improvisation by adding four prime numbers in the property embedded in key generation. This method was applied to instant messaging using TCP sockets. The ESRKGS+RSA algorithm was designed using standard RSA development by modified the private and public key pairs. Thus, the modification was expected to make it more challenging to factorize a large number n into prime numbers. The ESRKGS+RSA method required 10.437 ms faster than the improvised RSA that uses the same four prime numbers in conducting key generation processes at 1024-bit prime number. It also applies to the encryption and decryption process. In the security testing using Fermat Factorization on a 32-bit key, no prime number factor was found. The test was processed for 15 hours until the test computer resource runs out.

Implementasi Algoritma Merkle-Hellman Knapsack dalam Penyandian Record Database

2020 ◽  
pp. 162-165
Author(s):  
Reni Rahmadani ◽  
Harvei Desmon Hutahaean ◽  
Ressy Dwitias Sari
Keyword(s):  
Data Security ◽  
Public Key Cryptography ◽  
Data Encryption ◽  
Key Generation ◽  
Software Developers ◽  
Data Owner ◽  
Encryption And Decryption ◽  
User Data ◽  
Np Complete ◽  
Knapsack Algorithm

A lot of data is misused without the data owner being aware of it. Software developers must ensure the security user data on their system. Due to the size of the market that houses data, the security of record databases must be of great concern. Cryptographic systems or data encryption can be used for data security. The Merkle-Hellman Knapsack algorithm is included in public-key cryptography because it uses different keys for the encryption and decryption processes. This algorithm belongs to the NP-complete algorithm which cannot be solved in polynomial order time. This algorithm has stages of key generation, encryption, and decryption. The results of this study secure database records from theft by storing records in the form of ciphertext/password. Ciphertext generated by algorithmic encryption has a larger size than plaintext.

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.

Energetics and structural effects in the fragmentation of protonated esters in the gas phase

1981 ◽  
Vol 59 (14) ◽  
pp. 2133-2145 ◽  
Author(s):  
Jan A. Herman ◽  
Alex. G. Harrison
Keyword(s):  
Activation Energy ◽  
Gas Phase ◽  
Methyl Formate ◽  
Carbonyl Oxygen ◽  
Original Structure ◽  
Proton Affinities ◽  
Acetate Methyl ◽  
Ether Oxygen ◽  
The Difference ◽  
Tertiary Alkyl

A series of formate (methyl through butyl) and acetate (methyl through pentyl) esters have been protonated in the gas phase by the Brønsted acids H3+, N2H+, CO2H+, N2OH+, and HCO+. Carbonyl oxygen protonation is 87–97 kcal mol−1 exothermic for H3+ and 47–57 kcal mol−1 exothermic for the weakest acid HCO+, permitting a study of the effect of protonation exothermicity on the decomposition modes of the protonated esters. With the exception of protonated methyl formate, three decomposition modes, (a) to (c) are observed.[Formula: see text]Reaction (a) is unimportant for formates; for acetates it is the sole decomposition channel for the methyl ester, but is less important for higher acetates. The dependence of the relative importance of this reaction mode on the protonation exothermicity indicates an activation energy considerably in excess of ΔH0, presumably because the reaction involves a symmetry-forbidden 1,3-H shift for the carbonyl protonated ester. For the higher acetates where the difference in the proton affinities of the carbonyl and ether oxygens is less, acyl ion formation results, in part, from protonation at the ether oxygen. For protonated methyl formate the major fragmentation reaction yields CH3OH2+ + CO; this reaction also appears to have an activation energy considerably in excess of the ΔH0. For the remaining esters either reaction (b) or (c) is the major decomposition mode. The competition between these two channels depends strongly on the protonation exothermicity and the relative activation energies. From the reaction competition we conclude that 1,2-H shifts occur in the case of primary alkyl esters yielding more stable secondary or tertiary alkyl ions. This rearrangement appears to occur after the excess energy has been partitioned between the alkyl ion and the neutral acid since the extent of further fragmentation of the alkyl ion reflects the original structure of the alkyl group.

Hybrid Cryptography for Random-key Generation based on ECC Algorithm

2017 ◽  
Vol 7 (3) ◽  
pp. 1293 ◽  
Author(s):  
P. Gayathri ◽  
Syed Umar ◽  
G. Sridevi ◽  
N. Bashwanth ◽  
Royyuru Srikanth
Keyword(s):  
Security Level ◽  
Key Generation ◽  
Public Key Encryption ◽  
Private Key ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Safe Side ◽  
Key Length ◽  
High Level ◽  
User Friendly

As more increase in usage of communications and developing them more user friendly. While developing those communications, we need to take care of security and safety of user’s data. Many researchers have developed many complex algorithms to maintain security in user’s application. Among those one of the best algorithms are cryptography based, in which user will be safe side mostly from the attackers.  We already had some AES algorithm which uses very complex cryptographic algorithm to increase the performance and more usage of lookup tables. So the cache timing attackers will correlates the details to encrypt the data under known key with the unknown key. So, for this we provide an improvised solution. This paper deals with an extension of public-key encryption and decryption support including a private key. The private key is generated with the combination of AES and ECC. In general AES, key length is 128 bits with 10 times of iterations. But with this, users won’t get efficient security for their operations, so to increase the security level we are implementing 196-bit based encryption with 12 times round-key generation iterations. By this enhancement, we can assure to users to high level security and can keep users data in confidential way.

scholarly journals Barrel Shifter Physical Unclonable Function Based Encryption

Cryptography ◽  
2018 ◽  
Vol 2 (3) ◽  
pp. 22 ◽  
Author(s):  
Yunxi Guo ◽  
Timothy Dee ◽  
Akhilesh Tyagi
Keyword(s):  
Logistic Regression ◽  
Manufacturing Process ◽  
Ring Oscillator ◽  
Key Generation ◽  
Physical Unclonable Functions ◽  
Encryption And Decryption ◽  
Barrel Shifter ◽  
Transmission Gates ◽  
Encryption Decryption ◽  
Randomness Tests

Physical Unclonable Functions (PUFs) are designed to extract physical randomness from the underlying silicon. This randomness depends on the manufacturing process. It differs for each device. This enables chip-level authentication and key generation applications. We present an encryption protocol using PUFs as primary encryption/decryption functions. Each party has a PUF used for encryption and decryption. This PUF is constrained to be invertible and commutative. The focus of the paper is an evaluation of an invertible and commutative PUF based on a primitive shifting permutation network—a barrel shifter. Barrel shifter (BS) PUF captures the delay of different shift paths. This delay is entangled with message bits before they are sent across an insecure channel. BS-PUF is implemented using transmission gates for physical commutativity. Post-layout simulations of a common centroid layout 8-level barrel shifter in 0.13 μ m technology assess uniqueness, stability, randomness and commutativity properties. BS-PUFs pass all selected NIST statistical randomness tests. Stability similar to Ring Oscillator (RO) PUFs under environmental variation is shown. Logistic regression of 100,000 plaintext–ciphertext pairs (PCPs) fails to successfully model BS-PUF behavior.

scholarly journals 3 Introducing Primality Testing Algorithm with an Implementation on 64 bits RSA Encryption Using Verilog

2018 ◽  
Vol 1 (1) ◽  
pp. 6
Author(s):  
Rehan Shams ◽  
Fozia Hanif Khan ◽  
Umair Jillani ◽  
M. Umair
Keyword(s):  
Communication System ◽  
Prime Numbers ◽  
Key Generation ◽  
Random Generation ◽  
Primality Testing ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
Number Of Cycles ◽  
Testing Algorithm ◽  
Secured Communication

A new structure to develop 64-bit RSA encryption engine on FPGA is being presented in this paper that can be used as a standard device in the secured communication system. The RSA algorithm has three parts i.e. key generation, encryption and decryption. This procedure also requires random generation of prime numbers, therefore, we are proposing an efficient fast Primality testing algorithm to meet the requirement for generating the key in RSA algorithm. We use right-to-left-binary method for the exponent calculation. This reduces the number of cycles enhancing the performance of the system and reducing the area usage of the FPGA. These blocks are coded in Verilog and are synthesized and simulated in Xilinx 13.2 design suit.

scholarly journals AES WITH CHAOTIC USING CHEBYSHEV POLYNOMIAL

2018 ◽  
Vol 44 (2) ◽  
pp. 35-40
Author(s):  
Tanya jabor ◽  
Hiba Taresh ◽  
Alaa Raheema
Keyword(s):  
Real Time ◽  
Personal Information ◽  
Chaotic Map ◽  
Encryption Algorithm ◽  
The Internet ◽  
Key Generation ◽  
Generation Algorithm ◽  
Critical Data ◽  
Encryption And Decryption ◽  
Day By Day

All the important information is exchanged between facilities using the internet and networks, all these data should besecret and secured probably, the personal information of person in each of these institutions day by day need to organized secretlyand the need of the cryptography systems is raised which can easily encrypt the personal and critical data and it can be shared withother centers via internet without and concerns about privacy. Chaotic performance is added to different phases of AES but very few apply it on key generation and choosing ChebyshevPolynomial will provide a chaotic map which will led to random strong key. our system based on modified advanced encryptionstandard (AES) , with encryption and decryption in real time taking to consideration the criticality of data images that beenencrypted the main encryption algorithm is the same the modification is done by replacing the key generation algorithm byChebyshev Polynomial to generate key with the required key size.

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.

Sign in / Sign up

Export Citation Format

Share Document