| Autor: |
Sugirtham, N., Jenny, R. Sherine, Thiyaneswaran, B., Kumarganesh, S., Venkatesan, C., Sagayam, K. Martin, Dang, Lam, Dinh, Linh, Dang, Hien |
| Předmět: |
|
| Zdroj: |
International Journal of Networked & Distributed Computing; Jun2024, Vol. 12 Issue 1, p108-118, 11p |
| Abstrakt: |
Cryptography secures data and serves to ensure the confidentiality of records. Playfair is a cryptographic symmetrical algorithm that encrypts statistics based on key costs. This secret is shared with an authorized person to retrieve data. In the conventional pattern, there is an area complexity and deficiency in letters, numbers, and special characters. This hassle has been overcome in previous studies by editing pattern dimensions. The fillers used throughout the enciphering were not eliminated during the retrieval process, which resulted in the indiscrimination of the retrieved statistics. The proposed method uses a separate quadrate pattern that strengthens the Playfair cipher and guarantees that the fillers are eliminated to ensure the authentic retrieval of records. The fillers indiscriminate and strengthen the set of rules in opposition to brute force and avalanche impact. The proposed algorithm was evaluated with a minimal change in the key, and was found to have an avalanche effect between 65% and 93.7%. The encrypted document is further encoded using the Lempel–Ziv–Markov chain algorithm (LZMA) to provide compressed second-level secured text with a compression ratio of 0.75 for a file size of 100 KB. The pattern was designed to subsidize the integrated characters found on the keyboard. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink