2D-Encryption Mode

AbdelGawad, Moez A.; Belal, A.

doi:10.1117/12.451256

Cited by 3 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TheFigure 1(b) in represents the ECB DES encryption of the original image, using the key 1234567890ABCDEF. One sample image, together with a image resulting from its encryption[1] …”

mentioning

confidence: 99%

Shell-Based Block Ciphering Structure (SBCS) for AES Parallelism with Feedback-Data Mode

Lin

Huang

2014

2014 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery

View full text Add to dashboard Cite

It is generally agreed that multiple hardware resources increase computing speed as each core provides individual data output. The provision of individual data output enables multiple cores to process and output data from each core independently. The individual characteristics of multiple hardware resources enhances data ciphering speed and outputs individual streams of cipher text. After enciphering, full text data are partitioned equally into separate, individual cipher text streams, each being equivalent to a separate, individual copy of cipher text. In the data encryption with block ciphers area, a feedback-data mode of operation such as CBC is the more favored block ciphering mode. However, due to it needs the previous block of data to find out the current block of ciphertext, feedback-data mode could not encrypt each plaintext independently, so that it does not work with the multiple cores system. To conquer these problems, the Shell-based Block Ciphering Structure (SBCS) is proposed in this paper by modifying the operation feedback path to fit to the multiple cores operation environment.

show abstract

“…TheFigure 1(b) in represents the ECB DES encryption of the original image, using the key 1234567890ABCDEF. One sample image, together with a image resulting from its encryption[1] …”

mentioning

confidence: 99%

Shell-Based Block Ciphering Structure (SBCS) for AES Parallelism with Feedback-Data Mode

Lin

Huang

2014

2014 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery

View full text Add to dashboard Cite

show abstract

“…Like any block cipher, this algorithm is applicable under all encryption modes (ECB, CBC, CFB, OFB, 2DEM) [15,16,19]. In this section, we introduce variations of two famous encryption modes to better suit our algorithm; namely, cipher block chaining CBC and two dimensional encryption mode 2DEM.…”

Section: Other Encryption Modesmentioning

confidence: 98%

“…2DEM is an encryption mode [19] that has the advantage of handling 2d data but it still can be applied to 1 d data by arranging it in two dimensional form like in the Rijndal algorithm (AES) [28]. The idea is to apply the algorithm on the rows first (by treating each row as 1 d block), then encrypting the columns of the resulting matrix to get the cipher text.…”

Section: Two Dimensional Encryption Mode (2dem)mentioning

confidence: 99%

“…Some researches concentrated on cryptanalysis, analysing known algorithms for their vulnerabilities to attacks before an opponent does; [17,IS] are examples. Different encryption modes are introduced to apply the encryption algorithm on the plaintext data [15,16]; a special mode was suggested for two dimensional data [19]. However, many researchers devoted their work to handle encryption of images and multimedia applications for their bulk data and high redundancy [20,21,22]; which makes traditional encryption algorithms generally not suitable because they are slow in real-time processing, and some other issues such as handling various data formatting [23].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An encryption algorithm based on alphabetic trees

Arafat

The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.

View full text Add to dashboard Cite

Optimal alphabetic trees (OATs) are known to be used in several application areas, such as coding, probabilistic retrieval systems and VLSI design. In this paper, we introduce a novel encryption algorithm, Alphabetic Tree Cipher (ATC), based on an interesting property of OATs. A theorem is presented to define a family of weight lists that all have the same OAT of a given weight list (and consequently the same level values). Considering the plain text to be the original weight list, a key is used to select one from the family of equivalent weight lists to be the cipher text. While finding the levels of the cipher text is easy, finding the corresponding plain text without knowledge of the key is not. The security of the algorithm is analyzed and discussed under dif f erent block encryption modes, and against different kinds of attacks.

show abstract

A Generic Method to Design Modes of Operation Beyond the Birthday Bound

Lefranc

Painchault

Rouat³

et al. 2007

Selected Areas in Cryptography

View full text Add to dashboard Cite

Given a PRP defined over {0, 1} n , we describe a new generic and efficient method to obtain modes of operation with a security level beyond the birthday bound 2 n/2. These new modes, named NEMO (for New Encryption Modes of Operation), are based on a new contribution to the problem of transforming a PRP into a PRF. According to our approach, any generator matrix of a linear code of minimal distance d, d ≥ 1, can be used to design a PRF with a security of order 2 dn/(d+1). Such PRFs can be used to obtain NEMO, the security level of which is of the same order (2 dn/(d+1)). In particular, the well-known counter mode becomes a particular case when considering the identity linear code (of minimal distance d = 1) and the mode of operation CENC [7] corresponds to the case of the the parity check linear code of minimal distance d = 2. Any other generator matrix leads to a new PRF and a new mode of operation. We give an illustrative example using d = 4 which reaches the security level 2 4n/5 with a computation overhead less than 4% in comparison to the counter mode.

show abstract

2D-Encryption Mode

Cited by 3 publications

References 3 publications

Shell-Based Block Ciphering Structure (SBCS) for AES Parallelism with Feedback-Data Mode

Shell-Based Block Ciphering Structure (SBCS) for AES Parallelism with Feedback-Data Mode

An encryption algorithm based on alphabetic trees

A Generic Method to Design Modes of Operation Beyond the Birthday Bound

Contact Info

Product

Resources

About