Paper 2024/1269
Cryptographic Security through Kleene’s Theorem and Automata Theory
Abstract
This study addresses the challenge of strengthening cryptographic security measures in the face of evolving cyber threats. The aim is to apply Kleene's Theorem and automata theory to improve the modeling and analysis of cybersecurity scenarios, focusing on the CyberMoraba game. Representing the game's strategic moves as regular expressions and mapping them onto finite automata provides a solid framework for understanding the interactions between attackers and defenders. This approach helps in identifying optimal strategies and predicting potential outcomes, which contributes to the development of stronger cryptographic security protocols. The research advances the theoretical use of automata theory in cybersecurity while offering practical insights into enhancing defense mechanisms against complex cyber attacks. This work connects theoretical computer science with practical cybersecurity, demonstrating the importance of automata theory in cryptology.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Automata TheoryKleene’s TheoremFinite AutomataCyber Attack Modeling
- Contact author(s)
- mike wankongolo @ up ac za
- History
- 2024-08-12: approved
- 2024-08-10: received
- See all versions
- Short URL
- https://ia.cr/2024/1269
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1269, author = {Mike Wa Nkongolo}, title = {Cryptographic Security through Kleene’s Theorem and Automata Theory}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1269}, year = {2024}, url = {https://eprint.iacr.org/2024/1269} }