Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01551712
Contributor : Hal Ifip <>
Submitted on : Friday, June 30, 2017 - 2:43:07 PM
Last modification on : Monday, August 20, 2018 - 6:32:02 PM
Long-term archiving on: : Monday, January 22, 2018 - 9:54:30 PM

File

978-3-642-33260-9_27_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Saswati Mukherjee, Matangini Chattopadhyay, Ayan Lahiri, Samiran Chattopadhyay. An Efficient Binary Playfair Algorithm Using a 4×4 Playfair Key Matrix. 11th International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2012, Venice, Italy. pp.314-325, ⟨10.1007/978-3-642-33260-9_27⟩. ⟨hal-01551712⟩

Share

Metrics

Record views

164

Files downloads

586