An Efficient Binary Playfair Algorithm Using a 4×4 Playfair Key Matrix

Abstract : Playfair cipher is a digraph cipher which is not preferred now a day for two main reasons. Firstly, it can be easily cracked if there is enough text and secondly, frequency analysis of digraph is anyway possible. This paper proposes a new solution, which encrypts / decrypts each byte by applying the Playfair on its nibbles with the help of a reduced 4×4 Key matrix. This byte by byte encryption supports any character (even multilingual character), number (of any base), symbol and any type of media file and thereby ensures flexibility. Randomness of the algorithm is achieved by rotating the key matrix randomly after encryption / decryption of each byte. Several operations are performed to support the mechanism of lightweight cryptography. The proposed method is implemented and compared with other popular ciphers on the basis of certain parameters, like Avalanche Effect, Time Complexity, and Space Requirement. The result obtained demonstrates efficiency of the proposed algorithm.
Type de document :
Communication dans un congrès
Agostino Cortesi; Nabendu Chaki; Khalid Saeed; Sławomir Wierzchoń. 11th International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2012, Venice, Italy. Springer, Lecture Notes in Computer Science, LNCS-7564, pp.314-325, 2012, Computer Information Systems and Industrial Management. 〈10.1007/978-3-642-33260-9_27〉
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01551712
Contributeur : Hal Ifip <>
Soumis le : vendredi 30 juin 2017 - 14:43:07
Dernière modification le : lundi 20 août 2018 - 18:32:02
Document(s) archivé(s) le : lundi 22 janvier 2018 - 21:54:30

Fichier

978-3-642-33260-9_27_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Saswati Mukherjee, Matangini Chattopadhyay, Ayan Lahiri, Samiran Chattopadhyay. An Efficient Binary Playfair Algorithm Using a 4×4 Playfair Key Matrix. Agostino Cortesi; Nabendu Chaki; Khalid Saeed; Sławomir Wierzchoń. 11th International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2012, Venice, Italy. Springer, Lecture Notes in Computer Science, LNCS-7564, pp.314-325, 2012, Computer Information Systems and Industrial Management. 〈10.1007/978-3-642-33260-9_27〉. 〈hal-01551712〉

Partager

Métriques

Consultations de la notice

93

Téléchargements de fichiers

164