Privacy protection of biometric traits using modified hill cipher with involutory key and robust cryptosystem

Acharya, Bibhudendra; Sharma, Mukul Dhar; Tiwari, Sourabh; Minz, Vinay Kumar

doi:10.1016/j.procs.2010.11.031

Cited by 11 publications

(6 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are references used as a comparison for modifications that have been made to the Hill Cipher cryptosystem. Acharya et al (2010) discussed the privacy protection of biometric traits using modified Hill Cipher with involuntary key and robust cryptosystem, whereas Krishna & Madhuravani (2012) discussed a modified Hill Cipher using randomized approach and L (2017) studied a modified Hill Cipher based image encryption technique. In their paper, Khalaf et al (2016) studied a triple Hill Cipher algorithm proposed to increased the security of encrypted binary data, whereas Reddy et al (2012) discussed a modified Hill Cipher based on circulant matrices, and a modified Hill Cipher for large block of plaintext with interlacing and iteration was studied by Sastry Ravi (2008).…”

Section: Methodsmentioning

confidence: 99%

“…This system encrypts message mod C KP p  and description 1 mod P K C p   (Khalaf et al, 2016). In its development, the system is modified in the circulant matrix, involutory matrix and combination of the robust cryptosystem (Acharya et al, 2010). The Hill Cipher cryptosystem was also developed in image encoding (L, 2017), plaintext randomization (Krishna & Madhuravani, 2012), and looping of the Hill Ciphers cryptosystem (Dummit & Foote, 2004).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Hill Cipher Cryptosystem over Complex Numbers

Maxrizal¹

2019

indonesian.j.of.mathematics.education

View full text Add to dashboard Cite

The Hill Cipher cryptosystem is a symmetry key cryptosystem. This cryptosystem uses the concept of integer over modulo p. This cryptosystem uses a matrix K as a secret key. We must choose the key matrix K which has an inverse in modulo p. This secret key matrix will be used by the sender and recipient of the message to encrypt and descript the message. For this reason, this paper will discuss the generalization of Hill Cipher using matrices over complex numbers. Calculation of determinants and inverses of the matrix K will adopt a system of determinant and inverse calculations on Hill Cipher. The results show that the proposed cryptosystem scrambles the plaintext.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Hill Cipher Cryptosystem over Complex Numbers

Maxrizal¹

2019

indonesian.j.of.mathematics.education

View full text Add to dashboard Cite

show abstract

“…The image encryption using an Advanced Hill Cipher algorithm has been introduced by (Acharya et al, 2007) to solve the problem of the inverse key matric that usually did not exist in Hill Cipher algorithm, hence, eliminating the computation need to be done by the receiver to compute the inverse key. Acharya et al (2010) was then modified the original Hill Cipher with an involuntary key by using iterations and interlacing. However, the solution only focused on a single grayscale image, thus making the result unreliable due to limited analysis.…”

Section: Related Workmentioning

confidence: 99%

Extensive Analysis on Images Encryption using Hybrid Elliptic Curve Cryptosystem and Hill Cipher

Sulaiman¹,

Hanapi²

2021

Journal of Computer Science

View full text Add to dashboard Cite

“…If the encryption matrix is irreversible, the ciphertext cannot be restored to plaintext. To avoid a strong correlation between the encryption matrix elements, we use a hyper-chaotic sequence to construct self-inverse encryption matrix to reduce the correlation between matrices so that the ciphertext is difficult to crack [32].…”

Section: The Construction Of Hill Encryption Matrixmentioning

confidence: 99%

An Image Encryption Method Based on the Feistel Network and Dynamic DNA Encoding

2018

View full text Add to dashboard Cite

Based on the Feistel network and dynamic deoxyribonucleic acid (DNA) encoding technology, an image encryption method is proposed using the "permutation-diffusionscrambling" structure. First, the SHA-3 algorithm is used to calculate the hash value of the plaintext image as the initial value of the hyperchaotic system, and the chaos-generated sequence is used to generate the Hill cipher matrix to replace the image pixel. Second, the DNA sequence operation is used as the F function of the Feistel network. The DNA sequence database is used as the key K of Feistel network, and the image pixel value diffusion is realized by the Feistel network. Finally, further diffusion is carried out through the ciphertext feedback and through the ciphertext confusion and diffusion of three rounds of "chaotic scrambling-DNA encoding-Feistel transformation-DNA decoding," making the ciphertext more random and resistant to attacks and ensuring that the encrypted ciphertext is more secure. The experimental results show that the proposed method can effectively encrypt the image and has prominent characteristics, such as strong plaintext sensitivity, a large key space, and excellent ciphertext statistical properties.

show abstract

Privacy protection of biometric traits using modified hill cipher with involutory key and robust cryptosystem

Cited by 11 publications

References 7 publications

Hill Cipher Cryptosystem over Complex Numbers

Hill Cipher Cryptosystem over Complex Numbers

Extensive Analysis on Images Encryption using Hybrid Elliptic Curve Cryptosystem and Hill Cipher

An Image Encryption Method Based on the Feistel Network and Dynamic DNA Encoding

Contact Info

Product

Resources

About