| Autor: |
Ajagbe, Sunday Adeola, Adeniji, Oluwashola David, Olayiwola, Adedayo Amos, Abiona, Seun Femi |
| Zdroj: |
SN Computer Science; January 2024, Vol. 5 Issue: 1 |
| Abstrakt: |
Data encryption which is associated with cryptography is necessary to prevent the compromise of Personally Identifying. Multi-level security is ensured by combining the Huffman code with certain cryptographic techniques, such as symmetric encryption algorithms. In order to decode the message, Huffman code can access both the code wordlist and the encoded bits. Inadequate error-correcting techniques with encoded bits can be harmed in this way, leading to the complete loss of information. Nevertheless, sending code wordlists and bits of code to the recipient takes a lot of transmission time. It is necessary to offer strategies for countermeasures to secure and fix the broken encoded bit. So, the problem is to safeguard the original wordlist from tampering without compromising the current code bit. Information. The goal of the investigation is to reduce interference in the levels of communication between the reader and the card. Due to the card's susceptibility, a Mifare classic 1K and Radio Frequency Identification (RFID) were used in this study's simulation. The experiment when N= 200 was conducted and the result below was obtained. The number of unique characters at 0.5 in AES running mode with 0.023 ms at CBC optimal and ECB 0.023 ms. It was possible to simulate the Advanced Encryption Standard (AES) using changing bytes and a number of unique characters. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
Full text from SpringerLink