scholarly journals An Optimized Key Scheduling Algorithm for CAST -128 using dynamic substitution S-box

2019 ◽  
Vol 8 (3) ◽  
pp. 2585-2590
Keyword(s):  
Block Cipher ◽  
Scheduling Algorithm ◽  
Secret Key ◽  
Key Block ◽  
Key Scheduling

An optimized key scheduling algorithm for the 64-bit block cipher CAST-128 by using dynamically substituting of S-box. In this regard, an attempt has been made to modify key scheduling algorithm for generating subkeys of a secret-key block cipher which is CAST-128 algorithm so as to enhance performance by modifying the generation of subkeys using dynamic substitution of S-box. The CAST-128 uses four static substitution of S-box to generate subkeys, where as the proposed structure generates subkeys using substitution of S-box dynamically to provides the performance of CAST-128. The approach considers different security aspects and metrics evaluation for verification

Cryptanalytic Attacks on IDEA Block Cipher

2016 ◽  
Vol 66 (6) ◽  
pp. 582 ◽  
Author(s):  
Harish Kumar Sahu ◽  
Vikas Jadhav ◽  
Shefali Sonavane ◽  
R.K. Sharma
Keyword(s):  
Block Cipher ◽  
Data Encryption ◽  
Secret Key ◽  
Data Confidentiality ◽  
Data Encryption Standard ◽  
Financial Application ◽  
Time Requirements ◽  
International Data ◽  
Key Block ◽  
Symmetric Key

International data encryption algorithm (IDEA) is a secret key or symmetric key block cipher. The purpose of IDEA was to replace data encryption standard (DES) cipher, which became practically insecure due to its small key size of 56 bits and increase in computational power of systems. IDEA cipher mainly to provide data confidentiality in variety of applications such as commercial and financial application e.g. pretty good privacy (PGP) protocol. Till 2015, no successful linear or algebraic weaknesses IDEA of have been reported. In this paper, author explained IDEA cipher, its application in PGP and did a systematic survey of various attacks attempted on IDEA cipher. The best cryptanalysis result which applied to all keys could break IDEA up to 6 rounds out of 8.5 rounds of the full IDEA cipher1. But the attack requires 264 known plaintexts and 2126.8 operations for reduced round version. This attack is practically not feasible due to above mention mammoth data and time requirements. So IDEA cipher is still completely secure for practical usage. PGP v2.0 uses IDEA cipher in place of BassOmatic which was found to be insecure for providing data confidentiality.

VINCI: VLSI implementation of the new secret-key block cipher IDEA

2002 ◽  
Author(s):  
A. Curiger ◽  
H. Bonnenberg ◽  
R. Zimmermann ◽  
N. Felber ◽  
H. Kaeslin ◽  
...  
Keyword(s):  
Block Cipher ◽  
Vlsi Implementation ◽  
Secret Key ◽  
Key Block

The secret-key block cipher MKC1

2003 ◽  
Vol 86 (2) ◽  
pp. 68-83
Author(s):  
Koichi Matsukawa ◽  
Kunikatsu Kobayashi
Keyword(s):  
Block Cipher ◽  
Secret Key ◽  
Key Block

Generating a random sequence based on PWLCM map applicated to RC4 algorithm

2018 ◽  
Vol 7 (2.14) ◽  
pp. 182
Author(s):  
Assia Merzoug ◽  
Adda Ali-Pacha ◽  
Naima Hadj-Said ◽  
Mustafa Mamat ◽  
Mohamad Afendee Mohamed
Keyword(s):  
Stream Cipher ◽  
Random Sequence ◽  
Scheduling Algorithm ◽  
Secret Key ◽  
Improved Method ◽  
Data Confidentiality ◽  
Military Operation ◽  
Key Schedule ◽  
The Military ◽  
Key Scheduling

Cryptography came into picture as a tool to secure data in storage as well as under transmission. Stream cipher has been very famous for providing data confidentiality for vital communication such that found during the military operation. Various algorithms in existence, the two most important trade-off considered would be security and efficiency. The RC4 is a symmetric stream cipher which has been widely implemented in various applications such that of Mozilla and Microsoft. Recently, the algorithm is known for having a weak key schedule which gives rise to related key attacks and thus drove the algorithm to sideline. In this work, an attempt was made to propose an improved method based on the PWLCM map to generate a random sequence in key scheduling algorithm and to use it in the RC4. The novelty in this approach is the transformation of the RC4 algorithm, into a secret key encryption, with the increase of keyspace and thus improves the secu-rity of the key scheduling and in turn the RC4 algorithm. 

scholarly journals Design and implementation of proposed 320 bit RC6-cascaded encryption/decryption cores on altera FPGA

2020 ◽  
Vol 10 (6) ◽  
pp. 6370
Author(s):  
Ashwaq T. Hashim ◽  
Ahmed M. Hasan ◽  
Hayder M. Abbas
Keyword(s):  
Field Programmable Gate Array ◽  
Block Cipher ◽  
Low Cost ◽  
Structure Design ◽  
Secret Key ◽  
Design And Implementation ◽  
Cryptographic Algorithm ◽  
Field Programmable ◽  
Key Block ◽  
Encryption Decryption

This paper attempts to build up a simple, strong and secure cryptographic algorithm. The result of such an attempt is “RC6-Cascade” which is 320-bits RC6 like block cipher. The key can be any length up to 256 bytes. It is a secret-key block cipher with precise characteristics of RC6 algorithm using another overall structure design. In RC6-Cascade, cascading of F-functions will be used instead of rounds. Moreover, the paper investigates a hardware design to efficiently implement the proposed RC6-Cascade block cipher core on field programmable gate array (FPGA). An efficient compact iterative architecture will be designed for the F-function of the above algorithm. The goal is to design a more secure algorithm and present a very fast encryption core for low cost and small size applications.

scholarly journals Scalable PP-1 block cipher

2010 ◽  
Vol 20 (2) ◽  
pp. 401-411 ◽  
Author(s):  
Krzysztof Bucholc ◽  
Krzysztof Chmiel ◽  
Anna Grocholewska-Czuryło ◽  
Ewa Idzikowska ◽  
Izabela Janicka-Lipska ◽  
...  
Keyword(s):  
Error Detection ◽  
Processing Speed ◽  
Block Cipher ◽  
Limited Resources ◽  
Concurrent Error Detection ◽  
Test Results ◽  
Speed Test ◽  
Fast Arithmetic ◽  
Key Scheduling

Scalable PP-1 block cipherA totally involutional, highly scalable PP-1 cipher is proposed, evaluated and discussed. Having very low memory requirements and using only simple and fast arithmetic operations, the cipher is aimed at platforms with limited resources, e.g., smartcards. At the core of the cipher's processing is a carefully designed S-box. The paper discusses in detail all aspects of PP-1 cipher design including S-box construction, permutation and round key scheduling. The quality of the PP-1 cipher is also evaluated with respect to linear cryptanalysis and other attacks. PP-1's concurrent error detection is also discussed. Some processing speed test results are given and compared with those of other ciphers.

scholarly journals Color Image Encryption using AES and RSA

2020 ◽  
Vol 9 (5) ◽  
pp. 547-550
Keyword(s):  
Data Security ◽  
Block Cipher ◽  
Color Image ◽  
Signal To Noise Ratio ◽  
Security Level ◽  
Change Rate ◽  
The Public ◽  
Key Block ◽  
Symmetric Key ◽  
Encryption Algorithms

Information security is an important task on multimedia and communication world. During storing and sharing maintaining a strategic distance from the outsider access of information is the difficult one. There are many encryption algorithms that can provide data security. In this paper two of the encryption algorithms namely AES and RSA are implemented for color images. AES (Advanced Encryption Standard) is a symmetric key block cipher published in December 2001 by NSIT (National Institute of Standards and Technology). RSA (Rivest-Shamir-Adleman) is an asymmetric key block cipher. It uses two separate keys, one for encryption called the public key and other for decryption called the private key. Both the implementation and analysis are done in Matlab. The quality and security level of both the algorithms is analysed based on various criteria such as Histogram analysis, Correlation analysis, Entropy analysis, NPCR (Number of Pixel Change Rate), UACI (Unified Average Changing Intensity), PSNR (Peak Signal-to-Noise Ratio).

Sign in / Sign up

Export Citation Format

Share Document