Graph invariants are pivotal tools for analyzing complex structures across diverse fields. The metric dimension, measuring the smallest set of vertices required for unique vertex identification, is fundamental. Building upon this notion, fault-tolerant metric dimension ensures robust identification, even amid vertex disruptions. This study delves into fault-tolerant resolving sets within kekulene graphs, preserving unique vertex identification despite potential vertex perturbations. Notably, this exploration marks the pioneering investigation of metric dimension and fault-tolerant metric dimension tailored to Kekulene graphs, adding a unique scholarly contribution. Furthermore, the methodologies developed extend beyond Kekulene graphs and apply to a broader spectrum including hollow-coronoid and hollow hexagon graphs. By elucidating faulttolerant resolving sets, this research advances our understanding of kekulene graphs and their metric dimensions while illuminating significant implications for cryptographic applications. Bridging graph theory with molecular structures, this interdisciplinary endeavour showcases how robust identification methods bolster security and reliability in cryptographic systems. These insights underscore the potential for enhancing cryptographic algorithms by integrating fault-tolerant metric dimensions, ensuring heightened resilience and security.