| Issue |
ITM Web Conf.
Volume 50, 2022
Fourth International Conference on Advances in Electrical and Computer Technologies 2022 (ICAECT 2022)
|
|
|---|---|---|
| Article Number | 01007 | |
| Number of page(s) | 9 | |
| Section | Recent Computer Technologies | |
| DOI | https://doi.org/10.1051/itmconf/20225001007 | |
| Published online | 15 December 2022 | |
Cryptography using Automata Theory
VIT, Pune, Maharashtra, India
Encryption and decryption are the two most crucial components of cryptography. Data protection is the main objective of both systems. We utilised encryption to transform plain text into ciphertext. Decryption, which works the other way around from encryption, is the process of converting encrypted text back into plain text. By using a finite state machine and the LU decomposition method, the created encryption solution ensures data secrecy for safe communication. In our suggested approach, we additionally employ lower and upper triangular matrices, which are obtained by decomposing a square matrix. During encryption, the key will be a lower triangular matrix modulated by a prime number, and during decryption, an upper triangular matrix modulated by a prime number. The tactic is beneficial. This tactic is helpful in sectors such as finance and military services where confidential material must be delivered.
© The Authors, published by EDP Sciences, 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.