Variable Size Block Encryption using Dynamickey Mechanism 'VBEDM'

Bai, Kunpeng; Dr.M.V.Satyanarayana, Author; Vijaya, P. A.

doi:10.5120/3311-4539

Cited by 6 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This process is continued until the end of the plaintext for encryption. Out of XOR, each block is given a complex function where the encryption is performed based on the block size, the key of the pseudo-function, function table, and dynamic permutation [18].…”

Section: Variable Size Block Encryption Using Dynamic-key Mechanismmentioning

confidence: 99%

“…Goldwasser and Micali proposed a randomized block encryption algorithm [14]. In the following years, some works are suggested in this area such as a block encryption algorithm for protecting multimedia context by randomizing permutations [15], block encryption efficient structures with variable input length [16], a message block encryption method based on key with randomized variable length (MRVLK) [17], and block encryption with a variable length by using a dynamic key mechanism [18].…”

Section: Introduction and Basic Conceptsmentioning

confidence: 99%

See 1 more Smart Citation

Indefinite block ciphering based on variable and great length key

Davahli

Babamir

2016

Security Comm Networks

View full text Add to dashboard Cite

Failure of deterministic encryption algorithms against various attacks mostly occurs due to the use of fixed and deterministic methods for encrypting, decrypting, and key production. Because the key production in these algorithms is performed functionally and deterministically, there is a relation between the keys and their length that makes the differential analysis of the keys possible. Moreover, the fixed length and values of the keys make these algorithms unsafe against exhaustive key searches. In this study, a block cipher algorithm called indefinite block ciphering based on variable and great length key which belongs to probabilistic (nondeterministic) family is presented. In this algorithm, the key depends on the plain text and is produced indecisively by a random number and the connectivity of the different parameters. On the other hand, the plain text is divided into blocks with size of random number. The proposed algorithm was evaluated, and the results were compared with those of the deterministic and other nondeterministic algorithms. This comparison was indicative of the high performance and security of the new algorithm with respect to the other approaches.

show abstract

Section: Variable Size Block Encryption Using Dynamic-key Mechanismmentioning

confidence: 99%

Section: Introduction and Basic Conceptsmentioning

confidence: 99%

Indefinite block ciphering based on variable and great length key

Davahli

Babamir

2016

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…In addition to the diffusion and substitution layers of the SPN block ciphers, the authors in [13,14] recently proposed a way to animate with new XOR tables, implemented at the key addition layer. Besides, many ways of animating block ciphers have been studied as in [1,2,4,6,7,12]. In [1], Al-Wattar et al proposed a method to animate the AES block cipher at the diffusion layer.…”

Section: Introductionmentioning

confidence: 99%

Fast Computation of Direct Exponentiation to Speed Up Implementation of Dynamic Block Ciphers

Thi

2022

JCC

View full text Add to dashboard Cite

MDS (maximum distance separable) matrices are ones that come from MDS codes that have been studied for a long time in error correcting code theory and have many applications in block ciphers. To improve the security of block ciphers, dynamic block ciphers can be created. Using MDS matrix transformations is a method used to make block ciphers dynamic. Direct exponentiation is a transformation that can be used to generate dynamic MDS matrices to create a dynamic diffusion layer of the block ciphers. However, for cryptographic algorithms that use an MDS matrix as a component of them, the implementation of matrix multiplication is quite expensive, especially when the matrix has a large size. In this paper, the mathematical basis for quick calculation of direct exponentiation of an MDS matrix will be presented. On that basis, it is to suggest how to apply that fast calculation to dynamic algorithms using the direct exponentiation. This result is very meaningful in software implementation for MDS matrices, especially when implementing dynamic block ciphers to increase execution speed.

show abstract

“…A new encryption technique called Variable size Block Encryption using Dynamic -key Mechanism (VBEDM), which is designed with unlimited key size, dynamically changing permutation table based on the encryption key and variable block size for each round. To make the cryptanalyst difficult to make the plain text from the variety of compression algorithms the VBEDM used a compression technique based on key [24].…”

Section: Introductionmentioning

confidence: 99%

Scalable and Secure Dynamic Key Management and Channel Aware Routing in Mobile Adhoc Networks

Seethalakshmi

Selvakumar

2018

IJEEI

View full text Add to dashboard Cite

A M ANET (M obile Ad-hoc Network) is an infrastructure-less self configuring wireless networks of routers. Key management is at the center of providing network security via cryptographic mechanisms with a highavailability feature. Dynamic key is the efficient assistance for network scalability. Routing protocol used here is a form of reactive routing called CA-AOM DV and compared with Table driven routing called DSDV. Channel aware routing protocol quality of the channel which can be measured in terms of suitable metrics. This paper leads to an emphasis on Black hole attack and to develop a dynamic key framework using RSA algorithm.

show abstract

Variable Size Block Encryption using Dynamickey Mechanism 'VBEDM'

Cited by 6 publications

References 8 publications

Indefinite block ciphering based on variable and great length key

Indefinite block ciphering based on variable and great length key

Fast Computation of Direct Exponentiation to Speed Up Implementation of Dynamic Block Ciphers

Scalable and Secure Dynamic Key Management and Channel Aware Routing in Mobile Adhoc Networks

Contact Info

Product

Resources

About