A lossless digital encryption system for multimedia using orthogonal transforms

Malakooti, Mohammad V.; Dobuneh, Mojtaba Raeisi Nejad

doi:10.1109/dictap.2012.6215383

Cited by 9 publications

(3 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our proposed experiments, the Singular Value Decomposition (SVD) is applied on each sub image and its dominant features are extracted and stored inside the feature vector. We have compared our approach with three other feature extraction techniques: Discrete Cosine Transform (DCT) [19], Hough Transform (HT) [26], and Malakooti Transform (MT) [27].…”

Section: Feature Extractionmentioning

confidence: 99%

Multimodal Biometric Recognition Using Iris and Face Features

Alshebli¹,

Kurugöllü²,

Shafik³

2021

Advances in Transdisciplinary Engineering

View full text Add to dashboard Cite

Multimodal biometrics has recently gained interest over single biometric modalities. This interest stems from the fact that this technique offers improvements in recognition and more security. In this ongoing research programme, we propose a new feature extraction technique for a biometric system based on face and iris recognition. The extraction of iris and facial features is performed using the Discrete Wavelet Transform combined with the Singular Value Decomposition. Merging the relevant characteristics of the two modalities is used to create a pattern for each individual in the dataset. The evaluation process is performed using two datasets (i.e., Faces94 Faces dataset and IIT Delhi Iris dataset). The experimental results carried out in this programme showed the robustness of the proposed technique.

show abstract

Section: Feature Extractionmentioning

confidence: 99%

Multimodal Biometric Recognition Using Iris and Face Features

Alshebli¹,

Kurugöllü²,

Shafik³

2021

Advances in Transdisciplinary Engineering

View full text Add to dashboard Cite

show abstract

“…The process of decryption is also similar to encryption but the inverse of transformation matrix can be obtained via matrix transpose rather than direct inverse calculation. This high speed inverse transformation can decrease the calculation cost ad increase the speed of decryption process [12].…”

Section: International Journal Of Digital Information and Wireless Comentioning

confidence: 99%

A New Orthogonal Cryptographic System for Database Security Based on Cellular Automata and Hash Algorithm

Malakooti¹,

Bazofti²

2014

IJDIWC

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper, we have developed a new orthogonal cryptographic system for database security that has used both Cellular automata and Hash Algorithm. Our Algorithm consists of two different parts; Encryption/Decryption of database tables as well as the generation of the Authentication Tag for the activation of the attack alarm for the database tables while it is unlocked and in protected mode but it has been accessed by the illegal users.Our proposed orthogonal cryptosystem is considered to be symmetric algorithm and uses a common key for both encryption and decryption processes as oppose to the asymmetric one that requires two keys, private and public keys. Since our transformation matrix is orthogonal, we have used the property of orthogonal matrix to calculate its inverse based on its matrix transpose rather than direct matrix inversion to save the calculation time during the decryption process.We also have generated secret keys by applying the internal rules of cellular automata on the Malakooti Transform (M-T) to obtain the secret key matrix that can be used to be multiplied with the matrix of ASCII code obtained from the records of the database. To apply another level of security on the resulting encrypted code, the Hash values obtained from each record are multiplied by the elements of the secret key matrix and the XOR operation is performed on the resulting values and the elements of the encrypted codes.In addition, we also proposed a robust and fast algorithm for the database security and authentication that automatically and accurately will generate the Hash values for the entire rows of the database tables to obtain a unique Hash value for each table. This unique hash value can be used to check the validity of the data inside the database and guarantee the authentication of all information in each database.Our proposed method is capable of detecting any slight change that might be occurs on the database while it is in the protected mode. The generated Hash value will be calculated from the records elements of the database periodically to be compared with the value of the Hash value stored outside database for the authentication. Should the generated Hash value be different from the stored Hash value, the alarm flag would be activated to inform the administrator about unauthorized change of database while in protected mode via SMS or Email.

show abstract

“…For this reason the designers of such systems are strongly advised to take advantage of secure transmission protocols which mostly employ symmetric encryption algorithms, e.g., IDEA, DES, 3DES, or AES [1]. In the case of real-time transmissions of visual data such algorithms may be computationally too expensive, in particular for portable devices with battery operation (see [2,3]). It should be noted, however, that visual data have a lower value than, e.g., financial or military ones.…”

Section: Introductionmentioning

confidence: 99%

Joint compression and encryption of visual data using orthogonal parametric transforms

Puchala¹,

Yatsymirskyy²

2016

Bulletin of the Polish Academy of Sciences Technical Sciences

View full text Add to dashboard Cite

Abstract. In this paper, we introduce a novel method of joint compression and encryption of visual data. In the proposed approach the compression stage is based on block quantization while the encryption uses fast parametric orthogonal transforms of arbitrary forms in combination with a novel scheme of intra-block mixing of data vectors. Theoretical analysis of the method indicates no impact of encryption stage on the effectiveness of block quantization with an additional step of first order entropy coding. Moreover, a series of experimental studies involving natural images and JPEG lossy compression standard were performed. Here, the obtained results indicate a high level of visual content concealment with only a small reduction of compression performance. An additional analysis of security allows to state that the proposed method is resistant to cryptanalytic attacks known for visual data encryption schemes including the most efficient NZCA attack. The proposed method can be also characterized by high computational efficiency and feasibility of hardware realizations. In the view of the above motivation, we propose in this paper a novel method for joint compression and encryption of visual data. In the proposed approach the compression stage uses block quantization, which is the core of existing standards such as: JPEG, MJPEG and MPEG. It allowed to keep compliance with known standards and to obtain comparable performance of data compression. The encryption process is based on fast parametric orthogonal transforms (FPOTs) and a novel scheme of inter-block mixing of data vectors. The proposed method can be characterized by higher combinatorial complexity than existing methods based on linear transforms and, in addition, it is resistant to cryptanalytic attacks known for visual data encryption algorithms.In the research part of the paper it was proved theoretically that the proposed encryption scheme does not affect the compression performance based on block quantization with an additional step of first order entropy coding. Furthermore, a series of experiments concerning joint compression and encryption of natural images were performed by embedding the proposed encryption scheme into JPEG standard. Finally, we discuss in detail the aspects of computational complexity of the method and also provide a critical analysis of its resistance to the known types of cryptanalytic attacks. Existing visual data encryption methodsThe existing methods of visual data encryption can be divided into two groups: naive and selective. The naive approach

show abstract

A lossless digital encryption system for multimedia using orthogonal transforms

Cited by 9 publications

References 1 publication

Multimodal Biometric Recognition Using Iris and Face Features

Multimodal Biometric Recognition Using Iris and Face Features

A New Orthogonal Cryptographic System for Database Security Based on Cellular Automata and Hash Algorithm

Joint compression and encryption of visual data using orthogonal parametric transforms

Contact Info

Product

Resources

About